# An Accurate Block Hybrid Collocation Method for Third Order Ordinary Differential Equations

Authors: Lee Ken Yap; Fudziah Ismail; Norazak Senu
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

The block hybrid collocation method with two off-step points is proposed for the direct solution of general third order ordinary differential equations. Both the main and additional methods are derived via interpolation and collocation of the basic polynomial. These methods are applied in block form to provide the approximation at five points concurrently. The stability properties of the block method are investigated. Some numerical examples are tested to illustrate the efficiency of the method. The block hybrid collocation method is also implemented to solve the nonlinear Genesio equation and the problem in thin film flow.


---

## Body

## 1. Introduction

Consider the general third order ordinary differential equations (ODEs):(1)
y
′′′
=
f
(
x
,
y
,
y
′
,
y
′′
)
,
with the initial conditions
(2)
y
(
a
)
=
y
0
,
y
′
(
a
)
=
y
0
′
,
y
′′
(
a
)
=
y
0
′′
,
x
∈
[
a
,
b
]
.In particular, the third order differential equations arise in many physical problems such as electromagnetic waves, thin film flow, and gravity-driven flows (see [1–6]). Therefore, third order ODEs have attracted considerable attention. Many theoretical and numerical studies dealing with such equations have appeared in the literature. The popular approach for solving third order ODEs is by converting the problems to a system of first order ODEs and solving it using the method available in the literature. Awoyemi and Idowu [7], Jator [8], Mehrkanoon [9], and Bhrawy and Abd-Elhameed [10] remarked the drawback of this approach whereby it required complicated computational work and lengthy execution time. The studies on direct approach to higher order ODEs demonstrated the advantages in speed and accuracy.Some attentions [8, 11–14] have been focused on direct solution of second order ODEs. Fatunla [12] suggested the zero-stable 2-point block method to solve special second order ODEs. On the other hand, Omar et al. [13] and Majid and Suleiman [14] studied parallel implementation of the direct block methods. Jator [8, 11] proposed a class of hybrid collocation methods and emphasized the accuracy advantage on self-starting method. The only necessary starting value for evaluation at the next block is the last value from the previous block. Since the loss of accuracy does not affect the subsequent points, the order of the method is maintained.Some attempts have been made to solve third order ODEs directly using collocation method. Awoyemi [15] considered the P-stable linear multistep collocation method. Meanwhile, Awoyemi and Idowu [7] proposed the hybrid collocation method with an off-step point, x
n
+
3
/
2. Both schemes are implemented in predictor-corrector mode to obtain the approximation at x
n
+
3. The Taylor series expansion is employed for the computation of initial values. Olabode and Yusuph [16] applied the interpolation and collocation technique on power series to derive 3-step block method, and it was implemented as simultaneous integrator to special third order ODEs. Bhrawy and Abd-Elhameed [10] developed the shifted Jacobi-Gauss collocation spectral method for general nonlinear third order differential equations. Adesanya et al. [17] proposed a self-starting block predictor-corrector method whereby the derivation involved interpolation and collocation of power series at x
n
+
j, for j
=
1
(
1
)
3 and j
=
0
(
1
)
4, respectively.Several direct variable step methods have also been proposed in literature to solve general third order ODEs. For instance, Mehrkanoon [9] implemented the direct three-point block multistep method of Adams type formulas in PECE mode with variable step size and Gauss Seidel iteration. Majid et al. [18] presented the 2-point 4-step implicit block method with the application of the simple form in Adams-Moulton method using variable step size.Here, we are going to derive the block hybrid collocation method for the direct solution of general third order ODEs. The method is along the lines proposed by Jator [11] and Awoyemi and Idowu [7]. The derivation involves interpolation and collocation of the basic polynomial. The collocation method approximates the solution of y with basic polynomial which satisfies the initial conditions and differential equations at all points. This approach generates the main and the additional methods which can be combined and used as block method. In m-point block method, the interval is divided into series of blocks with each block containing m-points. The application of m-point block method generates a block of new solution concurrently.


## 2. Derivation of Block Hybrid Collocation Methods

