Applied Mathematics and Computation 169 (2005) 402416

www.elsevier.com/locate/amc

A new algorithm for calculating

Adomian polynomials
Yonggui Zhu *, Qianshun Chang, Shengchang Wu
Institute of Applied Mathematics, Academy of Mathematics & Systems Science,
Chinese Academy of Sciences, Beijing 100080, Peoples Republic of China

Abstract
In this paper, a new algorithm for calculating Adomian polynomials for nonlinear
operators will be established by parametrization. The algorithm requires less formula
than the previous method developed by Adomian [Nonlinear Stochastic Operator Equations, Academic Press, 1986, G. Adomian, R. Rach, On composite nonlinearities and
decomposition method. J. Math. Anal. Appl. 113 (1986) 504509, G. Adomian, Applications of Nonlinear Stochastic Systems Theory to Physics, Kluwer, 1988]. Many forms
of nonlinearity will be studied to illustrate the new algorithm. The new algorithm will be
extended to calculate Adomian polynomials for nonlinearity of several variables.
2004 Elsevier Inc. All rights reserved.
Keywords: Adomian decomposition method; Adomian polynomials; Nonlinear operators; Nonlinearity of several variables

1. Introduction
The Adomian decomposition method [13] has been applied to a large
class of linear and nonlinear problems in mathematics, physics, biology and
*

Corresponding author.
E-mail address: ygzhu@amss.ac.cn (Y. Zhu).

0096-3003/$ - see front matter 2004 Elsevier Inc. All rights reserved.
doi:10.1016/j.amc.2004.09.082

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

403

chemistry. For many problems, the decomposition method has shown reliable
results in providing analytical approximation that converges rapidly. It is well
known that the Adomian decomposition method decomposes the term u(x, t)
into an innite sum of components un(x, t) dened by
1
X
ux; t
un x; t:
1
n0

And the decomposition method decomposes the nonlinear term F(u(x, t))
into A0(u0) + A1(u0, u1) + A2(u0, u1, u2) +    , that is
1
X
An u0 ; u1 ; . . . ; un ;
2
F ux; t
n0

where An are the so-called Adomian polynomials. Adomian [13] introduced

many formulas to generate Adomian polynomials for all forms of nonlinear
operators.
Recently, some feasible methods for the calculation of Adomian polynomials in a simple way without any need for the formulas introduced by Adomian
[13] have been studied by many authors [48].We believe that a new simple
and reliable algorithm can be established to calculate Adomian polynomials
less dependable on so many formulas as before.
The main goal of this paper is to provide a promising algorithm that can be
used to calculate Adomian polynomials for nonlinear operators in an easy way.
The newly developed algorithm has been established mainly by parametrization. The new method can also be used to generate Adomian polynomials
for non-linear terms of several variables.

2. The new algorithm for generating Adomian polynomials

At rst a theorem will be given.
Theorem 2.1. Suppose nonlinear
Nu = F(u), and the parameterized
P function
k
representation of u is uk 1
k
u
,
where
k is a parameter, then we
k
k0
have
P1 k 
Pn k 

on F
on F
on F uk
k0 k uk 
k0 k uk 

3

 :
n
n



ok
ok
okn
k0
k0

Proof 1. Since
1
n
1
X
X
X
kk uk
kk uk
kk uk ;
uk
k0

k0

kn1

k0

404

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

we have such result as following:

P1 k 
 Pn k

P1

k
on F
on F
on F uk
k0 k uk 
k0 k uk
kn1 k uk 





okn k0
okn
okn
k0
k0

P
on F nk0 kk uk 

 :
okn
k0
Therefore, we obtain
P1 k 

on F
on F uk
k0 k uk 


n


ok
okn
k0

on F

 Pn

k0 k
n

ok

k0


uk 



k0

As the representation introduced by Adomian [1], we assume the following

form again:
1
X
kk A k :
4
Nuk F uk
k0

So we have
F uk F

1
X

!
k

k uk

k0

1
X

k k Ak :

k0

In order to obtain An, we give n-order derivative of both sides of (5) with respect to k and let k = 0, that is
P1 k 

on
on F uk
k0 k Ak 

6
 :

okn k0
okn
k0

According to Theorem 2.1



P
on F uk
on F nk0 kk uk 


okn k0
okn
k0

and
on

P1

k0 k
n

ok


Ak 



So
on F

 Pn

k0 k
n

ok

on

Pn

ok

k0


uk 



