Int. J. Contemp. Math. Sciences, Vol. 8, 2013, no.

13, 623 - 631

HIKARI Ltd, www.m-hikari.com
http://dx.doi.org/10.12988/ijcms.2013.3570


Discrete Adomian Decomposition Method for

Solving Burgers-Huxley Equation


Abdulghafor M. Al-Rozbayani

Department of Mathematics, College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
abdulghafor_rozbayani@yahoo.com

Mohammed O. Al-Amr

Department of Mathematics, College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
malamroo@yahoo.com

Copyright 2013 Abdulghafor M. Al-Rozbayani and Mohammed O. Al-Amr. This is an open
access article distributed under the Creative Commons Attribution License, which permits
unrestricted use, distribution, and reproduction in any medium, provided the original work is
properly cited.

Abstract

In this paper, the discrete Adomian decomposition method (DADM) is applied
to a fully implicit scheme of the generalized BurgersHuxley equation. The
numerical results of two test problems are compared with the exact solutions. The
comparisons reveal that the proposed method is very accurate and effective for
this kind of problems.

Keywords: Discrete Adomian decomposition method, Finite difference scheme,
Generalized BurgersHuxley equation


1 Introduction

Nonlinear partial differential equations (NLPDEs) are encountered in various
fields of science. Generalized BurgersHuxley equation (GBH) being one of the
most famous NLPDE is of high importance for describing the interaction between
reaction mechanisms, convection effects, and diffusion transports. Since there

624 Abdulghafor M. Al-Rozbayani and Mohammed O. Al-Amr


exists no general technique for finding analytical solutions of nonlinear diffusion
equations so far, numerical solutions of nonlinear differential equations are of
great importance in physical problems.
The generalized BurgersHuxley equation investigated by Satsuma [16] in
1987 is of the form
2
2
(1 )( ),
u u u
u u u u
t x x
o o o
o |
c c c
+ =
c c c
, 0 a x b t s s > (1)
Subject to the initial condition
( , 0) ( ), u x f x = a x b < < (2)
and the boundary conditions
1
( , ) ( ) u a t f t = ,
2
( , ) ( ) u b t f t = , 0 t > (3)
where , , o | and o are parameters, 0 | > , 0 o > , (0,1) e .
The GBH equation has received a great deal of attention by a wide variety of
researchers. In Wang et al. [17] the solitary wave solutions of the GBH equation is
studied. The non-classical symmetries and the singular modified solutions of the
Burger and BurgersHuxley equation by Estevez [7]. Recently, various powerful
methods have been applied to solve the GBH equation such as spectral methods
[6,11], Adomian decomposition method [9,10], variational iteration method [1],
homotopy analysis method [13], differential transform method [2], differential
quadrature method [14], finite difference methods [3,12,15], Exp-function method
[8], Haar wavelet method [5] and many others.
The discrete version of Adomian decomposition method was first proposed
by Bratsos et al. [4] applied to discrete nonlinear Schrdinger equations. Zhu et al.
[18] have developed the DADM to 2D Burgers difference equations. In this study,
the DADM is implemented to nonlinear difference scheme of generalized
BurgersHuxley equation. The obtained results of two test problems are
compared with the exact solutions to verify the efficiency and accuracy of the
proposed method.

The paper layout is as follow: Section 2 deals with the application of the
DADM to nonlinear difference scheme of the GBH equation. In Section 3, we
present two test examples of the GBH equation with numerical illustrations.
Section 4 concludes the paper.

2 Discrete Adomian decomposition method

