You are on page 1of 9

Applied Mathematics and Computation 157 (2004) 93101 www.elsevier.

com/locate/amc

An application of the ADM to seven-order SawadaKotara equations


Salah M. El-Sayed
a b

a,*

, Do gan Kaya

Department of Mathematics, Benha University, Benha 13518, Egypt Department of Mathematics, Firat University, Elazig 23119, Turkey

Abstract We implemented the Adomian decomposition method (for short, ADM) for approximating the solution of the seventh-order SawadaKotera (for short, sSK) and a Laxs seventh-order KdV (for short, LsKdV) equations. By using this scheme, explicit exact solution is calculated. We obtain the exact solitary-wave solutions and numerical solutions of the LsKdV and sSK equations for the initial conditions. The numerical solutions are compared with the known analytical solutions. Their remarkable accuracy are nally demonstrated for the both seven-order equations. 2003 Elsevier Inc. All rights reserved.
Keywords: The Adomian decomposition method; The seventh-order SawadaKotera equation; Laxs seventh-order KdV equation; Solitary-wave solution; The convergence of Adomian decomposition method

1. Introduction In this work we consider to implement the ADM to the sSK and LsKdV equations which can be shown in the form
2 ut 63u4 632u2 uxx uu2 x 21uuxxxx uxx ux uxxx uxxxxxx x 0;

* Corresponding author. Address: Department of Mathematics, Scientic Departments, Education College for Girls, Al-Montazah, Buraydah, Al-Qassim, Saudi Arabia. E-mail addresses: ms4elsayed@yahoo.com (S.M. El-Sayed), dkaya@rat.edu.tr (D. Kaya).

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

94

S.M. El-Sayed, D. Kaya / Appl. Math. Comput. 157 (2004) 93101


2 ut 35u4 70u2 uxx uu2 x 72uuxxxx 3uxx 4ux uxxx uxxxxxx x 0;

2 respectively. Eq. (1) is known as the seventh-order SawadaKotera equation [1] and Eq. (2) is known as the Laxs seventh-order KdV equation [2]. In [38], the ADM [9,10] is applied to a linear KdV like equation [3], a generalized KdV equation [4], the SawadaKotera equation [5], some fthorder KdV equation [6], the generalized KdV equations [7] and the generalized fth-order KdV equation [8]. The convergence of the ADM have investigated by several authors [1215]. They obtained some results about the speed of convergence of this method providing us to solve linear and nonlinear functional equations. In recent work of Ngarhasta et al. [16] have proposed a new approach of convergence of the decomposition series. The authors have given a new condition for obtaining convergence of the decomposition series to the classical presentation of the ADM in [16]. On other side various papers claim general proofs of the convergence of the Adomians series to a solution of the nonlinear equation; see for example [1216]. However, these are unconvincing and we have been unable to nd a clear general proof of convergence of Adomians method. Our aim here is to generate an appropriate Adomians polynomials for the LsKdV and sSK equations (1) which will be handle more easily, quickly, and elegantly by implementing the Adomians decomposition method rather than the traditional methods for the exact and numerical solutions of which is to be obtained subject to the initial condition. We will demonstrate how the approximate solutions of the LsKdV and sSK equations are close to corresponding exact solutions. Two examples are tested, and the obtained results suggest that this newly applications of the ADM introduces a promising tool and powerful improvement for many other applications in scientic elds.

2. The method of solution In this section, we will describe ADM for solving Eqs. (1) and (2), [9,10]. We dene for Eq. (1) (Eq. (2) can be dene in the similar way) in the linear operator form Lt u 63K1 u 632K2 u M1 u 21M2 u N1 u N2 u x ux 0; 3
2 where the notations K1 u u4 , K2 u u2 uxx , M1 u uu2 x , M2 u uuxxxx , N1 u uxx , and N2 u ux uxxx symbolize the nonlinear terms, respectively. The notation t o=ot and x o6 =ox6 symbolize the linear dierential operators. Assum1 ing the inverse of the operator is exists and it is the one-fold integration t

S.M. El-Sayed, D. Kaya / Appl. Math. Comput. 157 (2004) 93101


1 from with respect to t from 0 to t, i.e., t 1 operator t to (2) yields

95

Rt
0

: dt. Thus, applying the inverse

1 1 L t Lt u Lt 63K1 u 632K2 u M1 u

21M2 u N1 u N2 u Lx ux ; then we have


1 u L t 63K1 u 632K2 u M1 u 21M2 u N1 u N2 u Lx ux :