k0

k0 k
n

on

 Pn


Ak 



k0 k
n

ok

:
k0


Ak 



k0

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

405

For (9) when n = 0, we can get A0; when n = 1, we can obtain A1; go on this
course, we will get A2, A3, . . ., An1, An.
The following is the algorithm for calculating A0, A1, A2, . . ., An1, An:
Step 1: Input nonlinear term Nu = F(u) and n that is the order of Adomian
polynomials
Step 2: Set uP= u0 + ku1 + k2u2 +    + knun
Step 3: Let nk0 kk Ak F u0 ku1 k2 u2    kn un
Step 4: For i = 0, 1, . . ., n do
(a) ith-order derivative of both sides of the above equality with respect to k:
 Pn k 
oi
oF u0 ku1 k2 u2    kn un
k0 k Ak

:
10
oki
oki
(b) For (10), let k = 0 and determine Ai by solving the equation with respect to
A i.
End do.
Step 5: Output A0, A1, . . ., An.

3. The calculation of Adomian polynomials for all forms of nonlinearity

by using the new algorithm
3.1. The case of nonlinear polynomials
Example 1. F(u) = u2, solve A0, A1, A2, A3, A4, A5, . . .
At rst, let
uk u0 ku1 k2 u2 k3 u3 k4 u4 k5 u5   

11

By (5) we have
1
X
2
kk Ak u0 ku1 k2 u2 k3 u3 k4 u4 k5 u5   

12

k0

let k = 0, we can obtain

A0 u20 :
If we give one-order derivative of the two sides of (12) with respect to k and let
k = 0, then using (9) we have


2
oA0 A1 k
ou0 ku1 
13
 :


ok
ok
k0

k0

Solve this equation with respect to A1, we obtain

A1 2u0 u1 :

406

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

If we give two-order derivative of the two sides of (12) with respect to k and let
k = 0, by (9) we have


o2 A0 A1 k A2 k2 
o2 u0 ku1 k2 u2 2 
14
 ;


ok2
ok2
k0
k0

that is
2A2 2u21 4u0 u2
so
A2 u21 2u0 u2 :
If we give three-order derivative of the two sides of (12) with respect to k and
let k = 0, by (9) we have


2
o3 A0 A1 k A2 k2 A3 k3 
o3 u0 ku1 k2 u2 k3 u3 
15

 ;


ok3
ok3
k0
k0
6A3 12u0 u3 12u1 u2 ;
A3 2u0 u3 2u1 u2 :
If four-order derivative of the two sides of (12) with respect to k is given and let
k = 0, by (9) we have

o4 A0 A1 k A2 k2 A3 k3 A4 k4 

ok4
k0

2
4
2
3
4
o u0 ku1 k u2 k u3 k u4 

16
 ;

ok4
k0

24A4 48u0 u4 24u22 48u1 u3 ;

A4 2u0 u4 u22 2u1 u3 :
When ve-order derivative of the two sides of (13) with respect to k is given and
let k = 0, by (9) we obtain

o5 A0 A1 k A2 k2 A3 k3 A4 k4 A5 k5 

ok5
k0

2
5
2
3
4
5
o u0 ku1 k u2 k u3 k u4 k u5 



ok5
k0

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

407

simplify the above equity, we have

120A5 240u0 u5 240u1 u4 240u2 u3 ;
that is
A5 2u0 u5 2u1 u4 2u2 u3 :
Continue this course, we can get A6, A7, . . .
Example 2. F(u) = u3 + u2, determine A0, A1, A2, A3, . . .
Proceeding as Example 1, we set
uk u0 ku1 k2 u2 k3 u3   

17

By (5) we have
1
X

kk Ak u0 ku1 k2 u2 k3 u3   

k0

u0 ku1 k2 u2 k3 u3   

18

let k = 0, we can obtain

A0 u30 u20 :
If we give one-order derivative of the two sides of (18) with respect to k and let
k = 0, then using (9) we have


oA0 A1 k
ou0 ku1 3 u0 ku1 2 
19
 :


ok
ok
k0

k0

Solve Eq. (19) with respect to A1, we obtain

A1 3u20 u1 2u0 u1 :
If we give two-order derivative of the two sides of (18) with respect to k and let
k = 0, by (9) we have


3
2
o2 A0 A1 k A2 k2 
o2 u0 ku1 k2 u2 u0 ku1 k2 u2 
 ;


ok2
ok2
k0

k0