The hybrid collocation method that produces approximationsy
n
+
k, y
n
+
k
′, and y
n
+
k
′′ to the general third order ODEs is given as follows:
(3)
∑
j
=
0
k
α
j
y
n
+
j
+
∑
j
=
1
2
α
ν
j
y
n
+
ν
j
=
h
3
(
∑
j
=
0
k
β
j
f
n
+
j
+
∑
j
=
1
2
β
ν
j
f
n
+
ν
j
)
.In order to obtain (3), we approximate the solution by the interpolating function Y
(
x
) of the form
(4)
Y
(
x
)
=
∑
j
=
0
r
+
s
-
1
ϕ
j
x
j
,
where(i)
x
∈
[
a
,
b
],
(ii)
ϕ
j are unknown coefficients to be determined,
(iii)
r is the number of interpolations for 1
≤
r
≤
k, and
(iv)
s is the number of distinct collocation points with s
>
0.The continuous approximation is constructed by imposing the following conditions:(5)
Y
(
x
n
+
j
)
=
y
n
+
j
,
j
=
0,1
,
2
,
…
,
r
-
1
,
(6)
Y
′′′
(
x
n
+
μ
)
=
f
n
+
μ
,
μ
=
{
j
,
ν
1
,
ν
2
}
,
j
=
0,1
,
2
,
…
,
k
,
where ν
1 and ν
2 are not integers. Interpolating (5) at the points x
n, x
n
+
1, x
n
+
2 and collocating (6) at the points x
n, x
n
+
1
/
2, x
n
+
1, x
n
+
3
/
2, x
n
+
2, and x
n
+
3 lead to a system of nine equations, which can be solved by Mathematica software to obtain the coefficient ϕ
j. The values of ϕ
j are substituted into (4) to obtain the continuous multistep method of the form
(7)
Y
(
x
)
=
∑
j
=
0
k
α
j
y
n
+
j
+
h
3
(
∑
j
=
0
k
β
j
f
n
+
j
+
∑
j
=
1
2
β
ν
j
f
n
+
ν
j
)
,
where α
j, β
j, and β
ν
j are constant coefficients. Hence, the block hybrid collocation method can be derived as follows.Main Method. Consider
(8)
y
n
+
3
=
3
y
n
+
2
-
3
y
n
+
1
+
y
n
+
h
3
90
×
(
f
n
+
36
f
n
+
1
+
16
f
n
+
3
/
2
+
36
f
n
+
2
+
f
n
+
3
)
.Additional Method. Consider
(9)
y
n
+
3
/
2
=
3
8
y
n
+
2
+
3
4
y
n
+
1
-
1
8
y
n
+
h
3
92160
×
(
-
19
f
n
-
648
f
n
+
1
/
2
-
2979
f
n
+
1
11111
-
2104
f
n
+
3
/
2
-
9
f
n
+
2
-
f
n
+
3
)
,
y
n
+
1
/
2
=
-
1
8
y
n
+
2
+
3
4
y
n
+
1
+
3
8
y
n
+
h
3
92160
×
(
29
f
n
+
2040
f
n
+
1
/
2
+
3069
f
n
+
1
11111
+
584
f
n
+
3
/
2
+
39
f
n
+
2
-
f
n
+
3
)
.It is noted that the general third order ODEs involve the first and second derivatives. These derivatives can be obtained by imposing that(10)
Y
′
(
x
)
=
1
h
(
∑
j
=
0
k
α
j
′
y
n
+
j
+
h
3
(
∑
j
=
0
k
β
j
′
f
n
+
j
+
∑
j
=
1
2
β
ν
j
′
f
n
+
ν
j
)
)
Y
′′
(
x
)
=
1
h
2
(
(
∑
j
=
0
k
β
j
′′
f
n
+
j
+
∑
j
=
1
2
β
ν
j
′′
f
n
+
ν
j
)
∑
j
=
0
k
α
j
′′
y
n
+
j
111111111111
+
h
3
(
∑
j
=
0
k
β
j
′′
f
n
+
j
+
∑
j
=
1
2
β
ν
j
′′
f
n
+
ν
j
)
)
.The values ofϕ
j are substituted into
(11)
Y
′
(
x
)
=
∑
j
=
1
r
+
s
-
1
j
ϕ
j
x
j
-
1
,
Y
′′
(
x
)
=
∑
j
=
2
r
+
s
-
1
j
(
j
-
1
)
ϕ
j
x
j
-
2
to generate the formula for the first and second derivatives of the method. Thus, we obtain
(12)
h
y
n
′
=
-
1
2
y
n
+
2
+
2
y
n
+
1
-
3
2
y
n
+
h
3
7560
×
(
118
f
n
+
1296
f
n
+
1
/
2
+
819
f
n
+
1
11111
+
304
f
n
+
3
/
2
-
18
f
n
+
2
+
f
n
+
3
)
,
h
y
n
+
1
/
2
′
=
y
n
+
1
-
y
n
+
h
3
241920
×
(
-
449
f
n
-
9312
f
n
+
1
/
2
-
99
f
n
+
1
1111111
-
320
f
n
+
3
/
2
+
105
f
n
+
2
-
5
f
n
+
3
)
,
h
y
n
+
1
′
=
1
2
y
n
+
2
-
1
2
y
n
+
h
3
2520
×
(
-
f
n
-
80
f
n
+
1
/
2
-
258
f
n
+
1
111111
-
80
f
n
+
3
/
2
-
f
n
+
2
)
,
h
y
n
+
3
/
2
′
=
y
n
+
2
-
y
n
+
1
+
h
3
241920
×
(
5
f
n
-
549
f
n
+
1
-
8992
f
n
+
3
/
2
111111
-
549
f
n
+
2
+
5
f
n
+
3
)
,
h
y
n
+
2
′
=
3
2
y
n
+
2
-
2
y
n
+
1
+
1
2
y
n
+
h
3
7560
×
(
2
f
n
+
240
f
n
+
1
/
2
+
909
f
n
+
1
11111
+
1232
f
n
+
3
/
2
+
138
f
n
+
2
-
f
n
+
3
)
,
h
y
n
+
3
′
=
5
2
y
n
+
2
-
4
y
n
+
1
+
3
2
y
n
+
h
3
7560
×
(
343
f
n
-
1296
f
n
+
1
/
2
+
7758
f
n
+
1
11111
-
2000
f
n
+
3
/
2
+
8595
f
n
+
2
+
460
f
n
+
3
)
,
h
2
y
n
′′
=
y
n
+
2
-
2
y
n
+
1
+
y
n
+
h
3
2520
×
(
-
398
f
n
-
1584
f
n
+
1
/
2
-
201
f
n
+
1
11111
-
400
f
n
+
3
/
2
+
66
f
n
+
2
-
3
f
n
+
3
)
,
h
2
y
n
+
1
/
2
′′
=
y
n
+
2
-
2
y
n
+
1
+
y
n
+
h
3
40320
×
(
345
f
n
-
5744
f
n
+
1
/
2
-
13443
f
n
+
1
11111
-
912
f
n
+
3
/
2
-
421
f
n
+
2
+
15
f
n
+
3
)
,
h
2
y
n
+
1
′′
=
y
n
+
2
-
2
y
n
+
1
+
y
n
+
h
3
7560
×
(
-
11
f
n
+
624
f
n
+
1
/
2
+
90
f
n
+
1
11111
-
752
f
n
+
3
/
2
+
51
f
n
+
2
-
2
f
n
+
3
)
,
h
2
y
n
+
3
/
2
′′
=
y
n
+
2
-
2
y
n
+
1
+
y
n
+
h
3
40320
×
(
121
f
n
+
1872
f
n
+
1
/
2
+
12093
f
n
+
1
11111
+
6704
f
n
+
3
/
2
-
645
f
n
+
2
+
15
f
n
+
3
)
,
h
2
y
n
+
2
′′
=
y
n
+
2
-
2
y
n
+
1
+
y
n
+
h
3
2520
×
(
-
6
f
n
+
208
f
n
+
1
/
2
+
471
f
n
+
1
11111
+
1392
f
n
+
3
/
2
+
458
f
n
+
2
-
3
f
n
+
3
)
,
h
2
y
n
+
3
′′
=
y
n
+
2
-
2
y
n
+
1
+
y
n
+
h
3
2520
×
(
295
f
n
-
1584
f
n
+
1
/
2
+
4902
f
n
+
1
11111
-
4432
f
n
+
3
/
2
+
5169
f
n
+
2
+
690
f
n
+
3
)
.


