7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Editorial
Invited review
Letter to the Editor
Original Article
REVIEW
Review Article
SHORT COMMUNICATION
7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Editorial
Invited review
Letter to the Editor
Original Article
REVIEW
Review Article
SHORT COMMUNICATION
View/Download PDF

Translate this page into:

ORIGINAL ARTICLE
23 (
4
); 407-411
doi:
10.1016/j.jksus.2010.07.023

Application of He's variational iteration method for solution of the family of Kuramoto–Sivashinsky equations

Department of Mathematics, Faculty of Science Islamic Azad University, Takestan Branch, Iran

*Corresponding author m_gholami_p@yahoo.com (Mehdi Gholami Porshokouhi),

Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Available online 30 July 2010

Peer-review under responsibility of King Saud University.

Abstract

In this paper, a kind of analytical technique for a non-linear problem called the variational iteration method VIM is used to give approximate solutions for the Kuramoto–Sivashinsky equations. The VIM is to construct correction functionals using general Lagrange multipliers identified optimally via the variational theory. This method constructs a convergent sequence of functions, which approximates the exact solution of problems. Comparisons of the obtained results with exact solutions reveal that this method is very effective and simple and could be applied for non-linear problems.

Keywords

He's variational iteration method
Kuramoto–Sivashinsky equations
1

1 Introduction

In recent years, He's variational iteration method has been favorably applied to various kinds of problems; for example, this scheme is used for solving the fractional KdV–Burgers–Kuramoto equation (Safari et al., 2009). This technique computes the exact solution of equations using the initial condition only. It is also important to note that the present method does not require discretization of the equation. Therefore, it is not affected by computation round-off errors and one is not faced with the necessity of large computer memory and time. Furthermore, using this idea we do not need to solve any linear or non-linear system of equations. In Biazar and Ghazvini (2007) VIM is employed to solve fourth-order parabolic equations. Also, this method is employed in He (1997b) to solve delay differential equations. The interested reader is referred to Dehghan and Tatari (2006), Wazwaz (2007), Sweilam and Khader (2007) for some other applications of the method.

The Kuramoto–Sivashinsky equation is a non-linear evolution equation and has many applications in a variety of physical phenomena such as reaction diffusion systems (Kuramoto and Tsuzuki, 1976), long waves on the interface between two viscous fluids (Hooper and Grimshaw, 1985) and thin hydrodynamics films (Sivashinsky, 1983). The Kuramoto–Sivashinsky equation has been studied numerically by many authors (Akrivis and Smyrlis, 2004; Manickam et al., 1998; Uddin et al., 2009).

Consider the Kuramoto–Sivashinsky equation

(1)
u t + u u x + α 2 u x 2 + γ 3 u x 3 + β 4 u x 4 = 0 .

Subject to the initial condition

(2)
u ( x , 0 ) = f ( x ) , a x b .

And boundary conditions u ( a , t ) = g 1 ( t ) , u ( b , t ) = g 2 ( t ) , t > 0 .

In this paper we use VIM for solving this equation, which was first proposed by He (1997a), and the convergence of the method is systematically discussed by Tatari and Dehghan (2007).

2

2 Using VIM to solve Kuramoto–Sivashinsky equations

To clarify the basic ideas of VIM, we consider the following differential equation Lu ( t ) + Nu ( t ) = g ( t ) , where L is a linear operator, N is a non-linear operator and g(t) an inhomogeneous term.

According to VIM, we can write down a correction functional as following u n + 1 ( t ) = u n ( t ) + 0 t λ ( ξ ) ( Lu n ( ξ ) + N u ˜ n ( ξ ) - g ( ξ ) ) d ξ . where λ is a Lagrange multiplier which could be identified optimally via variational theory, u n is the nth approximate solution, and u ˜ n denotes a restricted variation, i.e. δ u ˜ n = 0 .

In this section the application of the VIM is discussed for solving Eq. (1). According to the correction functional in t – direction in the following form u n + 1 ( x , t ) = u n ( x , t ) + 0 t λ ( ξ ) u n ( x , ξ ) ξ + u ˜ n ( x , ξ ) u ˜ n ( x , ξ ) x + α 2 u ˜ n ( x , ξ ) x 2 + γ 3 u ˜ n ( x , ξ ) x 3 + β 4 u ˜ n ( x , ξ ) x 4 d ξ .

Taking the variation with respect to the independent variable u n and noticing that δ u n ( 0 ) = 0 , we get δ u n + 1 = δ u n + λ δ u n | ξ = t - 0 t λ δ u n d ξ = 0 .

Then we apply the following stationary conditions: λ ( ξ ) | ξ = t = 0 , 1 + λ ( ξ ) | ξ = t = 0 .

The general Lagrange multiplier, therefore, could be readily identified: λ = - 1 .

