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 (
1
); 77-81
doi:
10.1016/j.jksus.2010.06.010

Analytical approach to two-dimensional viscous flow with a shrinking sheet via variational iteration algorithm-II

Modern Textile Institute, Donghua University, 1882 Yan’an Xilu Road, Shanghai 200051, China
Ege University, Science Faculty, Department of Mathematics, 35100 Bornova, Izmir, Turkey

*Corresponding author ahmet.yildirim@ege.edu.tr (Ahmet Yildirim)

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

Available online 18 June 2010

Abstract

The purpose of this paper is to employ an analytical approach to a two-dimensional viscous flow with a shrinking sheet. A comparative study of the variational iteration algorithm-II (VIM-II) and the Adomian decomposition method (ADM) are discussed. Both approaches have been applied to obtain the solution of a two-dimensional viscous flow due to a shrinking sheet. This study outlines the significant features of the two methods. Comparison is made with the ADM to highlight the significant features of the VIM-II and its capability of handling completely integrable equations. Through careful investigation of the iteration formulas of the earlier variational iteration algorithm (VIM), we find unnecessary repeated calculations in each iteration. To overcome this shortcoming, we suggest the VIM-II, which has advantages over other iteration formulas, such as the VIM, and the ADM. Further iterations can produce more accurate results and decrease the error.

Keywords

Adomian decomposition method
Padé approximation
Shrinking sheet
Similarity transforms
Variational iteration algorithm-II
1

1 Introduction

This paper presents a reliable comparison between two recently developed, popular iteration methods, the variational iteration algorithm-II (VIM-II) developed by He et al. (2009) and the Adomian decomposition method (ADM) introduced by Adomian (1988). The use of both methods is common in the literature. The most extensive work carried out on the variational iteration algorithm (VIM) generally is that of He (2000, 2004, 2007, 2008) and He and Lee (2009). Although many researchers have compared the VIM with the ADM, to the best of the authors’ knowledge, no comparison of the VIM-II and the ADM has appeared in the literature thus far. The objectives of this paper are threefold: first, to introduce the advantages of the VIM-II, which primarily lie in its ability to avoid the unnecessary calculations of other iteration methods, namely, the VIM and ADM; second, to illustrate through this comparison that, unlike the widely used ADM, the VIM-II does not require the calculation of Adomian polynomials (Adomian, 1988) for the nonlinear terms that appear in differential equations, as a solution can be obtained without the incorporation of these polynomials; and third, to apply the VIM-II to a fluid mechanics problem, namely, a viscous flow for a shrinking sheet (Fang et al., 2009). An analytical approach is followed to find the numerical value of f″(0), which Wazwaz (2007) has calculated to solve the Blasius equation. This goal is achieved by employing the reliable VIM-II developed by He (2007) and the ADM (Adomian, 1988). For numerical approximation, the resulting series is best manipulated by Padé approximants (Baker, 1975).

2

2 Padé approximants

Padé approximants constitute the best approximation of a function by a rational function of a given order. Developed by Henri Padé, Padé approximants often provide better approximation of a function than does truncating its Taylor Series, and they may still work in cases in which the Taylor series does not converge. For these reasons, Padé approximants are used extensively in computer calculations, and it is now well known that these approximants have the advantage of being able to manipulate polynomial approximation into the rational functions of polynomials. Through such manipulation, we can gain more information about the mathematical behavior of the solution. In addition, power series are not useful for large values of a variable, say η → , which can be attributed to the possibility of the radius of convergence not being sufficiently large to contain the boundaries of the domain. To provide an effective tool that can handle boundary value problems on an infinite or semi-infinite domain, it is therefore essential to combine the series solution, which is obtained by the iteration method or any other series solution method, with the Padé approximants.

3

3 Formulation

In this paper, we consider the two basic equations of fluid mechanics in Cartesian coordinates. The continuity equation and momentum equations for viscous flow are

(1)
u x + v y + w z = 0 ,
(2)
u u x + v u y + w u z = - 1 ρ p x + υ 2 u x 2 + 2 u y 2 + 2 u z 2 ,
(3)
u v x + v v y + w v z = - 1 ρ p y + υ 2 v x 2 + 2 v y 2 + 2 v z 2 ,
(4)
u w x + v w y + w w z = - 1 ρ p x + υ 2 w x 2 + 2 w y 2 + 2 w z 2 ,
where υ = μ ρ is the kinematic viscosity.

