org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
121
A Class of Three Stage Implicit Rational RungeKutta Schemes
for Approximation of Second Order Ordinary Differential
Equations
Usman Abdullahi S.
1*
, Odekunle M. R.
2
and Ahmad Murtala M.
3
1. Department of Statistics, Federal Polytechnic Bali, Taraba State – Nigeria
2.Department of Mathematics, Modibbo Adama University of Technology, Yola – Nigeria
3.Department of Mathematical Sciences, Taraba State University of Technology, Jalingo – Nigeria
*EMail of corresponding author: usasmut@gmail.com
Abstract
In this paper, 3 – stage Implicit Rational Runge – Kutta methods are derived using Taylor and Binomial series
expansion for the direct solution of general second order initial value problems of ordinary differential equations
with constant step length. The basic properties of the developed method were investigated and found to be
consistent and convergent. The efficiency of the method were tested on some numerical examples and found to
give better approximations than the existing methods.
Keywords: Java Programming Language, Implicit Rational Runge Kutta scheme, Second order equations.
1. Introduction
RungeKutta schemes are important family of implicit and explicit iterative methods for approximation of
solution of ordinary differential equations. Consider the numerical approximation of second order initial value
problems of the form:
( ) ( ) ( )
0 0 0 0
, , , , y x y y x y y y x f y = ′ = ′ = ′ ′
,
b x a ≤ ≤
(1)
The general s −stage RungeKutta scheme for general second order initial value problems of ordinary
differential equations of the form (1) as defined by Jain (1984) is
∑
=
+
+ ′ + =
s
r
r r n n n
k c y h y y
1
1
(2)
and
r
s
r
r n n
k c
h
y y
∑
=
+
′ + ′ = ′
1
1
1
(3)
where
( )s i k b
h
y k a y hc y h c x f
h
K
r
j
r
j
j ij n j ij n i n i n r
1 1 ,
1
, ,
2
1 1
2
=


¹

\

+ ′ + ′ + + =
∑ ∑
= =
(4)
with
( )r i b a c
i
j
ij
i
j
ij i
1 ,
2
1
1 1
∑ ∑
= =
= =
(5)
where c
ì
, o
ì]
, b
ì]
, c
¡
, c
¡
i
are constants to be determined. The derivative of suitable parameters requires extremely
lengthy algebraic manipulations, except for small values of s (Sharp and Fine (1992) and Dormand et al (1987)).
The fourth order RungeKutta method for the solution of (1) is given in Jain (1984).
It should be noted that the methods considered above were RungeKutta method of second order
ordinary differential equations but Much attention have not been given to Runge – Kutta method for the solution
of general second order ODEs of the form (1), Lambert (1973). Much work was done in RungeKuttaNystrom
method of Special Second Order ODE of the form
( ) ( ) ( )
0 0 0 0
, , , y x y y x y y x f y = ′ = = ′ ′
(6)
with numerical solution
∑
=
+
+ ′ + =
s
i
i i n n n
k b h y h y y
1
2
1
(7)
and
i
s
i
i n n
k b h y y
∑
=
+
′ + ′ = ′
1
1
(8)
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
122
where
s i k a h y h c y h c x f k
i
j
j ij n i n i n i
,..., 2 , 1 , ,
1
2
=


¹

\