And as result, we obtain the following iteration formula u n + 1 ( x , t ) = u n ( x , t ) - 0 t u n ( x , ξ ) ξ + u n ( x , ξ ) u n ( x , ξ ) x + α 2 u n ( x , ξ ) x 2 + γ 3 u n ( x , ξ ) x 3 + β 4 u n ( x , ξ ) x 4 d ξ .

We start with the initial approximation of u ( x , 0 ) given by Eq. (2). Using the above iteration formula, we can obtain the other components as follows u 0 ( x , t ) = u ( x , 0 ) = f ( x ) , u 1 ( x , t ) = u 0 ( x , t ) - 0 t u 0 ( x , ξ ) ξ + u 0 ( x , ξ ) u 0 ( x , ξ ) x + α 2 u 0 ( x , ξ ) x 2 + γ 3 u 0 ( x , ξ ) x 3 + β 4 u 0 ( x , ξ ) x 4 d ξ , u 2 ( x , t ) = u 1 ( x , t ) - 0 t u 1 ( x , ξ ) ξ + u 1 ( x , ξ ) u 1 ( x , ξ ) x + α 2 u 1 ( x , ξ ) x 2 + γ 3 u 1 ( x , ξ ) x 3 + β 4 u 1 ( x , ξ ) x 4 d ξ ,

3

3 Numerical results

In this section, we apply the technique discussed in the previous section to find numerical solution of the family of Kuramoto–Sivashinsky equations and compare our results with exact solutions. The results reveal that this method is very effective and simple.

Example 1

Consider the Kuramoto–Sivashinsky equation u t + u u x + 2 u x 2 + 4 u x 4 = 0 .

With initial condition u ( x , 0 ) = c + 5 19 11 19 11 tanh 3 k ( x - x 0 ) - 9 tanh k ( x - x 0 ) .

Exact solution of problem is given by

(3)
u ( x , t ) = c + 5 19 11 19 11 tanh 3 ( k ( x - ct - x 0 ) ) - 9 tanh ( k ( x - ct - x 0 ) ) .

For solving by VIM we obtain the recurrence relation

(4)
u n + 1 ( x , t ) = u n ( x , t ) - 0 t u n ( x , ξ ) ξ + u n ( x , ξ ) u n ( x , ξ ) x + 2 u n ( x , ξ ) x 2 + 4 u n ( x , ξ ) x 4 d ξ .

Starting with the initial approximation u 0 ( x , t ) = u ( x , 0 ) in (4), successive approximations u i ( x , t ) 's will be achieved.

The plot of exact solution (3), the 3th order of approximate solution obtained using the VIM and comparison between the exact and numerical solutions of this example are shown in Fig. 1.

Example 2

Let us have the following form of Kuramoto–Sivashinsky equation u t + u u x - 2 u x 2 + 4 u x 4 = 0 .

With initial condition u ( x , 0 ) = c + 15 19 19 tanh 3 ( k ( x - x 0 ) ) - 3 tanh ( k ( x - x 0 ) ) .

The solution of the above problem is recognized

(5)
u ( x , t ) = c + 15 19 19 tanh 3 ( k ( x - ct - x 0 ) ) - 3 tanh ( k ( x - ct - x 0 ) ) .

For solving by VIM we obtain the recurrence relation

(6)
u n + 1 ( x , t ) = u n ( x , t ) - 0 t u n ( x , ξ ) ξ + u n ( x , ξ ) u n ( x , ξ ) x - 2 u n ( x , ξ ) x 2 + 4 u n ( x , ξ ) x 4 d ξ .

Starting with the initial approximation u 0 ( x , t ) = u ( x , 0 ) in (6), the next iterates u i ( x , t ) ‘s will be obtained.

The plot of exact solution (5), the 3th order of approximate solution obtained using the VIM and comparison between the exact and numerical solutions are shown in Fig. 2.

Example 3

As the last example, we try the case of α = 1 , γ = 4 , β = 1 in (1) as: u t + u u x + 2 u x 2 + 4 3 u x 3 + 4 u x 4 = 0 .

Its exact solution of above problem reads

(7)
u ( x , t ) = c + 9 - 15 tanh ( k ( x - ct - x 0 ) ) + tanh 2 ( k ( x - ct - x 0 ) ) - tanh 3 ( k ( x - ct - x 0 ) ) .

With initial condition u ( x , 0 ) = c + 9 - 15 tanh ( k ( x - x 0 ) ) + tanh 2 ( k ( x - x 0 ) ) - tanh 3 ( k ( x - x 0 ) ) .

For solving by VIM we obtain the recurrence relation

(8)
u n + 1 ( x , t ) = u n ( x , t ) - 0 t u n ( x , ξ ) ξ + u n ( x , ξ ) u n ( x , ξ ) x + 2 u n ( x , ξ ) x 2 + 4 3 u n ( x , ξ ) x 3 + 4 u n ( x , ξ ) x 4 d ξ .