20
that is
2A2 6u0 u21 6u20 u2 2u21 4u0 u2
so
A2 3u0 u21 3u20 u2 u21 2u0 u2 :

408

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

If we give three-order derivative of both sides of (18) with respect to k and

let k = 0, by (9) we have

o3 A0 A1 k A2 k2 A3 k3 

ok3
k0

3
2
3
2
o u0 ku1 k u2 k3 u3 u0 ku1 k2 u2 k3 u3 

 ; 21

ok3
k0
6A3 6u31 36u0 u1 u2 18u20 u3 12u0 u3 12u1 u2 ;
A3 u31 6u0 u1 u2 3u20 u3 2u0 u3 2u1 u2 :
Go on as the above, we will get A4, A5, . . .
3.2. Case of nonlinear derivatives
Example 1. For F(u) = uuxuxx, determine A0, A1, A2, A3, . . .
We rst set
uk

1
X

kk uk :

22

k0

By (5), we have
1
X
k0

k k Ak

1
X

!
kk uk

k0

1
X
k0

1
X

kk uk
x

k0

!
kk uk

23
xx

let k = 0, we can obtain

A0 u0 u0x u0xx :
If we give one-order derivative of the two sides of (23) with respect to k and let
k = 0, then using (9) we have


oA0 A1 k
ou0 ku1 u0x ku1x u0xx ku1xx 
24

 :
ok
ok
k0
k0
Solve the above equation with respect to A1, we obtain
A1 u1 u0x u0xx u0 u1x u0xx u0 u0x u1xx :
Similarly, if we give two-order derivative of the two sides of (23) with respect
to k and let k = 0, and using (9) and by solving an equation with respect to A2
we can get
A2 u2 u0x u0xx u1 u1x u0xx u1 u0x u1xx u0 u2x u0xx u0 u1x u1xx u0 u0x u2xx :

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

409

Continue as this course, we can obtain

A3 u3 u0x u0xx u2 u1x u0xx u2 u0x u1xx u1 u2x u0xx u1 u1x u1xx u1 u0x u2xx
u0 u3x u0xx u0 u2x u1xx u0 u1x u2xx u0 u0x u3xx ; . . .
Example 2. FP
u uu2x uuxx 2 , determine A0, A1, A2. . .
k
Set uk 1
k0 k uk , using (5) we have
!
!2
!
! !2
1
1
1
1
1
X
X
X
X
X
k
k
k
k
k
k Ak
k uk
k uk
k uk
k uk
:
k0

k0

k0

k0

k0

xx

25
Using the new algorithm, the Adomian polynomials for F u
are thus given by

uu2x

uuxx 2

A0 u0 u20x u0 u0xx ;
A1 u1 u20x 2u0 u0x u1x 2u0 u20xx u1 2u20 u0xx u1xx ;
A2 u2 u20x 2u1 u0x u1x u0 u21x 2u0 u0x u2x u21 u20xx 4u0 u0xx u1 u1xx
2u0 u20xx u2 u20 u21xx 2u20 u0xx u2xx ; . . .
3.3. Case of trigonometric and hyperbolic nonlinearity
Example 1. F P
u sin u sin2 ucos2 u.
k
Let uk 1
k0 k uk , by (5) we have
!
!
!
1
1
1
1
X
X
X
X
k
k
k
k
2
2
k Ak sin
k uk sin
k uk cos
k uk :
k0

k0

k0

26

k0

According to the new algorithm, the Adomian polynomials for F u sin u

sin2 ucos2 u are thus given by
A0 sin u0 sin2 u0 cos2 u0 ;
A1 u1 cos u0 2u1 sin u0 cos3 u0  2u1 sin3 u0 cos u0 ;
1
A2  u21 sin u0 u2 cos u0 u21 cos4 u0  6u21 sin2 u0 cos2 u0
2
2u2 sin u0 cos3 u0 u21 sin4 u0  2u2 sin3 u0 cos u0 ;
1
16
A3  u31 cos u0  u1 u2 sin u0 u3 cos u0  u31 cos3 u0 sin u0
6
3
16
3
2u1 u2 cos4 u0 u31 sin u0 cos u0  12u1 u2 sin2 u0 cos2 u0
3
3
2u3 sin u0 cos u0 2u1 u2 sin4 u0  2u3 sin3 u0 cos u0 ; . . .

410

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