The boundary conditions applicable to the present flow are

(5)
u = - ax , v = - a ( m - 1 ) y , w = - W at y = 0 , u 0 as y .

For shrinking phenomena, a > 0, a is a shrinking constant, and W is the suction velocity. m = 1 when the sheet shrinks in the x-direction alone, and m = 2 when it shrinks axisymmetrically. We introduce the following similarity transformations.

(6)
u = axf ( η ) , v = a ( m - 1 ) yf ( η ) , η = a υ z . Eq. (1) is identically satisfied, and Eq. (4) can be integrated to give
(7)
p ρ = υ w z - w 2 2 + Constant.
Eqs. (2), (3), and (5) are reduced to the boundary value problem,
(8)
f - ( f ) 2 + mff = 0 ,
and the corresponding boundary conditions take the form
(9)
f = s , f = - 1 at η = 0 , f 0 as η ,
where s = W / m a υ .

4

4 Methods

4.1

4.1 He’s variational method

To illustrate the basic concept of He’s VIM, we consider the following general differential equation Lf + Nf = g ( x ) , where L is a linear operator, N is a nonlinear operator, and g(x) is the source term. According to the VIM, we can construct a correction functional as follows

(10)
f n + 1 ( x ) = f n ( x ) + 0 x λ ( Lf n ( s ) + N f ˜ ( s ) - g ( s ) ) ds , where λ is a Lagrange multiplier that can be identified through a variational iteration method. The subscript n denotes the nth approximation, and f ˜ n is considered to be a restricted variation, i.e., δ f ˜ n = 0 . The solution of linear problems can be achieved in a single iteration step due to the exact identification of the Lagrange multiplier. This method requires that the Lagrange multiplier λ is first determined optimally. The successive approximation, f n + 1 , n 0 , of the solution f can then be readily obtained by using the Lagrange multiplier determined and any selective function f0; consequently, the solution is given by f = lim n f n . According to the variational iteration method, we can construct a correction functional of Eq. (8) as follows
(11)
f n + 1 ( η ) = f n ( η ) + 0 η λ 3 f n ξ 3 - f n ξ 2 + mf n 2 f n ξ 2 d ξ ,
with λ = - ( ξ - η ) 2 2 , and the initial approximation is f 0 = s - η + α η 2 2 , where f″(0) = α, m = 2, s = 2.

However, according to the VIM-II, the general form of the algorithm takes the following form

(12)
f n + 1 ( η ) = f 0 ( η ) + 0 η λ - f n ξ 2 + 2 f n 2 f n ξ 2 d ξ ,
(13)
f n + 1 ( η ) = f 0 ( η ) + 0 η ( ξ - η ) 2 2 f n ξ 2 - 2 f n 2 f n ξ 2 d ξ , and
consequently, the following approximants are obtained.
(14)
f 0 = 2 - η + α η 2 2 ,
(15)
f 1 = 2 - η + α η 2 2 - η 3 6 + 2 α η 3 3 ,
(16)
f 2 = 2 - η + α η 2 2 + ( - 1 + 4 α ) η 3 6 + ( - 2 + 5 α ) η 4 12 + ( 4 - 16 α + 9 α 2 ) η 5 60 + 4 α ( - 1 + 4 α ) η 6 45 + 4 ( 1 - 4 α ) 2 η 7 315 ,
(17)
f 3 = 2 - η + α η 2 2 + ( - 1 + 4 α ) η 3 6 + ( - 1 + 4 α ) η 4 6 + ( - 7 + 16 α ) η 5 60 + ( 24 - 85 α + 40 α 2 ) η 6 360 + ( - 23 - 52 α + 504 α 2 ) η 7 2520 + ( 74 - 425 α + 516 α 2 + 54 α 3 ) η 8 10080 ( - 164 + 1432 α - 3433 α 2 + 1676 α 3 ) η 9 90720 + ( - 56 + 556 α - 2222 α 2 + 3387 α 3 ) η 10 151200 ( - 80 + 2304 α - 12744 α 2 + 19232 α 3 + 567 α 4 ) η 11 10080 + ( - 26 + 217 α - 488 α 2 + 18 α 3 + 504 α 4 ) η 12 311850 + ( 1 - 4 α ) 2 ( 108 - 432 α - 691 α 2 ) η 13 4054050 + 8 α ( - 1 + 4 α ) 3 η 14 257985 + 8 ( 1 - 4 α ) 4 η 15 3869775
It is quite clear that only three iterations are needed to obtain approximation f3(η). Other methods require many more iterations to obtain this result. Fewer calculations are also involved with the VIM-II.