Using the initial approximation u 0 ( x , t ) = u ( x , 0 ) in (8), approximations u i ( x , t ) ‘s will be calculated, successively.

The plot of exact solution (7), the 3th order of approximate solution obtained using the VIM and comparison between the exact and numerical solutions of this example are shown in Fig. 3.

The surface shows the solution u ( x , t ) for Example 1 when c = 0.1 , k = 1 2 11 19 , x 0 = - 10 : (a) exact solution (3), (b) 3th order of approximate solution (4) and (c) the absolute error between exact and numerical solutions.
Figure 1
The surface shows the solution u ( x , t ) for Example 1 when c = 0.1 , k = 1 2 11 19 , x 0 = - 10 : (a) exact solution (3), (b) 3th order of approximate solution (4) and (c) the absolute error between exact and numerical solutions.
The surface shows the solution u ( x , t ) for Example 2 when c = 0.2 , k = 1 2 19 , x 0 = - 10 : (a) exact solution (5), (b) 3th order of approximate solution (6) and (c) the absolute error between exact and numerical solutions.
Figure 2
The surface shows the solution u ( x , t ) for Example 2 when c = 0.2 , k = 1 2 19 , x 0 = - 10 : (a) exact solution (5), (b) 3th order of approximate solution (6) and (c) the absolute error between exact and numerical solutions.
The surface shows the solution u ( x , t ) for Example 3 when c = 3 , k = 1 2 , x 0 = - 10 : (a) exact solution (7), (b) 3th order of approximate solution (8) and (c) the absolute error between exact and numerical solutions.
Figure 3
The surface shows the solution u ( x , t ) for Example 3 when c = 3 , k = 1 2 , x 0 = - 10 : (a) exact solution (7), (b) 3th order of approximate solution (8) and (c) the absolute error between exact and numerical solutions.

4

4 Conclusion

In this paper the He's variational iteration method is used to solve the Kuramoto–Sivashinsky equations. We described the method, used it on three test problems, and compared the results with their exact solutions in order to demonstrate the validity and applicability of the method. Moreover, only a small number of iterations are needed to obtain a satisfactory result. The given numerical examples support this claim.

We use the Maple Package to calculate the functions obtained from the variational iteration method

References

  1. , , . Implicit-explicit BDF methods for the Kuramoto–Sivashinsky equation. Appl. Numer. Math.. 2004;51:151-169.
    [Google Scholar]
  2. , , . He's variational iteration method for fourth-order parabolic equations. Comput. Math. Appl.. 2007;54:1047-1054.
    [Google Scholar]
  3. , , . The use of He's variational iteration method for solving the Fokker–Planck equation. Phys. Scr.. 2006;74:310-316.
    [Google Scholar]
  4. , . A new approach to nonlinear partial differential equations. Commun. Nonlinear Sci. Numer. Simul.. 1997;2(4):203-205.
    [Google Scholar]
  5. , . Variational iteration method for delay differential equations. Commun. Nonlinear Sci. Numer. Simul.. 1997;2(4):235-236.
    [Google Scholar]
  6. , , . Nonlinear instability at the interface between two viscous fluids. Phys. Fluids. 1985;28:37-54.
    [Google Scholar]
  7. , , . Persistent propagation of concentration waves in dissipative media far from thermal equilibrium. Pron. Theor. Phys.. 1976;55:356.
    [Google Scholar]
  8. , , , . Second-order splitting combined with orthogonal cubic spline collocation method for the Kuramoto–Sivashinsky equation. Comput. Math. Appl.. 1998;35:5-25.
    [Google Scholar]
  9. , , , . Application of He's variational iteration method and Adomian's decomposition method to the fractional, KdV–Burgers–Kuramoto equation. Comput. Math. Appl.. 2009;58:2091-2097.
    [Google Scholar]
  10. , . Instabilities, pattern-formation, and turbulence in flames. Ann. Rev. Fluid Mech.. 1983;15:179-199.
    [Google Scholar]
  11. , , . Variational iteration method for one dimensional nonlinear thermo elasticity. Chaos, Solitons Fractals. 2007;32:145-149.
    [Google Scholar]
  12. , , . On the convergence of He's variational iteration method. J. Comput. Appl. Math.. 2007;207:121-128.
    [Google Scholar]
  13. , , , . A mesh-free numerical method for solution of the family of Kuramoto–Sivashinsky equations. Appl. Math. Comput.. 2009;212:458-469.
    [Google Scholar]
  14. , . A comparison between the variational iteration method and Adomian decomposition method. J. Comput. Appl. Math.. 2007;207:129-136.
    [Google Scholar]
Show Sections