Example 2. FP
u sinh2 u sinh u cosh u.
k
Set uk 1
k0 k uk , by (5) we have
!
!
!
1
1
1
1
X
X
X
X
k
k
k
k
2
k Ak sin h
k uk sin h
k uk cosh
k uk :
k0

k0

k0

27

k0

Using the new algorithm, the Adomian polynomials for F u sin h2 u

sinh u cosh u are thus given by
A0 sinh2 u0 sinh u0 cosh u0 ;
A1 2u1 sinh u0 cosh u0 u1 cosh2 u0 u1 sinh2 u0 ;
A2 u21 cosh2 u0 u21 sinh2 u0 2u2 sinh u0 cosh u0 2u21 cosh u0 sinh u0
u2 cosh2 u0 u2 sinh2 u0 ;
4
A3 u31 cosh u0 sinh u0 2u1 u2 cosh2 u0 2u1 u2 sin h2 u0
3
2
2u3 sinh u0 cosh u0 u31 sinh2 u0 4u1 u2 cos hu0 sinh u0
3
2 3
u1 cosh2 u0 u3 cosh2 u0 u3 sinh2 u0 ; . . .
3
3.4. Case of exponential and logarithmic nonlinearity
Example 1. F(u)P= eu.
k
If set uk 1
k0 k uk , by (5) we have
1
P1 k
X
kk Ak e k0 k uk :

28

k0

Using the new algorithm, we can obtain the Adomian polynomials for
F(u) = eu as followings:
A0 e u 0 ;
A1 u 1 e u 0 ;
1
A2 u2 eu0 u21 eu0 ;
2
1
A3 u3 eu0 u1 u2 eu0 u31 eu0 ;
6
1
1
1
u0
u0
A4 u4 e u1 u3 e u22 eu0 u2 u21 eu0 u41 eu0 ;
2
2
24
...

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

u
Example 2. F(u)
P1= lnk u + e .
Let uk k0 k uk , by (5) we have
!
1
1
P1 k
X
X
k
k
k Ak ln
k uk e k0 k uk :
k0

411

29

k0

Using the new algorithm, the Adomian polynomials for F(u) = ln u + eu are
thus given by the followings:
A0 ln u0 eu0 ;
u1
A1 u 1 e u 0 ;
u0
u2
u2
1
A2  12 u2 eu0 u21 eu0 ;
2
u0 2u0
3
u3 u1 u2
u
1
A3  2 13 u3 eu0 u1 u2 eu0 u31 eu0 ;
6
u0
u0
3u0
...
3.5. Case of composite nonlinearity
2u

Example 1. F u esin 2 .
Set u = u0 + ku1 + k2u2 + k3u3 +    , by (5) we have
1
2
3
X
2 u0 ku1 k u2 k u3 
2
kk Ak esin
;

30

k0

let k = 0, then we have

2 u0

A0 esin 2 :
If we give one-order derivative of both sides of (30) with respect to k and let
k = 0, using (9) we have


2 u0 ku1
oA0 A1 k
oesin 2 
 ;


ok
ok
k0
k0

A1 u1 esin

2 u0
2

sin

u0
u0
cos :
2
2

If two-order derivative of two sides of (30) with respect to k is given and let
k = 0, by (9) we have

2

2 u0 ku1 k u2 

2
o2 A0 A1 k A2 k2 
o2 esin
 ;



2
2
ok
ok

k0
k0

412

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

2 u0
2 u0
u0
u0 u2
u0 u2
u0
cos2  1 esin 2 cos2 1 esin 2 sin2
2
2
2
2
2
2
u
u0
u0
sin2 20
 2u2 e
sin cos ;
2
2
2 u0

2A2 u21 esin 2 sin2

2 u0
2 u0
u21 sin2 u0 2 u0
u0 u2
u0 u2
u0
2 sin
e
cos2  1 esin 2 cos2 1 esin 2 sin2
2
2
2
4
2
4
2
u
u0
u0
sin2 20
 u2 e
sin cos :
2
2
If give three-order derivative of two sides of (30) with respect to k and let k = 0,
by (9) we have

2
3

2 u0 ku1 k u2 k u3 

2
o3 A0 A1 k A2 k2 A3 k3 
o3 esin
 :



3
3
ok
ok

k0

A2

k0

Simplify the above equality

6A3 u31 cos

2 u0
2 u0
u0
u0
u0
3
u0
sin esin 2  3u1 u2 cos2 esin 2 u31 sin
2
2
2
2
2