Since initial value is known and we write the decomposition form of the unknown function ux; t as a sum of components dened by the series P u x ; t 1 n0 un x; t with u0 identied as ux; 0. Then, the nonlinear terms is expanded as follows: K1 u u4
1 X n0

An ; b n; A

K2 u u2 uxx M1 u uu2 x

1 X n0

1 X

M2 u uuxxxx N1 u u2 xx

Bn ; n 0 1 X
n0

b n; B

1 X n0

Cn ; b n; C

N2 u ux uxxx

1 X n0

b n , Bn , B b n are the appropriate Adomians polynob n , Cn , and C where the An , A mials are derived from the general form of Adomian polynomial given in [9,11]. It turns out that Adomians polynomials are only depend on u0 ; u1 ; . . . ; un . A0 u 4 0; A1 4 u3 0 u1 ;
2 3 A2 6 u2 0 u 1 4u0 u2 ; 2 3 A3 4 u 0 u 3 1 16u0 u1 u2 4u0 u3 ;

96

S.M. El-Sayed, D. Kaya / Appl. Math. Comput. 157 (2004) 93101

b 0 u2 u0 ; A 0 xx b A 1 2u0 u1 u0 xx u2 0 u1 xx ; 2 b A 2 2u0 u2 u0 xx u2 1 u0 xx 2u0 u1 u1 xx u0 u2 xx ; b 3 2u0 u3 u0 2u1 u2 u0 u3 u0 2u0 u2 u1 2u0 u1 u2 u2 u3 ; A 1 0 x x x x x x 7 B0 u 0 u 2 0x ; B1 2u0 u0x u1x u1 u2 0x ;
2 B2 2u0 u0x u2x u0 u2 1x 2u1 u0x u1x u2 u0x ; 2 B3 2u0 u0x u3x 2u0 u1x u2x u0 u3 1x 2u1 u0x u2x 2u2 u0x u1x u3 u0x ;

b 0 u0 u0 ; B 4x b B 1 u1 u0 4x u0 u1 4x ; b 2 u2 u0 u1 u1 u0 u2 ; B 4x 4x 4x b B 3 u3 u0 4x u2 u1 4x u1 u2 4x u0 u3 4x ; C0 u2 0xx ; C1 2u0xx u1xx ; C2 2u0xx u2xx u2 1xx ; C3 2u0xx u3xx 2u1xx u2xx ; b 0 u0x u0 ; C 3x b C 1 u1x u03x u0x u13x ; b 2 u2x u0 u1x u1 u0x u2 ; C 3x 3x 3x b C 3 u3x u03x u2x u13x u1x u23x u0x u33x :

10

11

The remaining components un x; t, n P 0, can be completely determined such that each term is computed by using the previous term. Since u0 is known (u0 identied as ux; 0), we get
1 b b b un1 L t 63An 632 A n Bn 21 B n Cn C n Lx un x ;

n P 0: 12

Furthermore, based on the ADM, we constructed the solution ux; t as


n!1

lim /n ux; t;

where /n x; t

n X k 0

uk x ; t ;

nP0

13

and the recurrence relation is given as in (12) with (6)(11).

S.M. El-Sayed, D. Kaya / Appl. Math. Comput. 157 (2004) 93101

97

We should note that while An is a polynomial in u1 ; u0 ; . . . ; un , its dependence on u0 . However, generally, An depends only on u0 ; u1 ; . . . ; un , so that (12) allows successive calculation of un , P n 0; 1; . . . At any stage, the solution can be n1 approximated by the partial 0 ui . Various papers claim general proofs of the convergence of the Adomians series to a solution of the nonlinear equation; see for example [1216].

3. Examples Example 1. We will begin with sSk equation (1) with the initial condition by ux; 0 4k 2 2 3 tanh2 kx: 3 14

Since initial value is known and decompose the unknown function ux; t a sum of components dened by the decomposition series (13) with u0 identied P1 as ux; 0. The decomposition series solution ux; t into n0 un x; t in (12) with Adomian polynomials (6)(11) yield the term-by-term components u0 u1 4k 2 2 3 tanh2 kx; 3 8k 9 t sech9 kx8693 sinhkx 3555 sinh3kx 3 127 sinh5kx 25 sinh7kx; 4k 16 t2 sech16 kx398808041952 556622577051 cosh2kx 9 184622580272 cosh4kx 26701489793 cosh6kx 1361948960 cosh8kx 11574643 cosh10kx 75056 cosh12kx 625 cosh14kx;
u3 4k 23 t3 sech23 kx1617457712600525814364 sinhkx 81 970616064835694030126 sinh3kx 344533655047850955582 sinh5kx 70122192655231331448 sinh7kx 7754478303923866872 sinh9kx 426234941766005259 sinh11kx 9989184865723779 sinh13kx 73789452553658 sinh15kx 68357780602 sinh17kx 23498993 sinh19kx 15625 sinh21kx;

