International Journals Call For Paper HTTP://WWW - Iiste.org/journals

Mathematical Theory and Modeling www.iiste.
org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.2, No.10, 2012

21
DERIVATION OF A CLASS OF HYBRID ADAMS MOULTON
METHOD WITH CONTINOUS COEFFICIENTS
Alagbe, Samson Adekola.
1
Awogbemi, Clement Adeyeye
2*
Amakuro Okuata
3

1, 3
Department of Mathematics, Bayelsa State College of Education, Okpoama, Nigeria.
2.
National Mathematical Centre, Sheda-Kwali, P.M.B 118, Abuja, Nigeria.
*
E-mail of the corresponding author: awogbemiadeyeye@yahoo.com
Abstract
This research work is focused on the derivation of both the continuous and discrete models of the hybrid
Adams Moulton method for step number k =1 and k = 2. These formulations incorporate both the off
grid interpolation and off- grid collocation schemes. The convergence analysis reveals that derived
schemes are zero stable, of good order and error constants which by implication shows that the schemes
are consistent.
Keywords: Hybrids Schemes, Adams Methods, Linear KStep Method, Consistency, Zero Stable
1.0 Introduction
The derivation of hybrid Adams Moulton Schemes of both the continuous and discrete forms for the off-
grid interpolation and the off grid collocation system of polynomials is our primary focus in this
research work. Sequel to this would be to ascertain the zero stability of each of the discrete forms.
Performances of these schemes on solving some non stiff initial value problems shall be affirmed in the
second phase of this work which will focus on the application of these derived scheme and comparism of
the discrete schemes with the single Adams-Moulton Methods and its alternative in Awe (1997) and
Alagbe (1999)
In this paper we regard the Linear Multi-step Method and Trapezoidal ( Adams Moulton Method) as
extrapolation and substitution methods respectively.
We also define k Step hybrid schemes as follows:

= =
+ + +
+ =
k
i i
v n r i n i i n i
f h f hk y
0 0
. | | o (1.1)
where
0 0
, 1 | o o and
k
= are not both zero and v } ,... 1 , 0 { k e and of course ) , (
v n v n v n
y x f f
+ + + +
= .
Gregg & Stetter (1964) satisfied the co-essential condition of zero-stability, the aim of which to reduce
some of the difficult inherent in the LMM (i.e poor stability) was achieved.
Mathematical Theory and Modeling www.iiste.org
Vol.2, No.10, 2012

22
Hybrid scheme was as a result of the desire to increase the order without increasing the step number and
then without reducing the stability interval. However, the hybrid methods have not yet gained the
popularity deserved due to the presence of off-grid point which requires special predicator which will not
alternate the accuracy of the corrector to estimate them.

1.1 Adams Methods
This is an important class of linear multi-step method of the form:
) 2 . 1 ..( .......... .......... .......... . . .
720
251
8
3
12
5
2
1
1
4 3 2
1 n n n
f h y y
+ V + V + V + V + + =
+

The corrected form of Adams-Moulton form is expressed as:
) 3 . 1 ..( .......... .......... .......... ...
120
19
24
1
12
1
2
1
1
1
4 3 2
1 + +

V + V V + V + =
n n n
f h y y
The trapezoidal scheme is a special case of the Adams Moulton method, in which only the first two terms
in the bracket is retained. This method is of the highest order among the single step method. It is being
expressed as
| |
n n n
f f
h
y + =
+ + 1 1
2

2.0 Derivation of Continuous and Discrete Hybrid Adams-Moulton Scheme
Our concern primarily is to derive the continuous and discrete form of both one-step and two-step
Adams-Moulton scheme and consequently carried out the error and zero-stable analysis of the discrete
forms. Matrix inversion technique was the tool implored to achieve the derivation of the continuous form.
2.1 Derivation of Multi-Step Collocation Method
In order to derive the continuous and discrete one and two step hybrid Adams-Moulton schemes, we
employed the approach used by Sirisena (1997) where a k-step multi-step collocation method point was
obtained as:
( ) ( ) ( ) ( ) ( ) 1 . 2 ..... .......... .......... .......... .......... .......... ,
1
0
1
0

=
|
|
|
.
|
\
|
|
.
|
\
|
+ =
m
j
j j j n
k
j
j
x y
j
f x h x y x x y x | o
Where ( ) x
j
o and ( ) x
j
| are the continuous coefficients
We defined ( ) x
j
o and ( ) x
j
| respectively as:
Vol.2, No.10, 2012

23

( )
( ) ( )
+
=
+
+
=
+
=
=
1
0
1 ,
1
0
1 ,
2 . 2 ..... .......... .......... .......... .......... .......... .......... .......... .......... ..........
m t
i
i
i j j
m t
i
i
i j j
x h x h
x x
| |
o o

To get ( ) x
j
o and ( ) x
j
|
,
we arrived at matrix equation of the form DC=I (2.3)
where I is the identity matrix of dimension (t + m) (t + m), D and C are defined as

( )
( )
( )
( )
( )
( )
( ) 4 . 2 . .......... .......... .......... ..........
1 2 0 1
1 2 1 0
1
.
1
1
2
1
1
1 1
_
2
0
1
0
1
1 1
2
1 1
1
1 1
2
1 1
1 2
+
+
=
+

+
+ + + +
+
+ + + +
+
m t
m
t
m m
m t t
o
m t
k n
t
k n k n k n
m t
n
t
n n n
m t
n
t
n n n
x x x
x x
m t t
m t t x
x x x x
x x x x
x x x x
D

Thus, matrix (2.4) is the multi-step collocation matrix of dimension (t+m) (t+m) while matrix C of the
same dimension whose columns give the continuous coefficients given as:

( ) 5 . 2 ...... .......... ..........
, 1 0 , 1 1 0
2 , 1 02 2 , 1 12 02
1 , 1 01 1 , 1 11 01
=
+ + + + +

j m m m j m j t m j m j
m t
m t
h h
h h
h h
C
| | o o o
| | o o o
| | o o o

We define t as the number of interpolation points and m is the number of collocation points. From (2.3),
we notice that If we define

This implies that a suitable algorithm for getting the elements of C is the following:
Vol.2, No.10, 2012

24
( )
( )
( )
( ) 9 . 2 ..... .......... .......... .......... .......... .......... .......... .......... .......... .......... .......... ,......... ,... 2 , 1 ;
. ,.. 2 , 1 , , ,
8 . 2 .......... .......... .......... .......... .......... .......... .......... .......... .......... .......... .......... .......... ,..., 2 , 1
,..., 2 , 1 .; ,... 2 , 1 ,
7 . 2 ..... .......... .......... .......... .......... .......... .......... .......... ,... 2 , 1 ., ,... 2 , 1 ,
. ,... 2 , 1 ,
6 . 2 .......... .......... .......... .......... .......... .......... .......... .......... ,......... ,... 2 , 1 ,
1
1
,
1
1
,
1
1
1
,
,
,
, ,
n j l d u
n i j i l u l d u
n i d l
n i n j i j u l d l
n j n i l e l e e
n j
l
e
e
n j i c u e C
ii ij ij
ii
i
k
kj ik ij ij
ij ij
i
k
kj ik ij ij
ij
i
k
kj ik ij ij
j i
j i
j i
j k k i ij ij
= =
= < |
.
|
\
|
=
= =
= = s =
= = |
.
|
\
|
=
= =
= = =
=
Provided

2.2 Derivation of Continuous and Discrete Hybrid Adams-Moulton Scheme
Case K=1
The matrix for this case is given below as

=
+ +
+ + +
1 1
3 2
3 2
3 2 1 0
3 2 1 0
1
1
n n
n n
u n u n u n
n n n
x x
x x
x x x
x x x
D
and its equation (2.1) equivalence is

( ) ( ) ( ) ( ) ( ) } {
1 1 0 0 + +
+ + + =
n n u n u n
f x f x h y x y x x y | | o o

By applying the set of formulae (2.6) - (2.9, we have
0
0
1
1
) 10 . 2 .....( .......... .......... .......... .......... .......... .......... .......... ,......... 4 , 3 , 2 , 1 ,
41 41
31 31
21 21
11 11
1 1
= =
= =
= =
= =
= =
d l
d l
d l
d l
i d l
i i

Now using
Vol.2, No.10, 2012

25

3
11
14
14
2
11
13
13
11
12
12
4
3
2
1 , 4 , 3 , 2 , 1 ,
n
n
n
ij ij ij
x
l
d
u
j
x
l
d
u
j
x
l
d
u
j
i j l d u
= =
=
= =
=
= =
=
= = =

Using
1 , 0 1
2 , 4 , 1 . 0 1
2 , 3
2 , 2
,
12 41 42 42
32
12 31 32 32
22
12 21 22 22
1
2 22 22
1
1
= = =
= = = =
=
= =
= + =
=
=
= =
=
=
n
n
n n
k
k ik
j
k
kj ik ij ij
x u l d l
j i x l
u l d l
j i
uh x uh x l
u l d l
u l d l
j i
ij u l d l

Using
, 2 , 1 , ,
1
1
= s |
.
|
\
|
=

=
i j i l u l d u
ii
i
k
kj ik ij ij

Vol.2, No.10, 2012

26
( )
( )
( )
( ) ( )
2 2 2
3 3
22
14 21 24
24
3 3
1 .
4 , 2
2
1 .
2
22
13 21 23
23
4 , 1
h u uh x x
uh
x uh x
l
u l d
u
j i
uh
n
x
uh
n
x uh
n
x
l
u l d
u
j i
n n
n
+ + =
+
=
=
= =
+ =
|
.
|
\
|
+
=
=
= =

Again using

( )
( )
( )h u
uh x h x
u l u l d l
j i
uh uh x x
u l u l d l
j i
j i u l d l
n n
n n
i
k
kj ik ij ij
=
+ =
+ =
= =
= =
+ =
= =
> =

=
2
2 2 2
3 , 4
2 2
3 , 3
23 32 13 41 43 43
23 32 13 31 33 33
1
1
,

Using

( ) ( )
( )
uh x
uh
h u uh x x x
l
u l u l d
u
j i j i l u l d u
n
n n n
ii
i
k
kj ik ij ij
+ =

=
+
=
= = s |
.
|
\
|
=

=
3
3 3 3
, 4 , 3 , ,
2 2 2 2
33
24 32 14 31 34
34
1
1

Vol.2, No.10, 2012

27

Using

( )
( ) ( )( )
( )
2 2 2
2 2 2 2
34 43 24 42 14 41 44 44
1
1
,
2 3 2 3
3 2 3 3 3
1 , 4 ,
h u uh h
uh x uh h h u uh x x h x
u l u l u l d l
j i i j u l d l
n n n n
i
k
kj ik ij ij
= =
+ + =
+ + =
= = s =

=

Using (2.7) with

0
4
0
3
0
2
1
1
11
14 1
14
11
13 1
13
11
12 1
12
11
11 1
11
1
= =
=
= =
=
= =
=
= = =
= =
l
e
e
j
l
e
e
j
l
e
e
j
l
e
e e
j i
ij

Vol.2, No.10, 2012

28

( )
( )
( )} {
( )} {
44
1
31 43
1
21 42
1
11 41 41 1
41
2 2
33
1
21 32
1
11 31 31 1
31
22
11 21 21 1
21
1
1
1
1 , 4
1 1 1
1 1 0
1 , 2
. 4 , 3 , 2 , 1 ; 4 , 3 , 2 , 1 ,
l
e l e l e l e
e
j i
h u uh uh
l
e l e l e
e
uh uh
l
e l e
e
j i
j i l e l e e
ij
i
k
kj ik ij ij
+ +
=
= =
= |
.
|
\
|
=
+
=
=
= =
= = |
.
|
\
|
=

=

( )
( )
( )
3 2
2
2 2
2 3
2
2 3
1
2
1
h u u
h u
h u
uh h
uh
|
.
|
\
|
+ +
=

i = 2 = j

( )
( )} {
33
1
22 32
1
12 31 32 1
32
22
1
12 21 22 1
22
2 , 3
1
l
e l e l e
e
j i
uh
l
e l e
e
+
=
= =
=
=

Vol.2, No.10, 2012

29
( )} {
( )
( )
( )
( )} {
( )
( )
( )
( )} {
( )} {
( )
( )
( )
( )
4 , 3
2 3
2
2 3
2
3 , 4
1
3
0
0 . 1 0
4 , 2
0
0 . 1 0
3 , 2
2 3
2
2 3
2 1
2 , 4
1 1 1
2
2
33
1
33 43
1
23 42
1
13 41 43 1
43
33
1
23 32
1
13 31 33 1
33
22
1
14 21 24 1
24
22
22
1
13 21 23 1
23
2 2
2
2 2
44
1
32 43
1
22 42
1
12 41 42 1
42
2 2
= =

=
)
`

=
+ +
=
= =
=
+
=
= =
=
=
= =
=
=
= =

=
)
`

=
+ +
=
= =
=
)
`

=
j i
uh u
u
h u
uh
u
l
e l e l e l e
e
j i
uh
l
e l e l e
e
j i
uh
l
e l e
e
j i
l
l
e l e
e
j i
h u u
h u
h u
h u
uh
l
e l e l e l e
e
j i
h u uh uh

Vol.2, No.10, 2012

30
( )} {
( )} {
( )
2
44
1
34 43
1
24 42
1
14 41 44 1
44
33
1
24 32
1
14 31 34 1
34
2 3
1
4
0
0
h u
l
e l e l e l e
e
j i
uh
l
e l e l e
e
=
+ +
=
= =
=
=
+
=

C values are now computed thus;

( )
( )
( )
( )
( )
2
1
44 44
2
1
43 43
2 2
1
42 42
2 2
1
41 41
2 3
1
4
2 3
2
3 , 4
2 3
2
2 , 4
2 3
2
h u
e c
j i
u uh
u
e c
j i
u h u
e c
j i
u h u
e c
= =
= =

= =
= =

= =
= =

= =

Using

( )
( )
( )
( )
( )
42 34
1
32 32
3 2
2 2 2 2
41 34
1
31 31
4
1
2 , 3
2 3
3 6
2 3
2
3
1
1 , 3
c u e c
j i
u h u
h x
u h u
uh x
h u
c u e c
j i
c u e c
n
n
k
kj ik ij ij
=
= =

=
|
|
.
|
\
|
=
=
= =
=

=

Vol.2, No.10, 2012

31

( )
( )
( )
( )
( )
( )
( )
( )
( ) ( ) { }
( )
( )
( )
( )
2
44 34
1
34 34
2
2
2
42 34
1
33 33
3 2
3 2 2 2
2 3
3
4 , 3
2 3
2 3 3
2 3
2
3
1
3
2 3
2 3
2 3
3 2 1
h u
uh x
c u e c
j i
u uh
x u h u
u uh
u
uh x
uh
c u e c
j i
u h u
x h
u h u
uh x
h u
n
n
n
n
n
+
=
=
= =

+
=
)
`
=
=
= =