u
2 u0
u0 sin2 u0
3
u0
u0
2 u0 sin2 20
2 3u u sin
e
e
 u31 sin3 cos esin 2
1 2
2
2
2
2
2
u0
2
u0
u0 sin2 u0
u
u
u0
0
2 0
2 6u u sin
cos2 esin 2  u31 sin3
 6u3 sin cos e
1 2
2
2
2
2
2
2 u0
u
0
 cos3 esin 2 :
2

 cos3

So
2 u0
2 u0
1
u0
u0
1
u0
1
u0
A3 u31 cos sin esin 2  u1 u2 cos2 esin 2 u31 sin
6
2
4
2
2
2
2

 cos3

2 u0
2 u0
u0 sin2 u0 1
u0
1
u0
u0
2
u1 u2 sin2 esin 2  u31 sin3 cos esin 2
e
2
4
2
2
2
2

 u3 sin
 cos3

2 u0
2 u0
u0
u0
u0
u0
1
u0
cos esin 2 u1 u2 sin2 cos2 esin 2  u31 sin3
6
2
2
2
2
2

u0 sin2 u0
2:
e
2

If continue this course, we can obtain A4, A4, A5, . . .

Example 2. F u u2 esin u cosh u ln u.
As the above-mentioned examples, using the new algorithm Adomian
polynomials for F u u2 esin u cosh u ln u can be given by

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

413

A0 u20 esin u0 cosh u0 ln u0 ;

1
1
A1 2u1 u0 esin u0 u1 u20 cos u0 esin u0 u1 eu0 ln u0  u1 ln u0 eu0
2
2
u1 u0 u1 u0

e
e ;
2u0
2u0
A2 u21 esin u0 2u0 u21 cos u0 esin u0 2u0 u2 esin u0
1
 u20 u21 sin u0 esin u0 u20 u2 cos u0 esin u0
2
1
1
1
u20 u21 esin u0  u20 u21 sin2 u0 esin u0 eu0 u21 ln u0
2
2
4
1
1
1
1 u2 1 u2
u21 ln u0 eu0 eu0 u2 ln u0  u2 ln u0 eu0 eu0 1  1 eu0
4
2
2
2 u0 2 u0

1 u2 u0 1 u2 u0 1 u21 u0 1 u21 u0

e
e  2e  2e ;
2 u0
2 u0
4 u0
4 u0

...

4. The extension of new algorithm to the case of nonlinearity of several variables

In the following, by using some examples we will show how the new algorithm is extended to multi-variable case.
2

o u 2
Example 1. F u oxoy
, determine A0, A1, A2, A3, . . .
At rst, set u = u0 + ku1 + k2u2 + k3u3 +    , from (5) we have
 2
2
1
2
2
X
o u0
o2 u1
k
2 o u2
3 o u3
k
k
k
 :
k Ak
oxoy
oxoy
oxoy
oxoy
k0

31

If let k = 0, we can obtain

 2 2
o u0
:
A0
oxoy
If give one-order derivative of both sides of (31) with respect to k and let
k = 0, by (9), we have

2
2 
o u0
o2 u1

o oxoy k oxoy 
oA0 A1 k

 ;


ok
ok
k0

k0

414

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

A1 2

o2 u0 o2 u1
:
oxoy oxoy

If give two-order derivative of both sides of (31) with respect to k and let
k = 0, by (9) we have

2 
2 o2 u0
2 o2 u2
o2 u1

2
2 
o

k
oxoy
oxoy
oxoy
o A0 A1 k A2 k 


 ;


ok2
ok2
k0

k0


2A2 2

o2 u1
oxoy


4

o2 u0
oxoy

o2 u2
;
oxoy

that is

A2

o2 u1
oxoy

2
2

o2 u0 o2 u2
:
oxoy oxoy

If give three-order derivative of both sides of (31) with respect to k and let
k = 0, by (9) we can get

2 
3 o2 u0
2 o2 u2
3 o2 u3
o2 u1

3
2
3 
o

k
oxoy
oxoy
oxoy
oxoy
o A0 A1 k A2 k A3 k 


 ;

3

ok3
ok
k0

k0


6A3 12

o2 u1
oxoy

o2 u2
oxoy


12

o2 u0
oxoy

o2 u3
;
oxoy

that is
A3 2

o2 u1 o2 u2
o2 u0 o2 u3
2
:
oxoy oxoy
oxoy oxoy

If we go on this course, we can obtain A4, A5, A6,. . .