15

16

u2

17

18

98

S.M. El-Sayed, D. Kaya / Appl. Math. Comput. 157 (2004) 93101

and so on, in this manner the rest of components of the decomposition series were obtained. Substituting (15)(18) into (13) gives the solution ux; t in a series form and in a close form by [2]     4k 2 256k 6 2 ux; t 2 3 tanh k x t : 3 3 This result can be veried through substitution. Example 2. For further comparison of the ADM, we consider the LsKdV equation [2] Eq. (2) with initial condition is given by ux; 0 2k 2 sech2 kx: 19

The solution of this equation, we simply taken the equation in the form of Eq. (3) and using the initial value ux; 0 (19) to obtain the zeroth component of u0 2k 2 sech2 kx and obtained in succession u1 ; u2 ; u3 etc., by using (12) with (6)(11) to nd the other terms of the decomposition series, we get u1 4k 9 t sech9 kx14499 sinhkx 4293 sinh3kx 247 sinh5kx sinh7kx; u2 2k 16 t2 sech16 kx210580297696 293697852491 cosh2kx 97612844688 cosh4kx 14458435281 cosh6kx 829736352 cosh8kx 13824739 cosh10kx 32752 cosh12kx cosh14kx; u3 2k 23 t3 sech23 kx284790404510368316676 sinhkx 3 171001453092368025090 sinh3kx 60802940814868308210 sinh5kx 12426070812063854280 sinh7kx 1387180402150831176 sinh9kx 77924703621979341 sinh11kx 1925939885734485 sinh13kx 16570761701590 sinh15kx 31284590870 sinh17kx 4194281 sinh19kx sinh21kx; 22 21

20

and so on, in this manner the rest of components of the decomposition series were obtained. Substituting the value of u0 2k 2 sech2 kx and (20)(22) into (13) gives the solution ux; t in a series form and in a close form by ux; t 2k 2 sech2 k x 64k 6 t which can be easily veried.

S.M. El-Sayed, D. Kaya / Appl. Math. Comput. 157 (2004) 93101

99

4. Numerical experiments In this section, we consider the sSK and LsKdV equations for numerical comparisons. Based on the ADM, we constructed the solution ux; t as (13) and the recurrence relation is given as in (12). We will demonstrate how the approximate solutions of the sSK and LsKdV equations are close to exact solutions. In order to verify numerically whether the proposed methodology lead to higher accuracy, we can evaluate the numerical solutions using the n-term approximation (12). Tables 1 and 2 show the dierence of the analytical solution and numerical solution of the absolute errors. The graphs of the analytic and approximate solutions are depicted in Figs. 1 and 2, respectively. It is to be note that 5 terms only were used in evaluating the approximate solutions. We achieved a very good approximation with the actual solution of the equations by using 5 terms only of the decomposition derived above. An improved approximation is easy to achieve if more terms of the decomposition are employed. It is evident that the overall errors can be made smaller by adding new terms of the decomposition series (13). Numerical approximations show a high degree of accuracy and in most cases /n , the n-term approximation is accurate for quite low values of n. The solutions are very rapidly convergent by utilizing the ADM. The numerical

Table 1 The numerical results for /n x; t in comparison with the analytical solution ux; t 4k 2 k7 2 3 tanh2 kx 256 t when k 0:1, for the solution of Eq. (1) 3 3 ti =xi 0.1 0.2 0.3 0.4 0.5 0.1 6.61289E)09 1.38091E)08 2.10236E)08 2.82628E)08 3.55331E)08 0.2 1.30572E)08 2.74896E)08 4.19330E)08 5.64022E)08 7.09127E)08 0.3 2.20865E)08 4.37197E)08 6.52333E)08 8.66610E)08 1.08043E)07 0.4 3.82381E)08 6.68601E)08 9.49483E)08 1.22581E)07 1.49860E)07 0.5 6.78327E)08 1.02954E)07 1.36620E)07 1.69003E)07 2.00334E)07

Table 2 The numerical results for /n x; t in comparison with the ux; t 2k 2 sech2 kx 64k 7 t when k 0:1, for the solution of Eq. (2) ti =xi 0.1 0.2 0.3 0.4 0.5 0.1 1.31265E)08 2.46564E)08 3.60575E)08 4.72723E)08 5.82447E)08 0.2 2.69869E)08 4.99471E)08 7.27082E)08 9.51513E)08 1.17157E)07 0.3 3.50406E)08 6.95085E)08 1.03998E)07 1.38303E)07 1.72205E)07 0.4