+
=
+
+ =

Now with

( )
( ) { }
( )
{ }
( )
( )
j i
u h u
x x
u h u
h u uh x x
u h u
h x uh x
uh
c u c u e c
j i
c u e c
n n
n n n n
k
k
kj ik ij ij
= =

=
+ +
+
=
+ =
= =
=
+
+
=
2
2 3
6
2 3
2 3 3
2 3
3 6 2 1
1 , 2
3 2
1
3 2
2 2 2
3 2
41 24 21 23
1
21 21
1
3
1

( )
( ) ( )
( )
24 43 33 23
1
23 23
2 2
1
2 2
3 2 3 2
42 24 32 23
1
21 22
3 , 2
2 3
6
3
2 3
2
2 3
2 3
2
1
u c c u e c
j i
u h u
x x
h u x x
u h u h u x
x h
uh x
uh
c u c u e c
n n
u n n
n
n
n
=
= =

=
+ +
+
)
`
+
=
=
+
+

Vol.2, No.10, 2012

32
( )
( )
( )
( )
( ) ( ) { }
( )
( )
( )
( ) ( )
( )
( ) u h
uh x x
h u
h u uh x
h u
uh x
uh x
c u c u e c
j i
u uh
h x h u h x u x x
u uh
u
h u uh x x
u uh
h x ux h u
uh x
n n
n
n
n
n n n n
n n
n n
n
2 3
2 3
2 3
1
3
2 3
3
2
4 , 2
2 3
2 3 6
2 3
2
3 3
2 3
3 6 3
2
2
2
2 2
2
44 24 34 23
1
24 24
2
2 2 2
1
2
2 2 2
2
2
+
=
|
|
.
|
\
|
+
+ =
=
= =

+
=
)
`

)
`
+
=
+

Now consider
{ }
( )
( )
( ) ( )
{ }
( )
{ }
( ) ( ) ( )
( )
( )
{ }
{ }
( )
{ }
( )
( )
( )
)
`
+ + +
=
+ + =
= =