## 3. Order and Stability Properties

Extending the idea of Henrici [19] and Jator [8], the linear difference operator L associated with (3) is defined by
(13)
L
[
y
(
x
)
;
h
]
=
∑
j
=
0
k
[
α
j
y
(
x
+
j
h
)
-
h
3
β
j
y
′′′
(
x
+
j
h
)
]
+
∑
j
=
1
2
[
α
ν
j
y
(
x
+
ν
j
h
)
-
h
3
β
ν
j
y
′′′
(
x
+
ν
j
h
)
]
,
where y
(
x
) is an arbitrary function that is sufficiently differentiable. We expand the test function y
(
x
+
j
h
) and its third derivative y
′′′
(
x
+
j
h
) about x and collect the terms to obtain
(14)
L
[
y
(
x
)
;
h
]
=
C
0
y
(
x
)
+
C
1
h
y
′
(
x
)
+
⋯
+
C
q
h
q
y
(
q
)
(
x
)
+
⋯
whose coefficients C
q for q
=
0,1
,
… are constants and given as
(15)
C
0
=
∑
j
=
0
k
α
j
+
∑
j
=
1
2
α
ν
j
C
1
=
∑
j
=
1
k
j
α
j
+
∑
j
=
1
2
ν
j
α
ν
j
C
1
1
⋮
C
q
=
1
q
!
[
∑
j
=
1
k
j
q
α
j
+
∑
j
=
1
2
ν
j
q
α
ν
j
]
C
q
=
-
1
(
q
-
3
)
!
[
∑
j
=
1
k
j
q
-
3
β
j
+
∑
j
=
1
2
ν
j
q
-
3
β
ν
j
]
.The associated linear multistep method and the linear difference operator are said to be of orderp, if C
0
=
C
1
=
⋯
=
C
p
+
2
=
0 and C
p
+
3
≠
0. The main method and the two additional methods have order p
=
6 with the error constants; C
9 are -
19
/
120960, 41
/
61931520, and 41
/
61931520, respectively. The block hybrid collocation method is consistent since it has order p
>
1.To analyze the zero stability, (8)–(12) are normalized. Zero stability can be described by matrix finite difference equation as follows:
(16)
I
5
Y
m
+
1
=
A
(
1
)
Y
m
+
h
3
(
B
(
0
)
F
m
+
1
+
B
(
1
)
F
m
)
I
5
Y
m
+
1
=
+
h
2
C
(
1
)
Y
m
′′
+
h
D
(
1
)
Y
m
′
with
(17)
Y
m
+
1
=
[
y
n
+
1
/
2
,
y
n
+
1
,
y
n
+
3
/
2
,
y
n
+
2
,
y
n
+
3
]
T
Y
m
=
[
y
n
-
2
,
y
n
-
3
/
2
,
y
n
-
1
,
y
n
-
1
/
2
,
y
n
]
T
F
m
+
1
=
[
f
n
+
1
/
2
,
f
n
+
1
,
f
n
+
3
/
2
,
f
n
+
2
,
f
n
+
3
]
T
F
m
=
[
f
n
-
2
,
f
n
-
3
/
2
,
f
n
-
1
,
f
n
-
1
/
2
,
f
n
]
T
,
Y
m
′′
=
[
y
n
-
2
′′
,
y
n
-
3
/
2
′′
,
y
n
-
1
′′
,
y
n
-
1
/
2
′′
,
y
n
′′
]
T
Y
m
′
=
[
y
n
-
2
′
,
y
n
-
3
/
2
′
,
y
n
-
1
′
,
y
n
-
1
/
2
′
,
y
n
′
]
T
and constant matrices
(18)
I
5
=
5
×
5
identity
matrix
;
A
(
1
)
=
[
0
-
9
8
0
-
27
16
3
8
0
9
2
0
27
4
-
3
2
0
3
8
0
9
16
-
1
8
0
-
3
0
-
9
2
1
0
-
3
0
-
9
2
1
]
;
B
(
0
)
=
[
17
768
-
7
128
73
11520
-
7
256
-
1
92160
6
35
-
1
4
38
945
-
7
60
1
7560
-
9
1280
9
128
-
263
11520
11
256
-
1
92160
-
22
35
7
12
-
10
63
1
4
-
1
840
0
-
3
2
8
45
-
5
4
1
90
]
;
B
(
1
)
=
[
0
-
29
30720
0
-
29
20480
29
92160
0
-
59
1260
0
-
59
840
59
3780
0
19
30720
0
19
20480
-
19
92160
0
199
420
0
199
280
-
199
1260
0
-
1
30
0
-
1
20
1
90
]
;
C
(
1
)
=
[
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
3
0
9
2
-
1
0
0
0
0
0
]
;
D
(
1
)
=
[
0
0
0
0
0
0
3
0
9
2
-
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
]
.The first characteristic polynomial is defined as(19)
ρ
(
z
)
=
Det
[
z
A
(
0
)
-
A
(
1
)
]
=
z
4
(
z
-
1
)
.Since the roots of the first characteristic polynomial are modulus less than or equal to one, the method is zero stable. This property, together with the consistency of the method, implies the convergence (see Henrici [19]) of the block method.