analytical 0.5

solution

2.65114E)08 7.29819E)08 1.20366E)07 1.68309E)07 2.16406E)07

1.36124E)08 4.60129E)08 1.08644E)07 1.73664E)07 2.40318E)07

100

S.M. El-Sayed, D. Kaya / Appl. Math. Comput. 157 (2004) 93101

Fig. 1. The numerical results for /7 x; t: (a) for k 0:1 in comparison with the analytical solutions ux; t, (b) for the solution with the initial condition (14) of Eq. (1).

Fig. 2. The numerical results for /7 x; t: (a) for k 0:1 in comparison with the analytical solutions ux; t, (b) for the solution with the initial condition of Eq. (19).

results we obtained justify the advantage of this methodology, even in the few terms approximation is accurate.

5. Conclusion In this paper, the Adomian decomposition method has been extended to solving both sSK and LsKdV equations. It may be concluded that, with regard to this application the decomposition method outlined in the previous section nds quite practical analytic results with less computational work. The numerical results shows that the ADM algorithm provides highly accurate numerical solutions. Furthermore, as the decomposition method does not require discretization of the variables, i.e. time and space, it is not eected by computation round o errors and one is not faced with necessity of large computer memory and time. Also, it is important to point out that even if the problem is nonlinear this method does not require linearization or perturbation and it does not make closure approximation or smallness assumptions. It is also

S.M. El-Sayed, D. Kaya / Appl. Math. Comput. 157 (2004) 93101

101

worth noting that the advantage of the decomposition methodology displays a fast convergence of the solutions. The illustrations show the dependence of the rapid convergence depend on the character and behavior of the solutions just as in a closed form solutions. Finally, we point out that, for given equations with initial values ux; 0, the corresponding analytical and numerical solutions are obtained according to the recurrence relations (10) using Mathematica.

References
[1] W. Hereman, P.P. Banerjee, A. Korpel, G. Assanto, A. van Immerzeele, A. Meerpoel, Exact solitary wave solutions of nonlinear evolution and wave equations using a direct algebraic method, J. Phys. A: Math. Gen. 19 (1986) 607628. [2] E.J. Parkes, B.R. Duy, An automated tanh-function method for nding solitary wave solutions to non-linear evolution equations, Comput. Phys. Commun. 98 (1996) 288300. [3] D. Kaya, On the solution of a Korteweg-de Vries like equation by the decomposition method, Int. J. Comput. Math. 72 (1999) 531539. [4] D. Kaya, I.E. Inan, On the SawadaKotare equation, J. Inst. Math. Comput. Sci. 14 (2001) 117119. [5] D. Kaya, M. Aassila, An application for a generalized KdV equation by decomposition method, Phys. Lett. A 299 (2002) 201206. [6] D. Kaya, An explicit and numerical solutions of some fth-order KdV equation by decomposition method, Appl. Math. Comput. 144 (2003) 353363. [7] D. Kaya, Salah M. El-Sayed, An application of the decomposition method for the generalized KdV and RLW equations, Chaos Solitons Fract. 17 (2003) 869877. [8] D. Kaya, Salah M. El-Sayed, On a generalized fth order KdV equations, Phys. Lett. A 310 (2003) 4451. [9] G. Adomian, Solving Frontier Problems of Physics: The Decomposition Method, Kluwer Academic Publishers, Boston, MA, 1994. [10] G. Adomian, A review of the decomposition method in applied mathematics, J. Math. Anal. Appl. 135 (1988) 501544. [11] A.M. Wazwaz, A new algorithm for calculating Adomian polynomials for nonlinear operators, Appl. Math. Comput. 111 (2000) 5369. [12] V. Seng, K. Abbaoui, Y. Cherruault, Adomians polynomials for nonlinear operators, Math. Comput. Modell. 24 (1996) 5965. [13] K. Abbaoui, Y. Cherruault, Convergence of Adomians method applied to dierential equations, Comput. Math. Appl. 28 (1994) 103109. [14] K. Abbaoui, Y. Cherruault, New ideas for proving convergence of decomposition methods, Comput. Math. Appl. 29 (1995) 103108. [15] K. Abbaoui, M.J. Pujol, Y. Cherruault, N. Himoun, P. Grimalt, A new formulation of Adomian method: convergence result, Kybernetes 30 (2001) 11831191. [16] N. Ngarhasta, B. Some, K. Abbaoui, Y. Cherruault, New numerical study of Adomian method applied to a diusion model, Kybernetes 31 (2002) 6175.

You might also like