3

o u
Example 2. For F u u2 oxoyoz
, determine A0, A1, A2, A3,. . .,
At rst, we let

u u0 ku1 k2 u2 k3 u3   
from (5), we have
1
X
kk Ak u0 ku1 k2 u2 k3 u3    2
k0

o3 u0 ku1 k2 u2 k3 u3   
:
oxoyoz

32

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

415

Let k = 0, we have
A0 u20

o3 u0
:
oxoyoz

If one-order derivative of both sides of (32) with respect to k is given and let
k = 0, by (9) we have


2 3 0 ku1 

o u0 ku1 o u

oxoyoz
oA0 A1 k
 ;



ok
ok

k0
k0

A1 2u0 u1

o3 u0
o3 u1
u20
:
oxoyoz
oxoyoz

If give two-order derivative of the two sides of (32) with respect to k and let
k = 0, by (9) we get


2 o3 u0 ku1 k2 u2 
2
2
2
2 
o
u

ku

k
u

0
1
2

oxoyoz
o A0 A1 k A2 k 
 ;



2
2
ok
ok

k0
k0

2A2 2u21
A2 u21

o3 u0
o3 u1
o3 u0
o3 u2
4u0 u1
4u0 u2
2u20
;
oxoyoz
oxoyoz
oxoyoz
oxoyoz

o3 u0
o3 u1
o3 u0
o3 u2
2u0 u1
2u0 u2
u20
:
oxoyoz
oxoyoz
oxoyoz
oxoyoz

If give three-order derivative of both sides of (32) with respect to k and let
k = 0, by (9) we can obtain

o3 A0 A1 k A2 k2 A3 k3 

ok3
k0


2
3
2 3
3
2
1 k u2 k u3 
o u0 ku1 k u2 k3 u3 o u0 kuoxoyoz

 :


3
ok

k0

Simplify the above equity, we have

6A3 12u1 u2

o3 u0
o3 u 1
o3 u2
o3 u1
6u21
12u0 u1
12u0 u2
oxoyoz
oxoyoz
oxoyoz
oxoyoz

12u0 u3

o3 u0
o3 u3
6u20
:
oxoyoz
oxoyoz

416

Y. Zhu et al. / Appl. Math. Comput. 169 (2005) 402416

Thus
A3 2u1 u2

o3 u0
o3 u1
o3 u2
o3 u1
u21
2u0 u1
2u0 u2
oxoyoz
oxoyoz
oxoyoz
oxoyoz

2u0 u3

o3 u0
o3 u3
u20
:
oxoyoz
oxoyoz

In the same way, we can calculate A4, A5, A6, . . . , etc.

5. Discussion and conclusion

The Adomian decomposition method is a powerful method for solution of a
large class of nonlinear problems in physics, biology, chemistry and etc. However, the implementation of the decomposition method mainly depends upon
the calculation of Adomian polynomials for nonlinear operators. So developing some practical methods for the calculation of Adomian polynomials for all
forms of nonlinearity is vital to solve nonlinear problems in many applied
sciences.
In this paper, we introduced a new reliable algorithm to generate Adomian
polynomials for all forms of nonlinearity. The new algorithm does not suer
from the numerous formulas required in [13]. Several cases of nonlinearity
were discussed for calculating Adomian polynomials and results are very
promising.

References
[1] G. Adomian, Nonlinear Stochastic Operator Equations, Academic Press, 1986.
[2] G. Adomian, R. Rach, On composite nonlinearities and decomposition method, J. Math. Anal.
Appl. 113 (1986) 504509.
[3] G. Adomian, Applications of Nonlinear Stochastic Systems Theory to Physics, Kluwer, 1988.
[4] R. Rach, A convenient computational form for the Adomian polynomials, J. Math. Anal. Appl.
102 (1984) 415419.
[5] V. Seng, K. Abbaoui, Y. Cherruault, Adomians polynomials for nonlinear operators, Math.
Comput. Model. 24 (1996) 5965.
[6] K. Abbaooui, Y. Cherruault, Convergence of Adomians method applied to dierential
equations, Comput. Math. Appl. 102 (1999) 7786.
[7] A.M. Wazwaz, The decomposition method for approximate solution of the Goursat problem,
Appl. Math. Comput. 69 (1995) 299311.
[8] A.M. Wazwaz, A new algorithm for calculating Adomian polynomials for nonlinear operators,
Appl. Math. Comput. 111 (2000) 5369.