## 4. Numerical Examples and Discussion

To illustrate the effectiveness of the block hybrid collocation method, the test Problems1–3 are solved numerically. The block hybrid collocation method is implemented and leads to a system of fifteen equations. The code is written and executed in Mathematica 8.0 to obtain the numerical solutions. A built-in Mathematica package, namely, LinearSolve
[
m
,
b
], is applied in the algorithm to solve the linear system for numerical results. In general, this package solves the matrix equation m
·
x
=
b and returns a vector x.The block hybrid collocation method is then compared with the existing methods [7, 15–17, 20] for direct solution of general third order ODEs. The block hybrid collocation method is also compared with the Adams Bashforth-Adams Moulton method. The well-known fourth order Runge Kutta method is applied to obtain the starting values for Adams method, whereby the third order ODEs are reduced to system of first order ODEs.Problem 1.
Consider(20)
y
′′′
-
2
y
′′
-
3
y
′
+
10
y
=
34
x
e
-
2
x
-
16
e
-
2
x
y
′′′
-
2
y
′′
-
3
y
′
+
10
y
=
-
10
x
2
+
6
x
+
34
y
(
0
)
=
3
,
y
′
(
0
)
=
y
′′
(
0
)
=
0
,
x
∈
[
0
,
b
]
.
Exact Solution:y
(
x
)
=
x
2
e
-
2
x
-
x
2
+
3.
Source: Majid et al. [18].Problem 2.
Consider(21)
y
′′′
+
y
′
=
0
y
(
0
)
=
0
,
y
′
(
0
)
=
1
,
y
′′
(
0
)
=
2
,
x
∈
[
0
,
b
]
.
Exact Solution:y
(
x
)
=
2
(
1
-
cos
⁡
x
)
+
sin
x.
Source: Majid et al. [18].Problem 3.
Consider(22)
y
′′′
=
3
sin
x
y
(
0
)
=
1
,
y
′
(
0
)
=
0
,
y
′′
(
0
)
=
-
2
,
x
∈
[
0
,
b
]
.
Exact Solution:y
(
x
)
=
3
cos
⁡
x
+
x
2
/
2
-
2.
Source: Adesanya et al. [17].The performance comparison between block hybrid collocation method with the existing results [7, 9, 15–17, 20] and the Adams Bashforth-Adams Moulton method is presented in Tables 1–4. The following notations are used in the tables.h: step size.
BHCM: block hybrid collocation method.
Adams: Adams Bashforth-Adams Moulton method.
Awoyemi (1): P-stable multistep method in Awoyemi [15].
Awoyemi (2): hybrid collocation method in Awoyemi and Idowu [7].
Awoyemi (3): nonsymmetric collocation method in Awoyemi et al. [20].
Adesanya: block predictor-corrector method in Adesanya et al. [17].
Mehrkanoon: variable step three-point block multistep method in Mehrkanoon [9].
Olabode: block method for special third order ODEs in Olabode and Yusuph [16].
Step: total number of steps taken to obtain solution.
Time: execution time taken in microseconds.
Maxe: magnitude of the maximum error of the computed solution.Table 1
Numerical results for Problem1.
b
h
Method
Step
Maxe
1.0
0.0125
BHCM
27
4.23
×
1
0
-
12
Adams
80
3.56
×
1
0
-
8
Awoyemi(2)
80
7.60
×
1
0
-
6
0.00625
BHCM
54
7.24
×
1
0
-
14
Adams
160
3.23
×
1
0
-
9
Awoyemi(2)
160
9.54
×
1
0
-
7
4.0
0.01
BHCM
134
3.50
×
1
0
-
11
Adams
400
2.91
×
1
0
-
6
Awoyemi(1)
400
1.16
×
1
0
-
3
0.005
BHCM
267
3.30
×
1
0
-
14
Adams
800
2.10
×
1
0
-
7
Awoyemi(1)
800
1.46
×
1
0
-
4Table 2
Numerical results for Problem2.
b
h
Method
Step
Maxe
1.0
0.1
BHCM
4
1.11
×
1
0
-
10
Adams
10
2.76
×
1
0
-
6
Awoyemi(3)
10
1.07
×
1
0
-
6
Adesanya
3
5.14
×
1
0
-
5
5.0
BHCM
67
1.19
×
1
0
-
12
Adams
200
9.72
×
1
0
-
8
Awoyemi(1)
200
3.53
×
1
0
-
6
10.0
BHCM
134
2.11
×
1
0
-
12
Adams
400
1.83
×
1
0
-
7
0.025
Awoyemi(1)
400
2.25
×
1
0
-
6
15.0
BHCM
200
2.33
×
1
0
-
12
Adams
600
3.16
×
1
0
-
7
Awoyemi(1)
600
9.85
×
1
0
-
6
20.0
BHCM
267
3.48
×
1
0
-
12
Adams
800
4.58
×
1
0
-
7
Awoyemi(1)
800
6.31
×
1
0
-
6Table 3
Numerical results for Problem3.
b
h
Method
Step
Maxe
1.0
0.01
BHCM
34
7.48
×
1
0
-
17
Adams
100
6.40
×
1
0
-
10
Olabode
34
8.89
×
1
0
-
13
Adesanya
25
1.75
×
1
0
-
14Table 4
Comparison of numerical results for nonlinear Genesio equation.
b
Mehrkanoon
BHCM
TOL
Step
y
h
Step
y
1.0
1
0
-
6
17
−0.054005
0.1
4
−0.05400408324564678
1
0
-
10
26
−0.054003
0.01
34
−0.05400408355473926
4.0
1
0
-
6
23
−0.067921
0.1
13
−0.06763059062408930
1
0
-
10
45
−0.067692
0.01
133
−0.06763060515900272The maximum error is defined as(23)
Maxe
=
max
⁡
1
≤
i
≤
Step
⁡
(
|
y
(
x
i
)
-
y
i
|
)
.Tables1–3 show that the block hybrid collocation method has better performance in terms of accuracy and number of steps to obtain the solution compared to Adams Bashforth-Adams Moulton method.In Table1, a direct comparison is made between Awoyemi methods [7, 15] and our block hybrid collocation method. For b
=
1, BHCM has better approximation compared to Awoyemi hybrid collocation method [7] for step sizes h
=
0.0125 and h
=
0.00625. Even in the larger interval (b
=
4), BHCM has higher order of accuracy when compared to Awoyemi P-stable multistep method [15] using h
=
0.01 and h
=
0.005. It is obvious that BHCM requires less steps to obtain the solutions compared to Awoyemi methods [7, 15].Table2 shows that BHCM manages to achieve better accuracy and less total steps compared to Awoyemi P-stable multistep method [15] for constant step size 0.025 when b
=
5,10,15, and 20. Furthermore, BHCM gain better accuracy compared to Awoyemi nonsymmetric collocation method [20] and Adesanya block predictor-corrector method [17] when h
=
0.1 and b
=
1. Table 3 shows the superiority of BHCM in terms of accuracy over Adesanya block predictor-corrector method [17] and Olabode block method [16] for special third order ODEs.Figures1, 2, and 3 depict the performance comparison between BHCM and the existing methods: Awoyemi hybrid collocation method [7], Awoyemi P-stable multistep method [15], and Adams Bashforth-Adams Moulton method, respectively. It shows that BHCM is more efficient than the existing methods in terms of accuracy. BHCM also requires less computational time compared to the existing methods. This is expected since BHCM calculates the approximation at three main points concurrently.Figure 1
Performance comparison for Problem1 when b
=
1.Performance comparison for Problem2 when b
=
40.
(a)
Maxe versus step size
(b)
Time versus step sizeFigure 3
Performance comparison for Problem3 when b
=
1.