+ ′ + + =
∑
=
(9)
RungeKuttaNystrom methods are direct extension of RungeKutta method to second order
differential equations in (6). Work such as Sharp and Fine (1992), Dormand et al. (1987), Fudziah (2003),
Fudziah (2009), Senu et al. (2011), more recently Okunuga et al. (2012) discussed the general techniques for
solving equation of the form (6) directly without first reducing it to systems of first order ODEs. The above
authors observed that the direct solution of second order equations is of greater advantage over reduction to
systems of first order equations to increase efficiency and reduced storage requirement.
Hong (1982) proposed the use of rational function of Runge – Kutta method and adapted by Okunbor
(1987) which investigated the use of the rational function of the RungeKutta scheme of first order initial value
problems
∑
∑
=
=
+
+
+
=
r
i
i i n
r
i
i i n
n
H v hy
K w h y
y
1
1
1
1
(10)
where
k
ì
= ¡(x
n
+c
ì
ℎ, y
n
+ ℎ ∑ o
ì1]
¡
ì=1
k
]
), i = 1(1)r (11)
and
E
ì
= g(x
n
+ J
ì
ℎ, z
n
+ ℎ ∑ b
ì1]
E
]
¡
ì=1
), i = 1(1)r (12)
in which
g(x
n
, z
n
) = −z
n
2
¡(x
n
, y
n
) and z
n
=
1
¡
n
where c
ì ,
o
ì]
, b
ì]
, J
ì
are arbitrary constants to be determined. Since then many new rational Runge – Kutta
schemes have been developed for the solution of first order initial value problems and found out to give better
estimates. Among these authors are: Ademuluyi and Babatola (2000), Odekunle (2001), Odekunle et al. (2004),
Bolarinwa (2005), Babatola et al. (2007), Bolarinwa et al. (2012) and Abhulimen and Uluko (2012) The
schemes are absolutely stable, consistent and convergent and was used to approximate a variety of first order
differential equations. However, the methods are presently receiving more attention as efficient schemes for the
solutions of various types of first order initial value problems are considered.
2. Derivation of the Scheme
The rational form of (2) and (3) can be defined as
∑
∑
=
=
+
′ +
+ ′ +
=
s
r
r r n
s
r
r r n n
n
H v y
K w y h y
y
1
1
1
1
(2.1)
∑
∑
=
=
+
′ +
′ +
= ′
s
r
r r n
s
r
r r n
n
H v y
h
K w
h
y
y
1
'
1
1
1
1
1
(2.2)
where
s i K b
h
y K a y hc y h c x f
h
K
s
j
s
j
j ij n j ij n i n i n r
) 1 ( 1 ,
1
, ,
2
1 1
2
=


¹

\

+ ′ + ′ + + =
∑ ∑
= =
(2.3)
s i H
h
z H z hd z h d x g
h
H
s
j
s
j
j ij n j ij n i n i n r
) 1 ( 1 ,
1
, ,
2
1 1
2
=


¹

\

+ ′ + ′ + + =
∑ ∑
= =
β α
(2.4)
with constraints
( )r i b a c
i
j
ij
i
j
ij i
1 1 ,
2
1
1
= = =
∑ ∑
=
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
123
( )r i d
i
j
ij
i
j
ij i
1 1 ,
2
1
1
= = =
∑ ∑
=
β α
in which
g(x
n
, z
n
, z′
n
) = −z
n
2
¡(x
n
, y
n
, y′
n
) onJ z
n
=
1
y
n
The constraint equations are to ensure consistency of the method, ℎ is the step size and the parameters
o
ì]
, b
ì]
, c
ì
, J
ì,
o
ì]
, [
ì]
are constants called the parameters of the method.
Following Abhulimen and Uloku (2012) and Bolarinwa etal (2012), the following procedures are adapted.
i. Obtain the Taylor series expansion of
r
K
and
r
H
about the point
( )
n n n
y y x ′ , ,
and binomial series
expansion of right side of (2.1) and (2.2).
ii. Insert the Taylor series expansion into (2.1) and (2.2) respectively.
iii. Compare the final expansion of
r
K
and
r
H
about the point
( )
n n n
y y x ′ , ,
to the Taylor series expansion of
1 + n
y
and
1 +
′
n
y
about
( )
n n n
y y x ′ , ,
in the powers of
h
.
Normally the numbers of parameters exceed the number of equations, these parameters are chosen to ensure
that (one or more of the following conditions are satisfied.
i. Minimum bound of local truncation error exists.
ii. The method has maximized interval of absolute stability.
iii. Minimized computer storage facilities are utilized.
In this paper, we shall consider the implicit scheme where all the o
ì]
and b
ì]
≠ u for at least one ] > i. In
equations (2.1), (2.2), (2.3) and (2.4) setting
3 = s
we have
∑
∑
=
=
+
′ +
+ ′ +
=
3
1
3
1
1
1
r
r r n
r
r r n n
n
H v y
K w y h y
y
(2.5)
∑
∑
=
=
+
′ +
′ +
= ′
3
1
'
3
1
1
1
1
1
r
r r n
r
r r n
n
H v y
h
K w
h
y
y
(2.6)
where
3 ) 1 ( 1 ,
1
, ,
2
3
1
3
1
2
=


¹

\

+ ′ + ′ + + =
∑ ∑
= =
i K b
h
y K a y hc y h c x f
h
K
j j
j ij n j ij n i n i n r
(2.7)
3 ) 1 ( 1 ,
1
, ,
2
3
1
3
1
2
=


¹

\

+ ′ + ′ + + =
∑ ∑
= =
i H
h
z H z hd z h d x g
h
H
j j
j ij n j ij n i n i n r
β α
(2.8)
with constraints
c
1
= o
11
+ o
12
+ o
13
=
1
2
(b
11
+ b
12
+ b
13
)
c
2
= o
21
+ o
22
+o
23
=
1
2
(b
21
+ b
22
+ b
23
)
c
3
= o
31
+ o
32
+o
33
=
1
2
(b
31
+ b
32
+ b
33
)
J
1
= o
11
+ o
12
+ o
13
=
1
2
([
11
+[
12
+ [
13
)
J
2
= o
21
+o
22
+ o
23
=
1
2
([
21
+ [
22
+ [
23
)
J
3
= o
31
+o
32
+ o
33
=
1
2
([
31
+ [
32
+ [
33
)
Now by adopting a binomial expansion on equations (2.5) gives
y
n+1
= y
n
+ ℎy′
n
+ w
1
K
1
+ w
2
K
2
+ w
3
K
3
− y
n
2
(:
1
E
1
+ :
2
E
2
+ :
3
E
3
) −ℎy
n
y
n
i
(:
1
E
1
+ :
2
E
2
+ :
3
E
3
) −
y
n
(w
1
K
1
+ w
2
K
2
+ w
3
K
3
)(:
1
E
1
+ :
2
E
2
+ :
3
E
3
)] (2.9)
Similarly the binomial expansion of (2.6) gives
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
124
y′
n+1
= y′
n
−
1
ℎ
y′
n
2
(:′
1
E
1
+ :′
2
E
2
+ :
3
i
K
3
) +
1
ℎ
(w′
1
K
1
+ w′
2
K
2
+w
3
i
K
3
)
−
1
ℎ
2
y
n
i
(w
1
i
K
1
+w
2
i
K
2
+w
3
i
K
3
)(:
1
i
E
1
+ :
2
i
E
2
+ :
3
i
K
3
) (2.1u)
Now, expanding (2.7) using Taylor series of function of three variables gives
K
ì
=
ℎ
2
2
¡
n
+ (o
ì1
K
1
+ o
ì2
K
2
+ o
ì3
K
3
)¡
¡
+ 2c
ì
(b
ì1
K
1
+ b
ì2
K
2
+ b
ì3
K
3
)¡
x¡i
+ (o
ì1
K
1
+ o
ì2
K
2
+ o
ì3
K
3
)
2
¡
¡¡
+ 2c
ì
y
n
i
(b
ì1
K
1
+ b
ì2
K
2
+ b
ì3
K
3
)¡
¡¡i
]
+
ℎ
3
2
c
ì
¡
x
+ c
ì
y
n
i
¡
¡
+c
ì
(o
ì1
K
1
+o
ì2
K
2
+o
ì3
K
3
)¡
x¡
+ c
ì
y
n
i
(o
ì1
K
1
+ o
ì2
K
2
+ o
ì3
K
3
)¡
¡¡
]
+
ℎ
4
4
c
ì
2
¡
xx
+2c
ì
y
n
i
¡
x¡
+ c
ì
2
y
n
i2
¡
¡¡
] + ℎ(o
ì1
K
1
+ o
ì2
K
2
+ o
ì3
K
3
)(b
ì1
K
1
+ b
ì2
K
2
+ b
ì3
K
3
)¡
¡¡i
+
ℎ
2
(b
ì1
K
1
+ b
ì2
K
2
+ b
ì3
K
3
)¡
¡i
+
1
2
(b
ì1
K
1
+ b
ì2
K
2
+ b
ì3
K
3
)
2
¡
¡i¡i
+ u(ℎ
5
) (2.11)
Equation (2.11) is implicit, which cannot be proceed by successive substitutions. We assume a solution for K
ì
which may be expressed as
K
ì
= ℎ
2
B
ì
+ ℎ
3
C
ì
+ ℎ
4
Ð
ì
+ u(ℎ
5
) (2.12)
Substituting the values of K
ì
of (2.12) into equation (2.11) expand and re – arranging in powers of ℎ gives
K
ì
=
ℎ
2
2
¡
n
+
ℎ
3
2
_c
ì
¡
x
+ c
ì
y
n
i
¡
¡
+
1
2
(b
ì1
B
1
+ b
ì2
B
2
+ b
ì3
B
3
)¡
¡i
_
+
ℎ
4
4
c
ì
2
¡
xx
+2c
ì
y
n
i
¡
x¡i
+ c
ì
2
y
n
i2
¡
¡¡
+ 2(b
ì1
B
1
+ b
ì2
B
2
+ b
ì3
B
3
)
2
¡
¡¡i
+ 2c
ì
(b
ì1
B
1
+ b
ì2
B
2
+ b
ì3
B
3
)¡
x¡i
+ c
ì
y
n
i
(b
ì1
B
1
+ b
ì2
B
2
+b
ì3
B
3
)¡
¡¡i
+ 2(b
ì1
B
1
+ b
ì2
B
2
+b
ì3
B
3
)¡
¡
+ 2(b
ì1
C
1
+ b
ì2
C
2
+ b
ì3
C
3
)¡
¡i
]
+ u(ℎ
5
) (2.1S)
On equating powers of ℎ from equation (2.12) and (2.13), gives
B
ì
=
1
2
¡
n
C
ì
=
1
2
(c
ì
¡
x
+ c
ì
y
n
i
¡
¡
+(b
ì1
B
1
+ b
ì2
B
2
+ b
ì3
B
3
)¡
¡i
) =
1
2
c
ì
∆¡
n
(2.14)
Ð
ì
=
1
4
(c
ì
2
∆
2
¡
n
+ (b
ì1
C
1
+ b
ì2
C
2
+b
ì3
C
3
)∆¡
n
¡
¡i
+c
ì
¡
n
¡
¡
)
then
K
ì
=
ℎ
2
2
¡
n
+
ℎ
3
2
c
ì
∆¡
n
+
ℎ
4
4
(c
ì
2
∆
2
¡
n
+ (b
ì1
C
1
+ b
ì2
C
2
+ b
ì3
C
3
)∆¡
n
¡
¡i
+ c
ì
¡
n
¡
¡
)
+ u(ℎ
5
) (2.1S)
In a similar manner
E
ì
= ℎ
2
H
ì
+ ℎ
3
N
ì
+ ℎ
4
R
ì
+u(ℎ
5
) (2.16)
Where
H
ì
=
1
2
g
n
N
ì
=
1
2
J
ì
∆g¡
n
(2.17)
R
ì
=
1
4
(J
ì
2
∆
2
g
n
+ ([
ì1
J
1
+ [
ì2
J
2
+ [
ì3
J
3
)∆g
n
g
zi
+ J
ì
g
n
g
z
)
And also,
E
ì
=
ℎ
2
2
g
n
+
ℎ
3
2
J
ì
∆g¡
n
+
ℎ
4
4
(J
ì
2
∆
2
g
n
+ ([
ì1
J
1
+ [
ì2
J
2
+ [
ì3
J
3
)∆g
n
g
zi
+ J
ì
g
n
g
z
)
+ u(ℎ
5
) (2.18)
Substituting equations (2.12) and (2.16) into equations (2.9) and (2.10) re – arranging and compare the resulting
equation with the Taylor’s series expansion of
1 + n
y
about
n
x
y
n+1
= y
n
+ ℎy′
n
+
ℎ
2
y
n
′′
2!
+
ℎ
3
y
n
′′′
S!
+
ℎ
4
y
n
ì¡
4!
+ … (2.19)
and
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
125
y′
n+1
= y′
n
+ ℎy′′
n
+
ℎ
2
y
n
′′′
2!
+
ℎ
3
y
n
ì¡
S!
+ … (2.2u)
where
y
n
ii
= ¡(x
n
, y
n
, y
n
′) = ¡
n
y
n
iii
= ¡
x
+y′¡
¡
+ ¡
n
¡
¡i
= ∆¡
n
y
n
i¡
= ¡
xx
+ y′
n
2
¡
¡¡
+ ¡
2
¡
¡i¡i
+ 2y
i
¡
n
¡
¡¡
 + 2¡
n
¡
x¡i
+ ¡
¡i
∆¡
n
(2.21)
y
n
i¡
= ∆
2
¡
n
+ ¡
¡i
∆¡
n
+ ¡
n
¡
¡
Since ∆=
ð
ðx
+y′
ð
ð¡
+ ¡
n
ð
ð¡i
gives the following
w
1
B
1
+ w
2
B
2
+w
3
B
3
− y
n
2
(:
1
H
1
+ :
2
H
2
+ :
3
H
3
) =
1
2
¡
n
w
1
C
1
+ w
2
C
2
+ w
3
B
3
− y
n
2
(:
1
N
1
+ :
2
N
2
+ :
3
N
3
) =
1
6
∆¡
n
w
1
Ð
1
+ w
2
Ð
2
+ w
3
Ð
3
−y
n
2
(:
1
R
1
+ :
2
R
2
+ :
3
R
3
) =
1
24
(∆
2
¡
n
+∆¡
n
¡
¡i
+ ¡
n
¡
¡
)
w
1
i
B
1
+ w
2
i
B
2
+w
3
i
B
3
− y
n
2
(:
1
i
H
1
+ :
2
i
H
2
+ :
3
i
H
3
) = ¡
n
w
1
i
C
1
+ w
2
i
C
2
+ w
3
i
C
3
−y
n
i2
(:
1
i
N
1
+:
2
i
N
2
+ :
3
i
N
3
) =
1
2
∆¡
n
w
1
i
Ð
1
+ w
2
i
Ð
2
+ w
3
i
Ð
3
−y
n
i2
(:
1
i
R
1
+ :
2
i
R
2
+ :
3
i
R
3
) =
1
6
(∆
2
¡
n
+ ∆¡
n
¡
¡i
+ ¡
n
¡
¡
)
Substituting the values of B
1
, B
2
, B
3
, C
1
, C
2
, C
3
, H
1
, H
2
, H
3
, N
1
, N
2
, N
3
, R
1
, R
2
, and R
3
in the above equation
and rearranging, we have the following sets of non – liner differential equations
w
1
+w
2
+ w
3
+ :
1
+ :
2
+ :
3
= 1
w
1
c
1
+ w
2
c
2
+ w
3
c
3
+ :
1
J
1
+ :
2
J
2
+ :
3
J
3
=
1
3
w
1
c
1
2
+ w
2
c
2
2
+ w
3
c
3
2
+ :
1
J
1
2
+ :
2
J
2
2
+:
3
J
3
2
=
1
6
w
1
(c
1
b
11
+ c
2
b
12
+ c
3
b
13
) + w
2
(c
1
b
21
+ c
2
b
22
+ c
3
b
23
) +w
3
(c
1
b
31
+ c
2
b
32
+c
3
b
33
) + :
1
([
11
J
1
+ [
12
J
2
+
[1SJS+:2[21J1+[22J2+[2SJS+:S[S1J1+[S2J2+[SSJS=16
w
1
i
+w
2
i
+ w
3
i
+ :
1
i
+ :
2
i
+ :
3
i
= 2
w
1
i
c
1
+ w
2
i
c
2
+ w
3
i
c
3
+ :
1
i
J
1
+ :
2
i
J
2
+ :
3
i
J
3
= 1
w
1
i
c
1
2
+ w
2
i
c
2
2
+ w
3
i
c
3
2
+ :
1
i
J
1
2
+ :
2
i
J
2
2
+:
3
i
J
3
2
=
2
3
w
1
i
(c
1
b
11
+ c
2
b
12
+ c
3
b
13
) + w
2
i
(c
1
b
21
+ c
2
b
22
+ c
3
b
23
) +w
3
i
(c
1
b
31
+ c
2
b
32
+c
3
b
33
) + :
1
i
([
11
J
1
+ [
12
J
2
+
[1SJS+:2′[21J1+[22J2+[2SJS+:S′[S1J1+[S2J2+[SSJS=2S
with constraints
c
1
= o
11
+ o
12
+ o
13
=
1
2
(b
11
+ b
12
+ b
13
)
c
2
= o
21
+ o
22
+o
23
=
1
2
(b
21
+ b
22
+ b
23
)
c
3
= o
31
+ o
32
+o
33
=
1
2
(b
31
+ b
32
+ b
33
)
J
1
= o
11
+ o
12
+ o
13
=
1
2
([
11
+[
12
+ [
13
)
J
2
= o
21
+o
22
+ o
23
=
1
2
([
21
+ [
22
+ [
23
)
J
3
= o
31
+o
32
+ o
33
=
1
2
([
31
+ [
32
+ [
33
)
This is fourteen (14) equations with fiftyfour (54) unknowns. That means the expected scheme it not unique; we
can have a family of 3 – stage schemes.
Choosing the Parameters
w
1
= w
2
= w
3
= u, :
1
= :
2
= :
3
=
1
3
, c
1
= J
1
= o
11
= b
11
= o
11
= [
11
= u
w
1
i
= w
2
i
=
1
2
, w
3
i
= 1, :
1
i
= :
2
i
= :
3
i
= u, c
2
= c
3
= b
21
= b
31
=
2
3
J
2
= J
3
= o
12
= b
12
= [
12
= [
21
= [
31
=
1
2
, o
22
= o
23
= o
32
= o
33
=
1
6
,
o
21
= o
31
= b
22
= b
23
= b
32
= b
33
=
1
3
, o
12
= o
21
= o
31
= [
22
= [
23
= [
32
= [
33
=
1
4
, o
13
=
b
13
= [
13
= −
1
2
, o
13
= −
1
4
, o
22
= o
23
= o
32
= o
33
=
1
8
then equations (2.5) and (2.6) becomes
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
126
( )
2 1
1
2
3
1
1 H H y
y h y
y
n
n n
n
+ +
′ +
=
+
(2.22)
and
( )
2 1 1
3
2
1
K K
h
y y
n n
+ + ′ = ′
+
(2.23)
where
K
1
=
h
2
2
¡(x
n
, y
n
, y
n
i
) =
h
2
2
¡
n
K
2
=
h
2
2
¡ _x
n
+
2
3
ℎ, y
n
+
2
3
ℎy
n
i
+
1
3
(K
1
+K
2
), y
n
i
+
2
3h
(K
1
+ K
2
)]
and
E
1
=
h
2
2
g(x
n
, z
n
, z
n
i
) =
h
2
2
g
n
E
2
=
h
2
2
g _x
n
+
1
2
ℎ, z
n
+
1
2
ℎz
n
i
+
1
4
(E
1
+ E
2
), z
n
i
+
1
2h
(E
1
+ E
2
)]
3. CONVERGENCE
A numerical method is said to be convergent if the numerical solution approaches the exact solution as
the step size tends to zero.
Convergent = lim
h→0
y(x
n+1
) − y
n+1

In other words, if the discretiation error at x
n+1
tends to zero as ℎ → ∞, i.e if
c
n+1
= y(x
n+1
) − y
n+1
 → u as n → ∞ (3.1)
From equation (14),
∑
∑
=
=
+
′ +
′ +
= ′
s
r
r r n
s
r
r r n
n
H v y
h
K w
h
y
y
1
'
1
1
1
1
1
(3.2)
while the exact solution y
i
(x
n+1
) seems to satisfy the equation of the form
( )
( )
( )
1
1
1
1
1
1
1
+
=
=
+
+
′ ′ +
′ +
= ′
∑
∑
n s
r
r r n
s
r
r r n
n
T
H v x y
h
K w
h
x y
x y
(3.3)
Where I
n+1
is a local truncation error.
Subtracting equation (3.3) from (3.2) gives
( )
( )
( )
1
1
1
1
'
1
1 1
1
1
1
1
1
1
+
=
=
=
=
+ +
+
′ ′ +
′ +
−
′ +
′ +
= ′ − ′
∑
∑
∑
∑
n s
r
r r n
s
r
r r n
s
r
r r n
s
r
r r n
n n
T
H v x y
h
K w
h
x y
H v y
h
K w
h
y
x y y
(3.4)
Adopting equation (3.4) gives
( ) ( )
( )
1
1 1
'
1 1
'
1 1
1
1
1
1
1
1 1
1
1 1
1
+
= =
= = = =
+
+

¹

\

′ ′ + 
¹

\

′ +

¹

\

′ + 
¹

\

′ + − 
¹

\

′ + 
¹

\

′ ′ +
=
∑ ∑
∑ ∑ ∑ ∑
n
s
r
r r n
s
r
r r n
s
r
r r n
s
r
r r n
s
r
r r n
s
r
r r n
n
T
H v x y
h
H v y
h
K w
h
x y H v y
h
K w
h
y H v x y
h
e
(3.5)
Expanding the brackets and rearranging gives
( ) ( )
( )
1
1 1
'
1 1
2
1
1
1
1
1
1
+
= =
= =
+
+

¹

\

′ ′ + 
¹

\

′ +
(
¸
(
¸

¹

\

′ ′ ′ − ′ +
=
∑ ∑
∑ ∑
n
s
r
r r n
s
r
r r n
s
r
r r
s
r
r r n n n
n
T
H v x y
h
H v y
h
H v K w x y y
h
e
e
This implies that
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
127
( )
1
1 1
'
1 1
2
1
1
1
1
1
1
+
= =
= =
+
+

¹

\

′ ′ + 
¹

\

′ +
(
¸
(
¸

¹

\

′ ′ +
=
∑ ∑
∑ ∑
n
s
r
r r n
s
r
r r n
s
r
r r
s
r
r r n n
n
T
H v x y
h
H v y
h
H v K w
h
e e
e
(3.6)
( )
1
1 1
'
1 1
2
1
1
1
1
1
1
1
+
= =
= =
+
+

¹

\

′ ′ + 
¹

\

′ +
(
¸
(
¸

¹

\

′ ′ +
=
∑ ∑
∑ ∑
n
s
r
r r n
s
r
r r n
s
r
r r
s
r
r r n
n
T
H v x y
h
H v y
h
H v K w
h
e
e
(3.7)
From equations (3.7), setting
(
¸
(
¸

¹

\

′ ′ + =
∑ ∑
= =
s
r
r r
s
r
r r n
H v K w
h
A
1 1
2
1
1
,
(
¸
(
¸
′ + =
∑
=
s
r
r r n n
H v y
h
B
1
'
1
1
,
( )
(
¸
(
¸
′ ′ + =
∑
=
s
r
r r n n
H v x y
h
C
1
1
1
and I
n+1
= I
Then
c
n+1
=
A
n
B
n
C
n
c
n
+ I (3.8)
Let B = max B
n
> u, C = max C
n
> u and A = max A
n
< u then (3.8) becomes,
c
n+1
≤
A
BC
c
n
+ I
Set
A
BC
= K < 1, then
c
n+1
≤ Kc
n
+I (3.9)
If n = u, then from (3.9),
c
1
= Kc
0
+ I
c
2
= Kc
1
+ I = K
2
c
0
+ KI + I by substituting the value of c
1
c
3
= Kc
2
+ I = K
3
c
0
+ K
2
I +I
Continuing in this manner, we get the following
c
n+1
= K
n+1
c
0
+∑ K
t
I
n+1
t=0
(3.10)
Since
A
BC
= K < 1, then one can see that as n → ∞, c
n+1
→ u. This proves that the scheme converges.
4. CONSISTENCY
A scheme is said to be consistent, if the difference equation of the computation formula exactly
approximates the differential equation it intends to solve as the step size ends to zero. To prove if equation (2.22)
is consistent, subtract y
n
from both side of (2.22), then
( )
n
n
n n
n n
y
H H y
y h y
y y
2
3
1
1
2 1
1
−
+ +
′ +
= −
+
(4.1)
( )
( )
2 1
2 1
1
2
3
1
1
2
3
1
1
H H y
H H y y y h y
y y
n
n n n n
n n
+ +

¹

\

+ + − ′ +
= −
+
Simplifying gives
( )
( )
2 1
2 1
2
1
2
3
1
1
2
3
1
H H y
H H y y h
y y
n
n n
n n
+ +
+ − ′
= −
+
(4.2)
But
n
g
h
H
2
2
1
=
, and
( ) ( )
¹

\

+ + ′ + + ′ + + =
2 1 2 1
2
2
2
1
,
4
1
2
1
,
2
1
2
H H
h
z H H z h z h x f
h
H
n n n n
Substituting H
1
and H
2
in equation (4.2), gives
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
128
( ) ( )
( ) ( )


¹

\



¹

\


¹

\

+ + ′ + + ′ + + + +


¹

\



¹

\


¹

\

+ + ′ + + ′ + + + − ′
= −
+
2 1 2 1
2 2
2 1 2 1
2 2
2
1
2
1
,
4
1
2
1
,
2
1
2
2
2 3
1
1
2
1
,
4
1
2
1
,
2
1
2
2
2 3
1
H H
h
z H H z h z h x g
h
g
h
y
H H
h
z H H z h z h x g
h
g
h
y y h
y y
n n n n n n
n n n n n n n
n n
Dividing all through by ℎ and taking the limit as ℎ tends to zero on both sides gives
n
n n
h
y
h
y y
′ =
−
+
→
1
0
lim
Hence, the scheme in (2.22) is consistent.
Numerical Problems
Example 1.
Consider the equation
( ) ( ) ( )   1 , 0 , 0 0 , 1 0 , 1
2
∈ = ′ = + = ′ ′ x y y y x y
The exact solution is
[Sources: Jain 1984]
Example 2.
Consider a nonlinear ordinary differential equation
( ) ( ) ( )
2
1
0 , 1 0 , 0
2
= ′ = = ′ − ′ ′ y y y x y
The exact solution is
( ) 
¹

\

−
+
+ =
x
x
x y
2
2
ln
2
1
1
[Sources: Jacob (2010), Taiwo and Osilagun (2011)]
5. Discussions
Table 1 is the results obtained by applying the schemes to example 1, the variable coefficient
differential equation. The result performed well and approximate the exact solution better as the step size goes to
h = 0.001.
Example 2 is a nonlinear ordinary differential equation which is also well approximated with results in
table 2. The results show superiority over the results of Optimal Order Method of Jacob (2010) highlighted in
table 3.
6. Conclusion
The new numerical schemes derived follows the techniques of rational form of Runge – Kutta methods proposed
by Hong (1982) which was adopted by Okunbor (1987) and Ademiluyi and Babatola (2000) by using Taylor and
Binomial expansion in stages evaluation. The order condition obtained in this research is up to five (5) and the
stage is up to three (3). This is an improvement on the work of earlier authors.
The new schemes are of high accuracy for direct numerical solution of general second order ordinary
differential equations. The steps to the derivation of the new schemes are presented in the methodology while the
analysis of the schemes proved to be consistent, convergent, the results proves to be good estimate of the exact
equations. Thus, the scheme is effective and efficient, these suggest a wider application of the schemes for even
more complicated physical problems; since the methods is used to solve equations of the form y
ii
= (x, y, y′)
and y
ii
= (x, y) favorably. Equations of variable coefficients is considered and the fact that is also used to solve
nonlinear problem.
References
Abhulimen C. E and Uloko J. A (2012). A Class of an Implicit Stagetwo Rational RungeKutta Method for
Solution of Ordinary Differential Equations. Journal of Applied Mathematics and Bioinformatics, 2(3): 1731.
Ademiluyi, R. A, Babatola, P. O. (2000). Implicit Rational RungeKutta scheme for integration of stiffs ODE’s.
Nigerian Mathematical Society, (NMS) Journal.
Babatola P. O., Ademiluyi R. A and Areo E. A., (2007). OneStage Implicit Rational RungeKutta Schemes for
treatment of Discontinuous Initial value problems, Journal of Engineering and Applied Sciences 2(1): 96 – 104.
Bolarinwa, B. (2005). A Class of Semi – Implicit Rational Runge – Kutta scheme for solving ordinary differential
equations with derivative discontinuities. M. Tech thesis, Federal University of Technology, Akure; Nigeria.
Unpublished.
( )
2 /
2
x
e x y =
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
129
Bolarinwa B, Ademiluyi R. A, Oluwagunwa A. P. and Awomuse B. O. (2012). A Class of TwoStage Semi
Implicit Rational Runge  Kutta Scheme for Solving Ordinary Differential Equations. Canadian Journal of
Science and Engineering Mathematics, 3(3):99 – 111.
Butcher, J. C. (1987). Numerical Analysis of Ordinary Differential Equations: Runge–Kutta and General Linear
Methods (Wiley).
Dormand, J. R, ElMikkawy, M. E. A, and Prince, P. J. (1987). Families of RungeKuttaNystrom formula,IMA
journal of Numerical Analysis,7:235250.
Fudziah I. (2003). Embedded singly diagonal implicit RungeKuttaNystrom method order 5(4) for the
integration of special second order ordinary differential equations. International journal of mathematics science.
2(2):7074.
Fudziah I. (2009). Sixth Order Singly Diagonally Implicit RungeKutta Nystrom Method with Explicit First
Stage for Solving Second Order Ordinary Differential Equations. European Journal of Scientific Research.
26(4):470479.
Hong, Y. F, (1982): A Class of A – Stable Explicit Scheme, Computational and Asymptotic Method for Boundary
and Interior Layer. Proceeding of ball II conference, trinity college Dublin, 236 – 241.
Jacob K. S. (2010). A ZeroStable Optimal Method for Direct Solution of Second Order Differential Equations.
Journal of Mathematics and Statistics. 6(3): 367 – 371.
Jain, M. K. (1984). Numerical Solutions of Differential Equations, (Second Edition), Wiley Eastern Limited.
Lambert, J. D. (1973). Computational methods in ordinary differential equations. New York: John wiley and
sons.
Nystrom, E. J. (1925). Verber, Die Numericche Integration von Differentialgleichagen, Acta sos., Sc. Fenn,
5013,155.
Odekunle M. R (2001). Some SemiImplicit Rational RungeKutta Schemes. Bagale Journal of Pure and
Applied Sciences, 1(1):1114.
Odekunle, M. R, Oye, N. D, Adee, S. O. (2004). A class of inverse RungeKutta schemes for the numerical
integration of singular problems. Journal of Applied Mathematics and Computing. Elsevier, 158:149158.
Okunuga, S. A, Sofoluwa, A. B, Ehigie, J.O and Akambi, M. A. (2012). Fifth Order Two – Stage Explicit Runge
– Kutta – Nystrom Method for direct integration of Second Order Ordinary Differential Equations. Journal of
Scientific Research and Essay, 7(2):134144.
Okunbor, D. I. (1987). Explicit rational RungeKutta schemes for stiff system of ordinary differential equations.
M.Sc Thesis, University of Benin, Benin city. (Unpublished).
Senu, N, Sulaiman M, Ismail, F and Othman M. (2011). A Singly Diagonally Implicit RungeKutta  Nystrom
Method for Solving Oscillatory Problems. International Journal of Applied Mathematics. 41(2):
Sharp P. W. and Fine J. M., (1992). Nystrom pairs for the general second order initialvalue problems, Journal of
Computational and Applied Mathematics 42: 279291.
Taiwo O. A and Osilagun J. A, (2011). On approximate Solution of Second Order Differentia Equations by
Iterative Decomposition Method. Asian Journal of Mathematics and Statistics 4(1): 1 – 7.
PRESENTATION OF THE RESULTS
The results below are the exact and the approximate solution to each problem.
(Note that. All results is in 10 decimal places)
Table 1: Results of example 1 at h = 0.001
Exact Solutions Approximate Solutions Errors
t y(x
n
) y′(x
n
) y
n
y
n
i
y
n
y
n
i
0.001 1.000000500 0.001000001 1.000000500 0.001000000 0.00E00 0.00E00
0.002 1.000002000 0.002000004 1.000002000 0.002000002 0.00E00 2.28E09
0.003 1.000004500 0.003000014 1.000004500 0.003000006 0.00E00 7.14E09
0.004 1.000008000 0.004000032 1.000008000 0.004000016 0.00E00 1.58E08
0.005 1.000012500 0.005000063 1.000012500 0.005000033 0.00E00 2.94E08
0.006 1.000018000 0.006000108 1.000018000 0.006000059 0.00E00 4.87E08
0.007 1.000024500 0.007000172 1.000024500 0.007000097 0.00E00 7.49E08
0.008 1.000032001 0.008000256 1.000032000 0.008000147 0.00E00 1.09E07
0.009 1.000040501 0.009000365 1.000040500 0.009000213 0.00E00 1.52E07
0.01 1.000050001 0.010000500 1.000050001 0.010000296 0.00E00 2.05E07
Mathematical Theory and Modeling www.iiste.org
ISSN 22245804 (Paper) ISSN 22250522 (Online)
Vol.3, No.11, 2013
130
Table 2: Results of example 2 at h = 0.001
Exact Solutions Approximate Solutions Errors
t y(x
n
) y′(x
n
) y
n
y
n
i
y
n
y
n
i
0.001 1.000500000 0.500000125 1.000500000 0.500000251 0.00E00 1.26E07
0.002 1.001000000 0.500000500 1.001000000 0.500000752 0.00E00 2.52E07
0.003 1.001500001 0.500001125 1.001500001 0.500001505 0.00E00 3.80E07
0.004 1.002000003 0.500002000 1.002000003 0.500002509 0.00E00 5.09E07
0.005 1.002500005 0.500003125 1.002500006 0.500003763 0.00E00 6.38E07
0.006 1.003000009 0.500004500 1.003000010 0.500005269 1.37E09 7.69E07
0.007 1.003500014 0.500006125 1.003500016 0.500007026 1.90E09 9.01E07
0.008 1.004000021 0.500008000 1.004000024 0.500009033 2.53E09 1.03E06
0.009 1.004500030 0.500010125 1.004500034 0.500011292 3.24E09 1.17E06
0.01 1.005000042 0.500012500 1.005000046 0.500013802 4.05E09 1.30E06
Table 3: Comparing errors of example 4, Jacob (2010) and new scheme at
3
10 125 . 3
−
× = h
Exact Solutions Computed with
New scheme
Absolute Errors in
Jacob (2010)
Absolute error
in new Scheme
t y(x
n
) y
n
y
n
y
n
0.1 1.001562501 1.001562502 6.125E08 4.41E10
0.2 1.003125010 1.003125014 1.211E07 3.51E09
0.3 1.004687534 1.004687544 1.874E07 9.31E09
0.4 1.006250081 1.006250099 2.616E07 1.79E08
0.5 1.007812659 1.007812688 3.534E07 2.95E08
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 IISTE’s homepage:
http://www.iiste.org
CALL FOR JOURNAL PAPERS
The IISTE is currently hosting more than 30 peerreviewed academic journals and
collaborating with academic institutions around the world. There’s 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.
MORE RESOURCES
Book publication information: http://www.iiste.org/book/
Recent conferences: http://www.iiste.org/conference/
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische
Zeitschriftenbibliothek EZB, Open JGate, OCLC WorldCat, Universe Digtial
Library , NewJour, Google Scholar