4.2

4.2 Adomian decomposition method

A detailed description of the ADM is given in Adomian (1988). Here, we provide only the basic steps as a reminder. Writing Eq. (8) in operator form, we have

(18)
Lf ( η ) + Rf ( η ) + Nf ( η ) = 0 , where L is the linear operator, i.e., Lf = d 3 f d η 3 , which is the highest order derivative; R = 0; and
(19)
Nf = df d η 2 - mf d 2 f df 2 .
The linear operator is also the inverse operator, i.e.,
(20)
L - 1 ( · ) = 0 η 0 η 0 η ( · ) d η d η d η .
The ADM defines the unknown function, f(η), by an infinite series:
(21)
f ( η ) = η = 0 f n ( η ) ,
where the components fn(η) are usually determined recurrently. The nonlinear operator, G(f), can be decomposed into infinite polynomials given by
(22)
G ( f ) = m n = 0 A n ,
where An are the so-called Adomian polynomials of f0, f1, f2,…,fn defined by
(23)
A n = 1 n ! d n d λ n G i = 0 n λ i f i λ = 0 , n = 0 , 1 , 2 , . . . ,
or, equivalently,
(24)
A 0 = G ( f 0 ) , A 1 = f 1 G ( f 0 ) , A 2 = f 2 G ( f 0 ) + 1 2 f 1 2 G ( f 0 ) , A 3 = f 3 G ( f 0 ) + f 1 f 2 G ( f 0 ) + 1 3 f 1 3 G ( f 0 ) , A 4 = f 4 G ( f 0 ) + f 1 f 3 + 1 2 f 2 2 G ( f 0 ) + 1 2 f 1 2 f 2 G ( f 0 ) + 1 24 f 1 4 G iv ( f 0 ) .
It is now well known that these polynomials can be generated for all classes of nonlinearity according to specific algorithms.

Write the general algorithm of Eq. (8) with the initial approximation mentioned in Eq. (14)

(25)
f n + 1 ( η ) = 0 η 0 η 0 η n = 0 A n - 2 n = 0 B n d η d η d η n = 0 , 1 , 2 , where
(26)
A 0 = ( f 0 ) , 2 A 1 = 2 f 0 f 1 , A 2 = 2 f 0 f 2 + f 1 f 1 , A 2 = 2 f 0 f 3 + f 1 f 2 .
Similarly,
(27)
B 0 = f 0 f 0 , B 1 = f 0 f 1 + f 1 f 0 , B 2 = f 0 f 2 + f 1 f 2 + f 2 f 1 , B 3 = f 0 f 3 + f 1 f 2 + f 2 f 1 + f 3 f 0 .
After successive iterations, we obtain the following results
(28)
f 0 = 2 - η + α η 2 2 ,
(29)
f 1 = η 3 6 - 2 α η 3 3 ,
(30)
f 2 = - η 4 6 + 2 α η 4 3 + η 5 60 - α η 5 15 + α η 6 360 - α 2 η 6 90 ,
(31)
f 3 = 2 η 5 15 - 8 α η 5 15 - η 6 30 + 2 α η 6 15 + η 7 504 - α η 7 315 - 2 α 2 η 7 105 - α η 8 5040 + α 2 η 8 1260 - α 2 η 9 9072 + α 3 η 9 2268 ,
(32)
f 4 = - 4 η 6 45 + 16 α η 6 45 + 4 η 7 105 - 16 α η 7 105 - η 8 360 - α η 8 126 + 8 α 2 η 8 105 - η 9 90720 + 37 α η 9 11340 - 73 α 2 η 9 5670 - 47 α η 10 30400 + 37 α 2 η 10 56700 - α 3 η 10 8100 - α 2 η 11 178200 + α 3 η 11 44550 + α 3 η 12 213840 - α 4 η 12 53460 ,
and so on. In this manner, the remainder of the terms in the decomposition series (21) can be calculated.