## 5. Application to Solve Nonlinear Genesio Equation

Here we consider the nonlinear chaotic system from Genesio and Tesi [1]
(24)
x
′′′
+
A
x
′′
+
B
x
′
-
f
(
x
(
t
)
)
=
0
with
(25)
f
(
x
(
t
)
)
=
-
C
x
(
t
)
+
x
2
(
t
)
that is subject to the following initial conditions:
(26)
x
(
0
)
=
0.2
,
x
′
(
0
)
=
-
0.3
,
x
′′
(
0
)
=
0.1
,
111111111111111111111111111111
t
∈
[
0
,
b
]
,
where A
=
1.2, B
=
2.92, and C
=
6 are the positive constants that satisfied A
B
<
C for the existence of the solution.BHCM is implemented together with a built-in Mathematica package, namely,FindRoot, for the solution of nonlinear system based on Newton’s method. In order to apply BHCM and Newton’s method at the next block, the last value from previous block is used as starting value and initial guess, respectively.The numerical solutions are compared with the numerical solutions obtained in Mehrkanoon [9], Bataineh et al. [2], and the Mathematica built-in package NDSolve.Table4 shows the comparison in the numerical approximation of y at the end points b
=
1 and b
=
4. BHCM achieves similar approximation as Mehrkanoon variable step three-point block multistep method [9].Figure4 depicts the numerical solutions for the nonlinear Genesio equation [1] in the interval [
0
,
4.5
]. Bataineh et al. [2] stated that NHAM is more stable than the numerical solution obtained by classical HAM. In fact, the solutions obtained by BHCM are in agreement with the observation of Bataineh et al. [2] using NHAM and Mathematica built-in packageNDSolve.Plot of solutions for nonlinear Genesio equation.
(a)
Solutions obtained by seven- and eight-order Runge Kutta method (RK78), homotopy analysis method (HAM), and new variant of HAM (NHAM) (adapted from Bataineh et al. [2])
(b)
Solutions obtained by BHCM withh
=
0.1