+
=
)
`
|
|
.
|
\
|
)
`
=
+ + =
= =

=
)
`
)
`
)
`
=
+ + =
= =
=
+
+
+
+
=
u uh
u
x
u uh
h x ux h u x
u uh
uh h u h x u h x ux x
x
c u c u c u e c
j i
u h u
x h x
u h u
x
u h u
x x
u h u
x x
x
c u c u c u e c
j i
u h u
x h x h u h u
u h u
x
u h u
h x
x
u h u
x x
x
c u c u c u e c
j i
c u e C
n
n n n n n n n
n
n n
n
n
n
n n
n
n n
n
n
n
n n
n
k
k
kj ik ij ij
2 3
2
2 3
3 6 3
2 3
3 2 6 3 6
3 , 1
2 3
2 3
2 3
2
2 3
6
2 3
6
2 , 1
2 3
2 3 2 3
2 3
2
2 3
2 3
2 3
6
1
1
2
3
2
2
2
2 2 2 2 2 2
43 14 33 13 23 12
1
13 13
3 2
3 2
3 2
3
3 2
2
1
2
3 2
1
42 14 34 13 22 12
1
12 12
3 2
3 2 3 3 3 2
3 2
3
3 2
2
3 2
1
41 14 31 13 21 12
1
11 11
2
2
1

Vol.2, No.10, 2012

33

{ }
( )
4 , 1
2 3
2 3 2 3
2
3 2 2 2 3 2 2 2
= =

+ + +
=
j i
u uh
x h ux h x u ux h x u h x
n n n n n n

{ }
( ) { }
( )
( )
( ) ( )
( ) u h
x x
u h
x
u h
uh x x
u h
h ux x x
c u c u c u e c
u n n
n n n n n n
2 3
2 3 2 3
3
2 3
2 3
2
2
2
3
2
2
2
2
44 14 34 13 24 12
1
14 14
+
=
+ + =
+

The continuous scheme coefficients column by column for c values are now computed.
Substituting these values into the general form (2.10) yield the desired continuous schemes.

( )
( )
( )
( )
( )
( )
( ) ( )
( ) ( ) ( ) { }
( )
( )
( ) ( )
( )
( )
( ) ( )
( )
( )
( )
( )
{ }
( )
{ }
( )
{ }
( )
( )
( )
( )( ) ( )( ) ( )( ) { }
( ) u uh
h x x u u x x h u h x x u
u uh
x u
u uh
h x ux h u
u uh
x uh h u h x u h x u h x ux x x
u uh
x h ux h x u h x u h x u h x
x c x c x c c x
u h u
x x h
x x
u h u
x
u h u
x h x
u h u
x x h x
h u
x h x
x c x c x c c x
u h u
u h u x x h x x
u h u
x
u h u
x h x
u h u
x h x x
u h u
x h x h u h u
x c x c x c c x
n n n
n n
n n n n n n
n n n n n n
n
n
n n n n n
n n
n n n n n
2 3
3 2 3 2
2 3
2
2 3
3 6 3
2 3
3 2 3 6 3 6
2 3
2 3 2 3 2 3
2 3
3
2
2 3
2
2 3
3 6
2 3
6 6 2 3
2 3
2 3 3 2
2 3
2
2 3
3 6
2 3
6 6
2 3
2 3 2 3
2
2 2 2 3
2
3
2
2 2
2
2 2 2 2 2 2 3
3 2 2 2 2 2 2 2 2
3
34
2
33 23 13 0
3 2
2
3
3 2
2
3 2
2
3 2
2
3 2
3 2
3
24
2
23 22 12 1
3 2
3 2 2 3
3 2
3
3 2
2
3 2
2
3 2
3 2 3 3 2 2
3
41
2
31 21 11 0
+
+
+ + +
+
+ +
=
+ + + =

+ =
+
+
+
=
+ + + =

+
=
+
+

=
+ + + =
|
o
o

Vol.2, No.10, 2012

34

( )
( )
( )
( )
( )
( )
( ) ( )
( )
( )
( ) u h
x x uh
x x
u h
x
u h
x uh x
u h
x h ux x
u h
x h ux
x c x c x c c x
n
n
n n n n n
2 3
2 3 2 3
3
2 3
2 3
2 3
2
2
3
2
3
2
2
2
2
2
3 2
3
44
2
34 24 14 1
+
+
+
+

=
+ + + = |

Hence forth,
( )
( ) ( ) ( )
( )
( ) ( )
( )
( )( ) ( ) ( ) ( ) ( )
( )
( ) ( )
( )
( ) 11 . 2 ....
2 3 2 3
3 2 3 2
2 3
3 2
2 3
2 3 3 2
1
2
2 3
2
2 2 2 2 3
.
3 2
2 3
3 2
3 2 2 3
+

+
+
+
+
+
=
n
n n
n
n n n
n n
n
n n
f
u h
x x uh x x
f
u uh
x x h u u x x h u x x u
u n
u h u
x x h x x
y
u h u
u h u x x h x x
x y
y

Where (2.11) is the continuous form of one step Adams-Moulton scheme for k=1. If
(2.11) is evaluated at
1 + n
x
and a substitution
2
1
= u
is made, the result is
( ) hence f
h
f
h
y y x y
n n n n n , 1 1
4 4
2
2
1
+ + +
+ + =

| | ( ) 12 . 2 .... .......... .......... .......... .......... .......... .......... .......... .......... .......... ..........
4
2
1 1
2
1
n n n n n
f f
h
y y y = +
+ + +

If on the other hand, equation (2.11) is differentiated with respect to x and then evaluated at
2
1
+
=
n
x x
,
the result obtained is

( )
| | ( ) b f f f
h
y y
f f y
h
y
h
x
n n n
n
n
n n n n n
y
12 . 2 ..... .......... .......... .......... .......... .......... .......... .......... 8 5
24
8
1
8
5 3 3
2
1
2
1
2
1
1
2
1
, 1
1
+ +
+
+ + +
=
+ +
=

The schemes (2.12a) and (2.12b) can be referred to as (2.12) and are indeed of interpolation
polynomial of case k =1
We consider another system of matrix of the same case k=1 where the schemes shall be derived
at the interpolation points

Vol.2, No.10, 2012

35

|
|
|
|
|
.
|
\
|
=
+ +
+ +
2
2
1 1
2
3 2
3 2 1 0
3 2 1 0
3 2 1 0
1
u n u n
n n
n n
n n n
x x
x x
x x
x x x
D

The general forms of this system of matrix is given as :
( ) ( ) ( ) ( ) ( ) { } ( ) 13 . 2 .......... .......... .......... .......... .......... ..........
1 1 0 0 u n n n n n
f x f x f x h y x x y
+ +
+ + + = | | | o

As seen in the first case using the same set of formulae (2.6) (2.9), we have the values of c given as
follows:

( )
( ) ( )
( )
( )
( )
( )
( )
( )
{ }
( )
( )
( )
1
1
1
0
1 2
2
1 2
2
2
2
0
1 3
1
1 3
1 3
1
; 0
11
2
1
24
2
2
23
2
2 2
22
21
2
34
2
33
2
32
31
2
44
2
43
2
42
41
2
1
=

=
+
=
+ + +
=
=

+
=
+ +
=
=

=
=
+
+
c
u uh
x x
c
u h
x h ux
c
uh
h x h ux x uh
c
c
u uh
x
c
u h
x uh
c
uh
h uh x
c
c
u uh
c
u uh
u
c
u uh
u
c
c
n n
n n
n n n
n
n
n

Vol.2, No.10, 2012

36

{ }
( )
( ) 1 6
2 3
6
2 3 3 6
2
3 2
13
2
3 2 2 2
12
+
=
+ + +
=
x uh
x h x
c
uh
x h x h ux h ux
c
n n
n n n n

Following the same procedure as in the first case, the coefficients for the continuous schemes,
( ) ( ) x and x
j j
| o

are obtained and by similar substitution into equation (2.13), the desired continuous scheme
is obtained as follows;

( ) | |
( )( ) ( )( ) ( )( )
( )
( ) ( )
( )
( ) ( )
( )
( ) 14 . 2 .......... .......... ..........
1 6
3 2
1 6
3 2
1 6
1 6 1 3 1 2
1
2
2 3
1
2
2 2 3
2
2 2 2 3
u n
n n
n
n n
n
n n n
n
f
u uh
x x h x x
f
u uh
x x h u x x u
f
u uh
x x u uh x x u h x x u
y x y
+ +
+
+
+
+ =

Putting u = and proceeding to get our discrete forms as did earlier by evaluating (2.14) at these two
different points 1 +
=
n
x x
and
1 +
=
n n
x x
, we have:

a. at x = x
n
= x
n+1,
the result is

| | ( ) a f f f
h
y y
hf f
h
f
h
y y
n n n n n
n n n n n
15 . 2 ..... .......... .......... .......... .......... .......... .......... .......... 4
6
6
4
6 6
2
1
2
1
1 1
1 1
+ + +
+ + +
+ + =
+ + + =

b. at x = x + x
n+
, the result is

| | ( ) b f f f
h
y y
n n n n n
15 . 2 .......... .......... .......... .......... .......... .......... .......... 8 5
24
2
1
2
1
1 + + +
+ =

The collocation schemes of D yields just the same equation in (2.15b) . These are the hybrid collocation
schemes of the case k=1
Equation (2.15a) and (2.15b) can be referred to as (2.15)
We also considered two different systems of matrices D
3
and D
4
on the derivation of both hybrid
interpolation and the collocation where k = 2

Vol.2, No.10, 2012

37

=
+ + +
+ + +
+ + +
+ + + +
3 2
3
2
2
2 2
3
1
2
1 1
3 2
4
1
3
1
2
1 1
3
4 3 2 1 0
4 3 2 1 0
4 3 2 1 0
4 3 2 1 0
1
u n u n u n
n n n
n n n
n n n
n n n n
x x x
x x x
x x x
x x x
x x x x
D

The general forms of D
3
is given as
( ) ( ) ( ) ( ) ( ) ( ) | |
u n n n n n n
f x f x f x f x h y x x y
+ + + +
+ + + + = | | | | o
2 2 1 1 0 1 1

Appling the set of formulae (2.6)-(2.9) on this system gives the c-entries as follows

( )( ) { }
{ }
( ) { }
( )
( )
( ) 2 6
3
1 12
2 4 12
24
12 12 4
1 2 4
1
8
1
1 , 0
3
44
3
43
3
42
3
53
3
52
11 31 41 51
+ +
=
+ +
=
+ +
=

=
=
= = = =
u h
h uh x
c
u h
h u x
c
uh
h x uh
c
u u uh
c
uh
c
c c c c
n
n
n

( )( )
{ }
{ }
( )
{ }
( )
( )
( )( )
( )
3
2 2 2 3 3
22
3
2 2
35
3
2 2
34
3
2 2
33
3
2 2 2
32
3
1
45
2
2 3 3 2
1 2 2
2 6 3
2 4
4 3 2 3
1 2
4 3 2 2
4
2 2 6 2 2
1 2
uh
x h ux h ux h x x uh
c
u u uh
h h x x
c
u h
h x x h x x
c
u h
h x x h ux uh
c
uh
h ux h h x uh uh
c
u u uh
x
c
n n n n
n n
n n n n
n n n
n n
n
+ + + + +
=

+ +
=
+ + +
=
+ + +
=
+ + + +
=

=
+

Vol.2, No.10, 2012

38

{ }
( )
( )
( )
{ }
{ }
( )
{ }
( )
{ }
( )( ) 1 2 4
4 4
2 24
2 3 6 4 4
1 12
8 4 12 8 5 3
24
3 10 12 12 3 4 18 24
1
2 3
1
2 2
3
4 4 2 2 3
15
3
4 4 4 2 2 3 3
14
3
3 3 2 2 4 4
13
3
4 4 2 2 2 3 4 3 2 2 3
12
3
3 2 2
25
3
3 2 2
23

+ +
=
+ + + + +
=
+ + + +
=
+ + + + + + +
=
+ +
=
+ + +
=
u u uh
h x h x h x
c
u h
h uh x h ux h ux h x
c
h u
h x h ux h ux uxh h x
c
uh
h uxh h x h x x h ux h ux h ux
c
u uh
x h x h x
c
u h
x h x h ux h ux
c
n n n
n n n n
n n n n
n n n n n n
n n n
n n n n

As in the previous cases, continuous schemes coefficients

( ) s x
i
' o

and the
( ) s x
i
' |

are obtained

and
substituted into the general form (2.16) to obtain the desired continuous schemes as follows;
( ) | |
( ) ( )( ) ( )( ) ( ) ( ) { }
( ) ( ) ( ) ( ) ( ) { }
( )
( ) ( )( ) ( ) ( ) { }
( )
( ) ( ) ( ) { }
( )( )
( ) 17 . 2 ....... .......... .......... .......... .......... .......... .......... ..........
2 1 4
4 4
2 24
1 2 6 1 4 3
1 12
8 5 12 2 4 3
24
10 3 24 12 18 12 4 3
1
3
4 2 2 3 4
3
2
4 2 2 3 4
3
1
4 2 2 3 4
3
4 3 2 2 3 4
1

+
+
+ + +
+
+ +
+
+ + + +
+ =
+
+
+
+
u u uh
f h h x x h x x x x
u h
f h u x x uh x x u h x x
u h
f h u x x uh x x h u x x
uh
f h u x x uh h x x u h x x u x x
y x y
u n n n n
n n n n
n n n n
n n n n n
n
Evaluating (2.17) at

2 +
=
n
x x

2
3
= u
,
the resulting scheme is given as:
{ } ( ) a f f f
h
y y
n n n n n
18 . 2 .......... .......... .......... .......... .......... .......... .......... .......... .......... .......... 4
6
2
3
2 1 1 2 + + + + +
+ + =

If (2.17) is evaluated at points
u n
x x
+
=
and
2
3
= u
,

we have
{ } ( ) b f f f f
h
y y
n n n n n n
18 . 2 ....... .......... .......... .......... .......... .......... .......... .......... 56 5 46
192
2
3
2
3
2 1 1 + + + + +
+ + =

Vol.2, No.10, 2012

39
However, if the point
2
3
= u
is maintained and (2.17) is evaluated at x = x
n
, the result is another discrete
scheme of the form:

{ } ( ) c f f f f
h
y y
n n n n n n
18 . 2 ......... .......... .......... .......... .......... .......... .......... .......... .......... 4 7 2
6
2
3
2 1 1 + + + +
+ + =

Equations (2.18a), (2.18b) and (2.18c) are referred to as (2.18)
Taking on another system of matrix D
4
of an interpolation scheme, where k = 2:

=
+ + +
+ + +
+ + + +
+ + + +
3
2
2
2 2
3
1
2
1 1
3 2
4 3 2
4
1
3
1
2
! 1
4
4 3 2 1 0
4 3 2 1 0
4 3 2 1 0
1
1
n n n
n n n
n n n
u n u n u n u n
n n n n
x x x
x x x
x x x
x x x x
x x x x
D

the general form of the matrix is given as:
( ) ( ) ( ) ( ) ( ) ( ) { } ( ) 19 . 2 ......... .......... .......... ..........
2 2 1 0 1 1 + + + +
+ + + + =
n n n n u n u n
f x f x f x h y x y x x y | | | o o

As in the previous cases, matrix C is determined with the columns simplification yielding the continuous
schemes:
( )
( ) ( ) ( ) ( ) { }
( ) ( )
( ) ( ) { }
( ) ( )
( )( ) ( ) { }
( )( ) ( )( )( ) ( ) { }
( )( )
( )( ) ( )( ) ( )( )( ) { }
( )
( ) 20 . 2 .... ..........
1 2 12
1 3 1 1 2 2 1 2
1 2 1 3
2 2 2 3 1 2 1 2 2
1 2 2 5 2
1 2 1
2
1 2 1
1 2 1 2
3 2
2
2 2
1
3
1
2 4
1
3 2
1
3 2
1
2 4
1
2
3 2 4
1
4 2 2
1
2 2
1
4
1
4 2 2
4 2 2 2 2
1
4
1
h u u
f h x x u u h x x u u x x u
h u u u
f h u u h x x u u u x x u u
f h u u x x u
h u u u
y h x x x x
h u u u
y h u u u h x x x x
x y
n n n n
n n n
n n
n n n
u n n n

+ + + +
+

+
+ +

+

+ +
=
+ + + +
+ + +
+
+ + +
+ + +

Vol.2, No.10, 2012

40
Desired hybrid point of elevation remains

2
3
= U

and so (2.20) is evaluated to yield

| | ( ) a f f f
h
y y y
n n n n n n
21 . 2 .... .......... .......... .......... .......... .......... .......... 19 32
12
16 9 7
2 1 1 2
2
3
+ + + + +
+ = +

at the point

2 +
=
n
x x

If consideration at the point

n
x x =

is made, we have:

| | ( ) b f f f
h
y y y
n n n n n n
21 . 2 .. .......... .......... .......... .......... .......... .......... .......... 3 48 9
4
16 7 9
3 1 1
2
3
+ + + +
= +

Finding the differential expression with respect to x for (2.20) and evaluating the differential
coefficient at

1 +
=
n
x x
,
the result becomes:

| | ( ) c f f f f
h
y y
n n n n n n
21 . 2 .... .......... .......... .......... .......... .......... .......... .......... 56 5 46
192
2
3
2
3
2 1 1 + + + + +
+ = +

As usual, equation (2.21a),(2.21b) and (2.21c) are referred to as (2.21)

3.0 Convergence Analysis
This section shows the validity and consistency of the derived scheme in section two . The tools for the
assignment would be the familiar investigation of the zero stability by finding the order and error constant
of the each of the schemes.
3.1 Definitions
( a) The scheme (1.1) is said to be zero stable if no root of the polynomial
( )

=
=
k
i
i
i
d p
0
c c
has modulo
greater than one and every root with modulo one must be distinct or simple.
( b) The order p and error constant
1 + p
c
for (1.1) could be defined thus:
If
0 , 0 ...
1 1 0
= = = =
+ p p
c c c c
,
then the principal local term error at
k n
x
+
is
( ).
1 1
1 n
p p
p
x y h c
+ +
+

Vol.2, No.10, 2012

41
( ) ( ) ( ) ( ) | |
( )
( ) ( ) ( ) ( ) ( ) | | ( ) 1 . 3 .. .......... .......... ... 2 1
! 1
1
... 2 1
!
1
1 1
2
1
1
1
0
1
2 1 0
v
q
k
q q q q
q q q q
q
t v t k t t t
q
t k t t t
q
c
| | | | |
o o o

+ + + + +
+ + + + =

(c) A numerical method (1.1) is said to be consistent if , 1 > p where p is the order of the method.
3.1 Example
We take on the derived schemes in section 2 above, showing that each of the schemes is in conformity to
the definition above or otherwise.
Example 3.1.1
One of the derived schemes for step number k=1 is given as:
| | ( ) a f f
h
y y y
n n n n n
12 . 2 ......... .......... .......... .......... .......... .......... .......... .......... ..........
4
2
1 1
2
1
= +
+ + +

From equation (2.12a)
4
1
,
4
1
, 2 , 1 , 1
1 0 1 0
2
1
=
= = = = | | o o o

Vol.2, No.10, 2012

42

( )
( )
( )
( )
( )
192
1
4
1
.
6
1
2
6
1
1
24
1
! 3
1
2
1
1
! 4
1
0
8
1
2
8
1
1
6
1
! 2
1
2
1
! 3
1
0
4
1
2
2
1
1
2
1
2
1
! 2
1
0 1 1
4
1
2
1
2 1
2
1
0 2 1 1
1
4
4
1
3
1 3
1
2
1 2
1 0 1 1
1 0 0
2
1
2
1
2
1
2
1
2
1
=
|
.
|
\
|
+ =
|
|
.
|
\
|
|
.
|
\
|
+ =
= |
.
|
\
|
+ =
|
|
.
|
\
|
|
.
|
\
|
+ =
= |
.
|
\
|
+ =
|
|
.
|
\
|
|
.
|
\
|
+ =
=
|
|
.
|
\
|
|
.
|
\
|
=
+
|
.
|
\
|
+ =
= + = + + =
| o
| o o
| o o
| | o o
o o o
c
c
c
c
c

Therefore the order p = 3 and

( ) { }
{ }
( )
1 .
0 1
0 2 1
2
1
2
1
2
1
2
1
0 1
=
=
= + =
+ =
c
c
o o o c
e i
p

Hence, the schemes is zero stable.
Example 3.1.2
Another scheme of k = 1 was given as:
| |
2
1
2
1
8 5
24
1 + + +
=
n n n n n
f f f
h
y y
Here,
3
1
24
1
1 24
5
0 0
2
1
2
1
, , , , 1 , 1

= = = = = | | | o o and and so
Vol.2, No.10, 2012

43
( )
384
1
144
1
144
1
384
1
2
1
! 3
1
2
1
!
4
1
0
48
1
48
1
24
1
2
1
48
1
12
1
24
1
2
1
48
1
)
2
1
(
2
1
2
1
!
3
1
0 )
2
1
(
3
1
24
1
8
1
2
1
2
1
!
2
1
; 0
24
12
2
1
2
1
; 0 1 1
2
1
3
1
2
1
4
4
2
1
2
1
2
1
3
3
2
1 1
2
2
1 0 1
0
2
1
2
1
2
1
= + =
|
|
.
|
\
|
|
.
|
\
|
+
|
.
|
\
|
=
= + =
|
.
|
\
|
=
|
.
|
\
|
=
|
|
.
|
\
|
+
|
.
|
\
|
=
=
|
.
|
\
|
=
|
|
.
|
\
|
+
|
.
|
\
|
=
= + = + + =
= = + =
| | o
| | o
| |
| | | o
o o
c
c
c
c
c

So that the order p = 3 and ;
384
1
1
=
+ p
c we seek the root of the characteristics polynomial as follows:

( )
1
0 1
2
1
2
1
0
=
= = =
c
c c o o c p

Hence, by definitions 3.1, we concluded that the method is zero stable.
We consider the scheme | |
2
3
2
3
56 5 46
192
2 1 1 + + + + +
+ + =
n n n n n n
f f f f
h
y y
Here,
24
7
, ,
96
23
,
192
5
,
192
1
, 1 , 1
2
3
2
3
1 2 0 1
= = = = = = | | | | o o and
Then observe that 0 .. .......... .......... .......... .......... .......... .......... .......... ..........
4 1 0
= = = c c c
However,

( ) ( ) ( ) ( )
( )
3
4
2
3
2
4
1
5
2
3
1 5
10 87 . 4
3072
24
3692
32
211
120
1
3072
4236
192
80
192
46
24
1
32
243
1
120
1
2
! 4
1
! 5
1
2
3
2
3
=
|
.
|
\
|
=
|
.
|
\
|
|
.
|
\
|
+ =
+ + = | | | o o c

The order p=4 and . 10 87 . 4
3
1
+
=
p
c the absolute root for the polynomial is thus computed;
Vol.2, No.10, 2012

44

( )
( )
1 , , , 1 , , 0
0 1 .
0
2
1
2
3
2
3
2
3
1
= = =
=
= = =
c c c
c c
c c c o c o c
so and or
e i
p

Hence, the method is zero stable.
4.0 Conclusion
There is no doubt that the schemes are consistent and zero stable and could also be used by Numerical
Analysts to solve differential equations experimentally. The obtained result in comparism with the
theoretical result would also be of great importance in future research work.
References
Alagbe, S.A. (1999), Derivation of a Class Multiplier Step Methods, B.Sc. Project , Department of
Mathematics, University of Jos,
Awe, K.D. (1997), Application of Adams Moulton Methods and its application in Block Forms,
B.Sc Project, Department of Mathematics, University of Jos
Ciarlet, P.G. & Lions, J.L (1989). Finite Element Method` Handbook of Numerical Analysis. Vol.11
Fatunla S. O. (1988), Computer Science and Scientific Computational Method for IVP in ODE.
Academic Press Inc.
Gragg,W.B & Stetter H.J (1964), Generalized Multistep Predictor-Corrector Methods.
J-Assoc.Comp.Vol11, pp188-200,MR 28 Comp 4680
James, R. e tal (1995), The Mathematics of Numerical Analysis. Lecture in
Applied Mathematics.Vol XXXII.
Kopal, Z.(1956), Numerial Analysis. Chapman and Hall, London.
Lapidus L.B & Schiesser W.E. (1976), Numerical Methods for Differential System.
Academic Press Inc.
Onumanyi, P. et al (1994), New Linear Multistep Methods for First Order Ordinary Initial Value
Problems. Jour. Nig. Maths Society, 13 pp37 52
Sirisena, U.W. (1997), A Reformation of the Continous General Linear Multistep Method by Matrix
Inversion for First Order Initial Value Problems. Ph.D Thesis, Department of Mathematics, University of
Ilorin, Ilorin (Unpublished)
This academic article was published by The International Institute for Science,
Technology and Education (IISTE). The IISTE is a pioneer in the Open Access
Publishing service based in the U.S. and Europe. The aim of the institute is
Accelerating Global Knowledge Sharing.

More information about the publisher can be found in the IISTEs homepage:
http://www.iiste.org

CALL FOR PAPERS
The IISTE is currently hosting more than 30 peer-reviewed academic journals and
collaborating with academic institutions around the world. Theres no deadline for
submission. Prospective authors of IISTE journals can find the submission
instruction on the following page: http://www.iiste.org/Journals/
The IISTE editorial team promises to the review and publish all the qualified
submissions in a fast manner. All the journals articles are available online to the
readers all over the world without financial, legal, or technical barriers other than
those inseparable from gaining access to the internet itself. Printed version of the
journals is also available upon request of readers and authors.
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische
Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial
Library , NewJour, Google Scholar

International Journals Call For Paper HTTP://WWW - Iiste.org/journals

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

International Journals Call For Paper HTTP://WWW - Iiste.org/journals

Uploaded by

Copyright:

Available Formats

Mathematical Theory and Modeling www.iiste.

You might also like