To apply the DADM to Eq. (1) with initial condition (2), we formulate the
following fully implicit scheme:
( ) ( ) ( ) ( )
( )( ) ( )
1 1 1 1 1 1 1
1 1 1 1 2
1 2 1
1 1 1
1 1 1
2
2
1
n n n n n n n n
i i i i i i i i
n n n
i i i
u u u u u u u u
h h
u u u
o
o o
o
t
|
+ + + + + + +
+ +
+ +
+ + +
+ +
(
= +
(


(4)

Discrete Adomian decomposition method 625


We denote the discrete approximation of ( , ) u x t at the grid point ( , ) ih nt
by
n
i
u ( 0,1, 2, , ; 0,1, 2, ) i N n = = , where 1 h N = is the spatial step size
and t represents time increment.
Consider the above scheme written in an operator form as
( ) ( )( ) ( )
1 2 1
1 1 2 1 1 1 1
1
n n n n n n n
i i h i h i i i i
D u u D u D u u u u
o o o
t
o |
+ +
+ + + + + + +
(
+ = +
(

(5)
with the initial condition
0
i i
u f = . (6)
The linear operator D
t
+
denote the forward difference approximation, i.e.,
( )
1
1
n n n
i i i
D u u u
t
t
+ +
= (7)
The first and second order central difference approximations, denoted by
h
D
and
2
h
D , respectively, are given by
( )
1 1 1
1 1
1
,
2
n n n
h i i i
D u u u
h
+ + +
+
=
( )
2 1 1 1 1
1 1 2
1
2 .
n n n n
h i i i i
D u u u u
h
+ + + +
+
= + (8)
The inverse discrete operator
1
( ) D
t
+
is given by [4]
1
1
0
( ) ,
n
n m
m
D w w
t
t

+
=
=

(9)
Using the above definition, we get
1 0
( ) .
n n
i i i
D D u u u
t t
+ +
= (10)
Applying the inverse operator
1
( ) D
t
+
to Eq.(5) yields
( ) ( ) ( )
( )
0 1 1 1 2 1 1 1
1 1 1 1
( ) ( ) 1 ( )
( ) ( )
n n n n
i i i h i i
n n
i i
u u D M u D D u D N u
D u D P u
t t t
t t
o |

+ + + + + +
+ + + +

= + + +

(


(11)
Following the DADM, the discrete approximation
n
i
u can be decomposed into a
sum of components defined by the decomposition series
,
0
n n
i i k
k
u u

=
=

(12)
The nonlinear operators
( ) ( )
1 1
,
n n
i i
M u N u
+ +
and
( )
1 n
i
P u
+
are related to the
nonlinear terms and can be decomposed by the infinite series of the so-called
Adomian polynomials as follows
( ) ( ) ( ) ( )
( ) ( )
1
1 1 1 1 1
0 0
2 1
1 1
0
, ,
n n n n n
i i h i k i i k
k k
n n
i i k
k
M u u D u A N u u B
P u u C
o o
o

+
+ + + + +
= =

+
+ +
=
= = = =
= =

(13)



626 Abdulghafor M. Al-Rozbayani and Mohammed O. Al-Amr


Where ,
k k
A B and
k
C are the so-called Adomian polynomials that can be
generated according to the following algorithms

1
,
0
0
1
, 0
!
k
n
k i k
d
A M u k
k d

+
=
=
(
| |
= >
( |
\ .

1
,
0
0
1
, 0
!
k
n
k i k
d
B N u k
k d

+
=
=
(
| |
= >
( |
\ .

(14)
1
,
0
0
1
0
!
, .
k
n
k i k
d
C P u k
k d

+
=
=
(
| |
= >
( |
\ .

Substituting (12) and (13) into (11) yields
( )
1 1 2 1 1
, ,
0 0 0 0
1 1 1
,
0 0
( ) ( ) 1 ( )
( ) ( )
n n
i k i k h i k k
k k k k
n
i k k
k k
u f D A D D u D B
D u D C
t t t
t t
o |

+ + + +
= = = =

+ + +
= =

= + + +

(

(

(15)

Each term of series (12) is given by the recurrence relation
,0
n
i i
u f =
( )
1 1 2 1 1 1 1
, 1 , ,
1
( ) ( ) 1 ( ) ( )
( ) , 0
n n n
i k k h i k k i k
k
u D A D D u D B D u
D C k
t t t t
t
o |
+ + + + + +
+
+
= + + +

( >

(16)
So, the practical solution for the -term approximation is
1
,
0
, 1
n
i k
k
u

=
= >

, (17)
and the exact solution is
,
0
lim .
n n
i i k
k
u u

=
= =

(18)
The first three components of Adomian polynomials ,
k k
A B and
k
C read

( )
( ) ( )
( ) ( ) ( )
( )
1 1
0 ,0 ,0
1
1 1 1 1 1
1 ,0 ,1 ,0 ,0 ,1
1 1
1 1 1 1 1 1 1 1
2 ,0 ,2 ,0 ,1 ,1 ,0 ,0 ,2
2
1 1 1
,0 ,1 ,0
1
( 1)
2
n n
i h i
n n n n n
i i h i i h i
n n n n n n n n
i h i i i h i i h i i
n n n
i i h i
A u D u
A u u D u u D u
A u D u u u D u u D u u
u u D u
o
o o
o o o
o
o
o o
o o
+ +

+ + + + +

+ + + + + + + +

+ + +
=
= +
= + +
+



Discrete Adomian decomposition method 627



( )
( )
( ) ( ) ( )
1
1
0 ,0
1 1
1 ,0 ,1
2 1
1 1 1 1
2 ,0 ,2 ,1 ,0
( 1)
1
( 1) ( 1)
2
n
i
n n
i i
n n n n
i i i i
B u
B u u
B u u u u
o
o
o o
o
o o o
+
+
+ +

+ + + +
=
= +
= + + +

( )
( )
( ) ( ) ( )
2 1
1
0 ,0
2
1 1
1 ,0 ,1
2 2 2 1
1 1 1 1
2 ,0 ,2 ,1 ,0
(2 1)
(2 1) (2 1)
n
i
n n
i i
n n n n
i i i i
C u
C u u
C u u u u
o
o
o o
o
o o o
+
+
+ +

+ + + +
=
= +
= + + +



3 Numerical experiments

In this section, we will give two test examples of the GBH equation to verify
the efficiency and measure the accuracy of the DADM solutions in comparison
with the exact solution and we will use Maple 16 software to obtain the numerical
results.

Consider the GBH equation [9]:
2
2
(1 )( ),
u u u
u u u u
t x x
o o o
o |
c c c
+ =
c c c
0 1, 0 x t s s > (19)

with the initial condition
1
( , 0) tanh( ) ,
2 2
u x x
o

o
(
= +
(

(20)
and the boundary conditions
1
(1 )( )
(0, ) tanh ,
2 2 1 2(1 )
u t t
o
o o o
o
o o
( | | +
= + + (
` ` |
+ +
) ( \ . )
(21)
1
(1 )( )
(1, ) tanh 1 ,
2 2 1 2(1 )
u t t
o
o o o
o
o o
( | | +
= + (
` ` |
+ +
) ( \ . )
(22)
where ( ) 4(1 ) o o o o = + and
2
4 (1 ) o | o = + +
and the exact solution is given by
1
(1 )( )
( , ) tanh .
2 2 1 2(1 )
u x t x t
o
o o o
o
o o
( | | +
= + (
` ` |
+ +
) ( \ . )
(23)


628 Abdulghafor M. Al-Rozbayani and Mohammed O. Al-Amr


Example 1. We consider Eq. (19) with
4
0.001, 1, 10 o | t

= = = = and 0.1 h =
The absolute errors for various values of , t o and x are given in Table 1. We
plot in Fig. 1 the absolute error for the values 0.001, = 1, o | o = = =
4
10 t

=
and 0.1 h = .

Table 1: The absolute errors using
3
for various values of , t o and x with
0.001, 1 o | = = =

t

x

1 o =

2 o =

4 o =

8 o =

0.1 1.87406E08 8.74970E07 6.13597E06 1.66019E05
0.05 0.5 1.87406E08 8.74894E07 6.13465E06 1.65954E05
0.9 1.87406E08 8.74818E07 6.13333E06 1.65888E05

0.1 3.74812E08 1.74995E06 1.22721E05 3.32047E05
0.1 0.5 3.74812E08 1.74980E06 1.22695E05 3.31916E05
0.9 3.74812E08 1.74964E06 1.22668E05 3.31784E05

0.1 3.74812E07 1.75012E05 1.22751E04 3.32195E04
1 0.5 3.74812E07 1.74997E05 1.22724E04 3.32063E04
0.9 3.74812E07 1.74982E05 1.22698E04 3.31932E04



Fig. 1 The absolute error of
3
with 0.001, = 1, o | o = = =
4
10 t

= and 0.1 h =

Discrete Adomian decomposition method 629


Example 2. We consider Eq. (19) with
4
0.1, 0.001, 10 o | t

= = = = and
0.1 h = . The absolute errors for various values of , t o and x are given in
Table 2. We plot the absolute error in Fig. 2 for the values 0.1, o = =
4
0.001, 1, 10 | o t

= = = and 0.1 h = .

Table 2: The absolute errors using
3
for various values of , t o and x with
0.1, 0.001 o | = = =

t x 1 o = 2 o = 4 o = 8 o =
0.1 1.36075E07 6.45516E07 1.46880E06 2.31838E06
0.05 0.5 1.36075E07 6.45412E07 1.46816E06 2.31632E06
0.9 1.36075E07 6.45308E07 1.46751E06 2.31425E06

0.1 2.72151E07 1.29103E06 2.93761E06 4.63678E06
0.1 0.5 2.72151E07 1.29082E06 2.93632E06 4.63265E06
0.9 2.72151E07 1.29062E06 2.93503E06 4.62851E06

0.1 2.72151E06 1.29105E05 2.93769E05 4.63706E05
1 0.5 2.72151E06 1.29084E05 2.93640E05 4.63293E05
0.9 2.72151E06 1.29063E05 2.93511E05 4.62879E05


Fig. 2 The absolute error of
3
with 0.1, o = =
4
0.001, 1, 10 | o t

= = = and
0.1 h =

630 Abdulghafor M. Al-Rozbayani and Mohammed O. Al-Amr



4 Conclusions

In this paper, the DADM is proposed for the generalized BurgersHuxley
equation. The obtained results, reported in Tables 1 and 2, reveal that the
proposed method is very reliable, accurate and simple tool to solve the GBH
equation and can be applied to other nonlinear problems.


References

[1] B. Batiha, M.S.M. Noorani and I. Hashim, Application of variational
iteration method to the generalized BurgersHuxley equation, Chaos,
Solitons and Fractals, 36 (2008), 660663.

[2] J. Biazar and F. Mohammadi, Application of differential transform method to
the generalized BurgersHuxley equation, Appl. Appl. Math., 5 (2010),
17261740.

[3] A. G. Bratsos, A Fourth order improved numerical scheme for the
generalized BurgersHuxley equation, Amer. J. Comput. Math., 1 (2011),
152158.

[4] A. Bratsos, M. Ehrhardt and I.Th. Famelis, A discrete Adomian
decomposition method for discrete nonlinear Schrdinger equations, Appl.
Math. Comput., 197 (2008), 190205.

[5] I. elik, Haar wavelet method for solving generalized BurgersHuxley
equation, Arab J. Math. Sci., 18 (2012), 2537.

[6] M. ElKady, S.M. ElSayed and H.E. Fathy, Development of Galerkin
method for solving the generalized BurgersHuxley equation, Math. Probl.
Eng., 2013 (2013), Article ID 165492, 9 pages, doi: 10.1155/2013/165492.

[7] P.G. Estevez, Nonclassical symmetries and the singular modified the
Burgers and BurgersHuxley equation, J. Phys. A, 27 (1994), 21132127.

[8] H. Gao and R. Zhao, New exact solutions to the generalized BurgersHuxley
equation, Appl. Math. Comput., 217 (2010), 15981603.

[9] I. Hashim, M.S.M. Noorani and M.R.S. AlHadidi, Solving the generalized
BurgersHuxley equation using the Adomian decomposition method, Math.
Comput. Mod., 43 (2006), 14041411.

Discrete Adomian decomposition method 631



[10] H.N.A. Ismail, K. Raslan and A.A. AbdRabboh, Adomian decomposition
method for BurgersHuxley and BurgersFisher equation, Appl. Math.
Comput., 159 (2004), 291301.

[11] M. Javidi, A numerical solution of the generalized BurgersHuxley equation
by spectral collocation method, Appl. Math. Comput., 178 (2006), 33844.

[12] S.A. Manaa and F.M. Saleem, Numerical solution and stability analysis for
BurgersHuxley equation, AlRafidain J. Comput. Sci. Math., 6 (2009),
6175.

[13] A. Molabahrami and F. Khani, the homotopy analysis method to solve the
BurgersHuxley equation, Nonlinear Anal. Real World Appl., 10 (2009),
589600.

[14] M. Sari and G. Grarslan, Numerical solutions of the generalized
BurgersHuxley equation by a differential quadrature method, Math. Probl.
Eng., 2009 (2009), Article ID 370765, 11 pages, doi:10.1155/2009/370765.

[15] M. Sari, G. Grarslan and A. Zeytinolu, Highorder finite difference
schemes for numerical solutions of the generalized BurgersHuxley equation,
Numer. Methods Partial Differential Eq., 27 (2011), 13131326.

[16] J. Satsuma, Topics in Soliton Theory and Exactly Solvable Nonlinear
Equations, World Scientific, Singapore, 1987.

[17] X.Y. Wang, Z.S. Zhu and Y.K. Lu, Solitary wave solutions of the
generalized BurgersHuxley equation, J. Phys. A, 23 (1990), 271274.

[18] H. Zhu, H. Shu and M. Ding, Numerical solutions of two-dimensional
Burgers' equations by discrete Adomian decomposition method, Comput.
Math. Appl., 60 (2010), 840848.


Received: May 28, 2013