## 6. Application to Solve Problem in Thin Film Flow

The proposed method is also applied to solve the well-known physical problem regarding the thin film flow of a liquid. In fluid dynamics, Tuck and Schwartz [3] investigated some third order ODEs that are relevant to draining and coating flows. They discussed the motion of the fluid on a plane surface in which the flow is in the direction of motion along the plane. This fluid dynamics problem was formulated in an autonomous third order ODEs
(27)
y
′′′
=
f
(
y
)
,
where
(28)
f
(
y
)
=
-
1
+
y
-
2
,
f
(
y
)
=
-
1
+
(
1
+
δ
+
δ
2
)
y
-
2
-
(
δ
+
δ
2
)
y
-
3
,
f
(
y
)
=
y
-
2
-
y
-
3
,
f
(
y
)
=
y
-
2
.In the literature, some numerical methods for solving special third order ODEs have been extended to solve the problem in thin film flow. Some numerical investigation was presented in Momoniat and Mahomed [4] and Mechee et al. [5] concerning the special third order ODEs
(29)
y
′′′
=
y
-
k
with the initial conditions y
(
0
)
=
y
′
(
0
)
=
y
′′
(
0
)
=
1 for the cases k
=
2 and k
=
3.Instead of using the conventional approach of reduction to system of first order ODEs, Momoniat and Mahomed [4] applied the successive reduction by writing the third order ODEs (29) in terms of the differential invariants and solved it by fourth order Runge Kutta method. Mechee et al. [5] applied the three-stage fifth order Runge Kutta method to solve the third order physical problems (29) directly.Here we will apply the proposed block hybrid collocation method (BHCM) to solve the third order ODEs (29). The numerical solutions are compared with Momoniat and Mahomed [4] and Mechee et al. [5] in the literature. The results are displayed in Tables 5–8.Table 5
Numerical results for problem in Thin Film Flow (29) with h
=
0.1
,
k
=
2.
x
Error
Mechee
BHCM
0.2
1.07
×
1
0
-
6
1.03
×
1
0
-
6
0.4
4.13
×
1
0
-
7
1.12
×
1
0
-
7
0.6
8.51
×
1
0
-
7
2.07
×
1
0
-
9
0.8
1.71
×
1
0
-
6
1.02
×
1
0
-
8
1.0
3.86
×
1
0
-
6
9.35
×
1
0
-
7Table 6
Numerical results for problem in Thin Film Flow (29) with h
=
0.01
,
k
=
2.
x
Error
Momoniat
Mechee
BHCM
0.2
1.03
×
1
0
-
6
1.03
×
1
0
-
6
1.03
×
1
0
-
6
0.4
1.14
×
1
0
-
7
1.13
×
1
0
-
7
1.13
×
1
0
-
7
0.6
7.00
×
1
0
-
9
6.30
×
1
0
-
9
6.32
×
1
0
-
9
0.8
1.00
×
1
0
-
9
1.00
×
1
0
-
10
7.83
×
1
0
-
11
1.0
9.55
×
1
0
-
7
9.54
×
1
0
-
7
9.54
×
1
0
-
7Table 7
Numerical results for problem in Thin Film Flow (29) with h
=
0.1
,
k
=
3.
x
Mechee
BHCM
0.0
1.0000000000
1.0000000000000000
0.2
1.2211550887
1.2211551426800236
0.4
1.4881049238
1.4881052873784077
0.6
1.8042615558
1.8042625625912998
0.8
2.1715208324
2.1715228333017014
1.0
2.5909549758
2.5909583248983960Table 8
Numerical results for problem in Thin Film Flow (29) with h
=
0.01
,
k
=
3.
x
Momoniat
Mechee
BHCM
0.0
1.000000000
1.0000000000
1.0000000000000000
0.2
1.221155142
1.2211551423
1.2211551423957325
0.4
1.488105284
1.4881052838
1.4881052842194118
0.6
1.804262548
1.8042625471
1.8042625481474530
0.8
2.171522797
2.1715227960
2.1715227981283490
1.0
2.590958258
2.5909582556
2.5909582591167280Table5 demonstrates that BHCM performs slightly better compared to Mechee et al. [5] with h
=
0.1 for the case k
=
2. In Table 6, we observe that Momoniat and Mahomed [4], Mechee et al. [5], and BHCM have similar order of accuracy.Tables7 and 8 show the numerical results for the case k
=
3 with h
=
0.1 and h
=
0.01, respectively. In fact, the case k
=
3 cannot be solved analytically. Table 7 shows that BHCM manages to achieve the numerical result which agrees to six decimal places when compared to Mechee et al. [5] for h
=
0.1. In Table 8, the numerical results for BHCM agree to nine decimal places when compared to Momoniat and Mohamed [4], while they agree to ten decimal places when compared to Mechee et al. [5] for h
=
0.01.Figure5 shows the total number of steps taken to obtain the solutions versus method. It is obvious that BHCM require less steps to obtain the solution compared to Mechee et al. [5] and Momoniat and Mahomed [4]. The results are expected since the BHCM calculates the values of y at 3 points simultaneously while the Runge Kutta method in Mechee et al. [5] and Momoniat and Mahomed [4] calculates only one value of y at a time.Total steps VS method.
(a)
Total steps whenh
=
0.1
(b)
Total steps whenh
=
0.01BHCM is clearly superior in solving the problem in thin film flow (29) since it involves less computational work and yields highly accurate solutions.


## 7. Conclusion

As a whole, the numerical results demonstrate the efficiency of the block hybrid collocation method. It is observed that the block hybrid collocation method requires less number of total steps compared to Awoyemi methods [7, 15, 20]. It reduces the total number of steps to almost one-third to obtain the solution. These results are expected since the 3-point block methods calculate the values of y at three main points concurrently.The numerical results also demonstrate the accuracy of the block hybrid collocation method. It gives precise approximation as the step size decreases. When compared with the existing methods [7, 15–17, 20] and Adams Bashforth-Adams Moulton method, the block hybrid collocation method meets better accuracy for various step sizes even in larger interval.As a conclusion, the3-point block hybrid collocation method with two off-step points has been proposed and implemented as a self-starting method for third order ordinary differential equations. The results suggest a significant improvement in efficiency of the block hybrid collocation method in the direct solution of general third order ODEs. The block hybrid collocation method is applicable to solve the nonlinear Genesio equation [1] and the physical problem in thin film flow [4, 5].



---

*Source: 549597-2014-05-27.xml*