The series solution is given by

(33)
f = f 0 + f 1 + f 2 + f 3 + f 4 + , Substituting Eqs. (27)–(32) into Eq. (33), we obtain the following series solution
(34)
f ( η ) = 2 - η + α η 2 2 + η 3 6 - 2 α η 3 3 - η 4 6 + 2 α η 4 3 + 3 η 5 20 - 3 α η 5 5 - 11 η 6 90 + 59 α η 6 120 - α 2 η 6 90 + 101 η 7 2520 - 7 α η 7 45 - 2 α 2 η 7 105 - η 8 360 - 41 α η 8 5040 + 97 α 2 η 8 1260 - η 9 90720 + 37 α η 9 11340 - 589 α 2 η 9 45360 + α 3 η 9 2268 - 47 α η 10 302400 + 37 α 2 η 10 56700 - α 3 η 10 8100 - α 2 η 11 178200 + α 3 η 11 44550 + α 3 η 12 213840 - α 4 η 12 53460 +
Software packages such as Mathematica or Maple can be used to solve the polynomial f′(η) to calculate the value of α with the help of boundary condition f′(η) → 0 for η → . By using the table above, we can choose the value of α = f′(η) → 0 = 0.249243 for both solutions, which is an average value of [5/5] Padé approximation (Table 1).
Table 1 The numerical values for f″(0) = α using Padé approximation.
Padé approximation f″(0) = α for ADM f″(0) = α for AVIM
[1/1] 0.292893 0.224748
[2/2] Complex number Complex number
[3/3] Complex number 0.294748
[4/4] 0.247723 0.308086
[5/5] 0.24893 0.249556

The result of VIM and ADM solutions are depicted in Figs. 1 and 2. Fig. 3 compares the two solutions.

Graphical presentation of VIM solution.
Figure 1
Graphical presentation of VIM solution.
Graphical presentation of Adomian solution.
Figure 2
Graphical presentation of Adomian solution.
Comparison of the VIM solution and the Adomian solution.
Figure 3
Comparison of the VIM solution and the Adomian solution.

5

5 Conclusion

This paper presents a variational iteration method, the VIM-II, that can be employed to solve nonlinear differential equations. The method is applied here in a direct manner without the use of linearization, transformation, discretization, perturbation, or restrictive assumptions. The proposed algorithm’s ability to solve nonlinear problems without the use of Adomian polynomials is evidence of its clear advantage over the decomposition method. This study has considered only an axisymmetrically shrinking sheet by taking m = 2.

Acknowledgement

The work described in this paper was fully supported by Modern Textile Institute, Donghua University, 1882 Yan’an Xilu Road, Shanghai 200051, China.

References

  1. , . A review of the decomposition method in applied mathematics. J. Math. Anal. Appl.. 1988;135:501-544.
    [Google Scholar]
  2. , . Essentials of Padé Approximants. London: Academic Press; .
  3. Fang, T., Yao, S., Zhang, J., Aziz, A., 2009. Viscous flow over a shrinking sheet with a second order slip flow model. Commun. Nonlinear Sci. Numer. Simul., doi:10.1016/j.cnsns.2009.07.017.
  4. , . Variational iteration method for autonomous ordinary differential systems. Appl. Math. Comput.. 2000;114:115-123.
    [Google Scholar]
  5. , . Variational principles for some nonlinear partial differential equations with variable coefficients. Chaos Solitions Fract.. 2004;19:847-851.
    [Google Scholar]
  6. , . Variational iteration method: some recent results and new interpretations. J. Comput. Appl. Math.. 2007;207:3-17.
    [Google Scholar]
  7. , . Erratum to: variational principle for two-dimensional incompressible inviscid flow. Phys. Lett. A. 2008;372:5858-5859.
    [Google Scholar]
  8. , , . A constrained variational principle for heat conduction. Phys. Lett. A. 2009;373:2614-2615.
    [Google Scholar]
  9. , , , . The variational iteration method which should be followed. Nonlinear Sci. Lett. A. 2009;1:1-30.
    [Google Scholar]
  10. , . The variational iteration method for solving two forms of Blasius equation on a half-infinite domain. Appl. Math. Comput.. 2007;188:485-491.
    [Google Scholar]
Show Sections