Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2013, Article ID 634670, 9 pages http://dx.doi.org/10.1155/2013/634670 Research Article Convergence of Variational Iteration Method for Second-Order Delay Differential Equations Hongliang Liu, Aiguo Xiao, and Lihong Su Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education, Xiangtan University, Xiangtan, Hunan 411105, China Correspondence should be addressed to Hongliang Liu; lhl@xtu.edu.cn Received 24 October 2012; Revised 17 December 2012; Accepted 17 December 2012 Academic Editor: Changbum Chun Copyright © 2013 Hongliang Liu et al. 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. This paper employs the variational iteration method to obtain analytical solutions of second-order delay differential equations. The corresponding convergence results are obtained, and an effective technique for choosing a reasonable Lagrange multiplier is designed in the solving process. Moreover, some illustrative examples are given to show the efficiency of this method. 1. Introduction 2. Convergence The second-order delay differential equations often appear in the dynamical system, celestial mechanics, kinematics, and so forth. Some numerical methods for solving secondorder delay differential equations have been discussed, which include π-method [1], trapezoidal method [2], and RungeKutta-NystroΜm method [3]. The variational iteration method (VIM) was first proposed by He [4, 5] and has been extensively applied due to its flexibility, convenience, and efficiency. So far, the VIM is applied to autonomous ordinary differential systems [6], pantograph equations [7], integral equations [8], delay differential equations [9], fractional differential equations [10], the singular perturbation problems [11], and delay differential-algebraic equations [12]. Rafei et al. [13] and Marinca et al. [14] applied the VIM to oscillations. Tatari and Dehghan [15] consider the VIM for solving second-order initial value problems. For a more comprehensive survey on this method and its applications, the readers refer to the review articles [16–19] and the references therein. But the VIM for second-order delay differential equations has not been considered. The article apply the VIM to second-order delay differential equations to obtain the analytical or approximate analytical solutions. The corresponding convergence results are obtained. Some illustrative examples confirm the theoretical results. 2.1. The First Kind of Second-Order Delay Differential Equations. Consider the initial value problems of second-order delay differential equations π¦σΈ σΈ (π‘) = π (π‘, π¦ (π‘) , π¦ (πΌ (π‘))) , π¦σΈ (π‘) = πσΈ (π‘) , π¦ (π‘) = π (π‘) , π‘ ∈ [0, π] , π‘ ∈ [−π, 0] , (1) π‘ ∈ [−π, 0] , where π(π‘) is a differentiable function, πΌ(π‘) ∈ πΆ1 [0, π] is a strictly monotone increasing function and satisfies that −π ≤ πΌ(π‘) ≤ π‘ and πΌ(0) = −π, there exists π‘1 ∈ [0, π] such that πΌ(π‘1 ) = 0, and π : π· = [0, π] × π × π → π is a given continuous mapping and satisfies the Lipschitz condition σ΅© σ΅© σ΅© σ΅©σ΅© σ΅©σ΅©π (π‘, π’1 , π£) − π (π‘, π’2 , π£)σ΅©σ΅©σ΅© ≤ π½0 σ΅©σ΅©σ΅©π’1 − π’2 σ΅©σ΅©σ΅© , σ΅©σ΅© σ΅© σ΅© σ΅© σ΅©σ΅©π (π‘, π’, π£1 ) − π (π‘, π’, π£2 )σ΅©σ΅©σ΅© ≤ π½1 σ΅©σ΅©σ΅©π£1 − π£2 σ΅©σ΅©σ΅© , (2) where π½0 , π½1 are Lipschitz constants; β⋅β denotes the standard Euclidean norm. 2 Journal of Applied Mathematics Now the VIM for (1) can read Moreover, the general Lagrange multiplier π¦π+1 (π‘) π (π‘, π) = π − π‘ = π¦π (π‘) π‘ σΈ σΈ + ∫ π (π‘, π) [π¦π (π)− πΜ (π, π¦π (π) , π (πΌ (π)))] ππ, (3) 0 (8) can be readily identified by (7). Thus, the variational iteration formula can be written as π¦π+1 (π‘) = π¦π (π‘) 0 < π‘ < π‘1 ; π‘ σΈ σΈ + ∫ (π − π‘) [π¦π (π) − π (π, π¦π (π) , π (πΌ (π)))] ππ, π¦π+1 (π‘) 0 0 < π‘ < π‘1 ; = π¦π (π‘) π‘1 σΈ σΈ + ∫ π (π‘, π) [π¦π (π) − πΜ (π, π¦π (π) , π (πΌ (π)))] ππ (9) 0 π‘ σΈ σΈ π (π‘, π) [π¦π +∫ π‘1 π¦π+1 (π‘) (π) − πΜ (π, π¦π (π) , π¦π (πΌ (π)))] ππ, = π¦π (π‘) π‘1 π‘ > π‘1 , (4) where π¦π (π‘) = π(π‘) for π‘ ∈ [−π, 0]; πΜ denotes the restrictive variation, that is, πΏπΜ = 0. Thus, we have σΈ σΈ + ∫ (π − π‘) [π¦π (π) − π (π, π¦π (π) , π (πΌ (π)))] ππ 0 π‘ σΈ σΈ + ∫ (π − π‘) [π¦π (π) − π (π, π¦π (π) , π¦π (πΌ (π)))] ππ, π‘1 π‘ > π‘1 . (10) πΏπ¦π+1 (π‘) = πΏπ¦π (π‘) π‘ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) − πΜ (π, π¦π (π) , π (πΌ (π)))] ππ (5) 0 π‘ σΈ σΈ = πΏπ¦π (π‘) + ∫ πΏπ (π‘, π) π¦π (π) ππ, 0 0 < π‘ < π‘1 . Theorem 1. Suppose that the initial value problems (1) satisfy the condition (2), and π¦(π‘), π¦π (π‘) ∈ πΆ2 [0, π], π = 1, 2, . . . . Then the sequence {π¦π (π‘)}∞ π=1 defined by (9) and (10) with π¦0 (π‘) converges to the solution of (1). Proof. From (1), we have π‘ π¦ (π‘) = π¦ (π‘) + ∫ (π − π‘) [π¦σΈ σΈ (π) − π (π, π¦ (π) , π (πΌ (π)))] ππ, Using integration by parts to (4), we have 0 πΏπ¦π+1 (π‘) 0 < π‘ < π‘1 ; = πΏπ¦π (π‘) (11) π‘1 σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) − πΜ (π, π¦π (π) , π (πΌ (π)))] ππ π‘1 π¦ (π‘) = π¦ (π‘) + ∫ (π − π‘) [π¦σΈ σΈ (π) − π (π, π¦ (π) , π (πΌ (π)))] ππ 0 π‘ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) − πΜ (π, π¦π (π) , π¦π (πΌ (π)))] ππ π‘1 π‘ > π‘1 . σ΅¨σ΅¨ π‘ 2 π π (π‘, π) ππ (π‘, π) σ΅¨ πΏπ¦π (π) ππ. πΏπ¦π (π)σ΅¨σ΅¨σ΅¨ + ∫ σ΅¨σ΅¨π=π‘ ππ ππ2 0 (12) (6) From the above formula, the stationary conditions are obtained as 2 π π (π‘, π) = 0, ππ2 ππ (π‘, π) σ΅¨σ΅¨σ΅¨σ΅¨ 1− σ΅¨ = 0, ππ σ΅¨σ΅¨σ΅¨π=π‘ σ΅¨ π (π‘, π)σ΅¨σ΅¨σ΅¨π=π‘ = 0. + ∫ (π − π‘) [π¦σΈ σΈ (π) − π (π, π¦ (π) , π¦ (πΌ (π)))] ππ, π‘1 σ΅¨ σΈ = πΏπ¦π (π‘) + πΏπ (π‘, π) π¦π (π)σ΅¨σ΅¨σ΅¨σ΅¨π=π‘ − 0 π‘ Let πΈπ (π‘) = π¦π (π‘)−π¦(π‘), π = 0, 1, . . . . If π‘ β©½ 0, then πΈπ (π‘) = 0, π = 0, 1, . . . . From (9) and (11), we have πΈπ+1 (π‘) = πΈπ (π‘) π‘ σΈ σΈ + ∫ (π − π‘)[πΈπ (π) − (π (π, π¦π (π) , π (πΌ (π))) 0 (7) −π (π, π¦ (π) , π (πΌ (π))))] ππ, 0 < π‘ < π‘1 . (13) Journal of Applied Mathematics 3 σΈ σΈ Since [πΌ−1 (π‘)] is bounded, π = max−π≤π≤πΌ(π) (πΌ−1 (π)) is bounded. Moreover, it follows from (2) and the inequality |π − π‘| ≤ π that From (10) and (12), we have πΈπ+1 (π‘) π‘ σ΅¨σ΅© σ΅© σ΅¨ σ΅©σ΅© σ΅©σ΅©πΈπ+1 (π‘)σ΅©σ΅©σ΅© ≤ ∫ σ΅¨σ΅¨σ΅¨π‘ − πσ΅¨σ΅¨σ΅¨ σ΅©σ΅©σ΅©π (π, π¦π (π) , π (πΌ (π))) 0 = πΈπ (π‘) π‘1 σ΅© − π (π, π¦ (π) , π (πΌ (π)))σ΅©σ΅©σ΅© ππ σΈ σΈ + ∫ (π − π‘) [πΈπ (π) − (π (π, π¦π (π) , π (πΌ (π))) 0 − π (π, π¦ (π) , π (πΌ (π)))) ]ππ π‘ π‘ σ΅© σ΅© ≤ ∫ ππ½0 σ΅©σ΅©σ΅©π¦π (π) − π¦ (π)σ΅©σ΅©σ΅© ππ 0 π‘ σ΅© σ΅© = ∫ ππ½0 σ΅©σ΅©σ΅©πΈπ (π)σ΅©σ΅©σ΅© ππ, σΈ σΈ + ∫ (π − π‘) [πΈπ (π) − (π (π, π¦π (π) , π¦π (πΌ (π))) π‘1 0 − π (π, π¦ (π) , π¦ (πΌ (π)))) ]ππ, π‘ > π‘1 . (14) 0 < π‘ < π‘1 ; (16) π‘1 σ΅¨σ΅© σ΅©σ΅© σ΅© σ΅¨ σ΅©σ΅©πΈπ+1 (π‘)σ΅©σ΅©σ΅© ≤ ∫ σ΅¨σ΅¨σ΅¨π‘ − πσ΅¨σ΅¨σ΅¨ σ΅©σ΅©σ΅©π (π, π¦π (π) , π (πΌ (π))) 0 σ΅© − π (π, π¦ (π) , π (πΌ (π)))σ΅©σ΅©σ΅© ππ π‘ σ΅¨σ΅© σ΅¨ + ∫ σ΅¨σ΅¨σ΅¨π‘ − πσ΅¨σ΅¨σ΅¨ σ΅©σ΅©σ΅©π (π, π¦π (π) , π¦π (πΌ (π))) π‘ Using integration by parts, we have 1 π‘ σ΅© − π (π, π¦ (π) , π¦ (πΌ (π)))σ΅©σ΅©σ΅© ππ σΈ σΈ πΈπ+1 (π‘) = πΈπ (π‘) + ∫ (π − π‘) πΈπ (π) ππ 0 π‘ 1 σ΅© σ΅© ≤ ∫ ππ½0 σ΅©σ΅©σ΅©π¦π (π) − π¦ (π)σ΅©σ΅©σ΅© ππ 0 π‘ − ∫ (π − π‘) [π (π, π¦π (π) , π (πΌ (π))) 0 π‘ σ΅© σ΅© σ΅© σ΅© + ∫ π (π½0 σ΅©σ΅©σ΅©πΈπ (π)σ΅©σ΅©σ΅© + π½1 σ΅©σ΅©σ΅©πΈπ (πΌ (π))σ΅©σ΅©σ΅©) ππ − π (π, π¦ (π) , π (πΌ (π)))] ππ π‘1 π‘ = − ∫ (π − π‘) [π (π, π¦π (π) , π (πΌ (π))) π‘ π‘ 0 π‘1 σ΅© σ΅© σ΅© σ΅© = ∫ ππ½0 σ΅©σ΅©σ΅©πΈπ (π)σ΅©σ΅©σ΅© ππ + ∫ ππ½1 σ΅©σ΅©σ΅©πΈπ (πΌ (π))σ΅©σ΅©σ΅© ππ 0 − π (π, π¦ (π) , π (πΌ (π)))] ππ, π‘ σ΅© σ΅© = ∫ ππ½0 σ΅©σ΅©σ΅©πΈπ (π)σ΅©σ΅©σ΅© ππ 0 0 < π‘ < π‘1 ; π‘ σΈ σΈ πΈπ+1 (π‘) = πΈπ (π‘) + ∫ (π − π‘) πΈπ (π) ππ +∫ πΌ(π‘) πΌ(π‘1 ) 0 π‘1 σΈ σ΅© σ΅© ππ½1 σ΅©σ΅©σ΅©πΈπ (π)σ΅©σ΅©σ΅© (πΌ−1 (π)) ππ π‘ σ΅© σ΅© ≤ πππ½ ∫ σ΅©σ΅©σ΅©πΈπ (π)σ΅©σ΅©σ΅© ππ, 0 − ∫ (π − π‘) [π (π, π¦π (π) , π (πΌ (π))) 0 π‘ > π‘1 , (17) − π (π, π¦ (π) , π (πΌ (π)))] ππ where π½ = max π½π , π = 1, 2. Moreover, π‘ − ∫ (π − π‘) [π (π, π¦π (π) , π¦π (πΌ (π))) π‘ π π‘ π π π‘ π π 1 2 σ΅©σ΅© σ΅© σ΅© σ΅© σ΅©σ΅©πΈπ+1 (π‘)σ΅©σ΅©σ΅© ≤ (πππ½) ∫ ∫ σ΅©σ΅©σ΅©πΈπ−1 (π 2 )σ΅©σ΅©σ΅© ππ 2 ππ 1 0 0 π‘1 − π (π, π¦ (π) , π¦ (πΌ (π)))] ππ 1 2 3 σ΅© σ΅© ≤ (πππ½) ∫ ∫ ∫ σ΅©σ΅©σ΅©πΈπ−2 (π 3 )σ΅©σ΅©σ΅© ππ 3 ππ 2 ππ 1 0 0 0 π‘1 = − ∫ (π − π‘) [π (π, π¦π (π) , π (πΌ (π))) 0 π 1 2 3 4 σ΅© σ΅© ≤ (πππ½) ∫ ∫ ∫ ∫ σ΅©σ΅©σ΅©πΈπ−3 (π 4 )σ΅©σ΅©σ΅© ππ 4 ππ 3 ππ 2 ππ 1 0 0 0 0 − π (π, π¦ (π) , π (πΌ (π)))] ππ π‘ ⋅⋅⋅ − ∫ (π − π‘) [π (π, π¦π (π) , π¦π (πΌ (π))) π‘1 ≤ (πππ½) − π (π, π¦ (π) , π¦ (πΌ (π)))] ππ, π‘ > π‘1 . π+1 π‘ π π π 1 2 π σ΅© σ΅© ∫ ∫ ∫ ⋅ ⋅ ⋅ ∫ σ΅©σ΅©σ΅©πΈ0 (π π+1 )σ΅©σ΅©σ΅© ππ π+1 0 0 0 0 ⋅ ⋅ ⋅ ππ 3 ππ 2 ππ 1 , (15) (18) 4 Journal of Applied Mathematics where π¦π (π‘) = π(π‘) for π‘ ∈ [−π, 0]; πΜ denotes the restrictive variation, that is, πΏπΜ = 0. Thus, we have where βπΈ0 (π‘)β is constant. Therefore, we have π+1 σ΅©σ΅© σ΅© σ΅© σ΅© (πππ½) σ³¨→ 0, σ΅©σ΅©πΈπ+1 (π‘)σ΅©σ΅©σ΅© ≤ σ΅©σ΅©σ΅©πΈ0 (π‘)σ΅©σ΅©σ΅© (π + 1)! (π σ³¨→ ∞) . (19) πΏπ¦π+1 (π‘) = πΏπ¦π (π‘) π‘ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) + π2 π¦π (π) 0 2.2. The Second Kind of Second-Order Delay Differential Equations. Consider the initial value problems of secondorder delay oscillation differential equations + πΜ (π, π¦π (π) , ππ (πΌ (π)))] ππ π‘ σΈ σΈ = πΏπ¦π (π‘) + ∫ πΏπ (π‘, π) [π¦π (π) + π2 π¦π (π)] ππ, 0 σΈ σΈ 2 π¦ (π‘) = −π π¦ (π‘) − π (π‘, π¦ (π‘) , π¦ (πΌ (π‘))) , π¦σΈ (π‘) = πσΈ (π‘) , π¦ (π‘) = π (π‘) , π‘ ∈ [0, π] , 0 < π‘ < π‘1 . (24) π‘ ∈ [−π, 0] , Using integration by parts to (23), we have π‘ ∈ [−π, 0] , (20) where π(π‘) is a differentiable function, πΌ(π‘) ∈ πΆ1 [0, π] is a strictly monotone increasing function and satisfies that −π ≤ πΌ(π‘) ≤ π‘ and πΌ(0) = −π, there exists π‘1 ∈ [0, π] such that πΌ(π‘1 ) = 0, π is a constant, and π : π· = [0, π] × π × π → π is a given continuous mapping and satisfies the Lipschitz condition σ΅© σ΅© σ΅© σ΅©σ΅© σ΅©σ΅©π (π‘, π’1 , π£) − π (π‘, π’2 , π£)σ΅©σ΅©σ΅© ≤ π 0 σ΅©σ΅©σ΅©π’1 − π’2 σ΅©σ΅©σ΅© , σ΅©σ΅© σ΅© σ΅© σ΅© σ΅©σ΅©π (π‘, π’, π£1 ) − π (π‘, π’, π£2 )σ΅©σ΅©σ΅© ≤ π 1 σ΅©σ΅©σ΅©π£1 − π£2 σ΅©σ΅©σ΅© , πΏπ¦π+1 (π‘) = πΏπ¦π (π‘) π‘1 σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) + π2 π¦π (π) 0 + πΜ (π, π¦π (π) , ππ (πΌ (π)))] ππ π‘ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) + π2 π¦π (π) π‘1 + πΜ (π, π¦π (π) , π¦π (πΌ (π)))] ππ (21) π‘ σΈ σΈ = πΏπ¦π (π‘) + ∫ πΏπ (π‘, π) [π¦π (π) + π2 π¦π (π)] ππ where π 0 , π 1 are Lipschitz constants. Now the VIM for (20) can read 0 = πΏπ¦π (π‘) − π¦π+1 (π‘) = π¦π (π‘) σ΅¨σ΅¨ ππ (π‘, π) σ΅¨ πΏπ¦π (π)σ΅¨σ΅¨σ΅¨ σ΅¨σ΅¨π=π‘ ππ σ΅¨ σΈ + π (π‘, π) πΏπ¦π (π)σ΅¨σ΅¨σ΅¨π=π‘ π‘ σΈ σΈ + ∫ π (π‘, π) [π¦π (π) + π2 π¦π (π) π‘ 0 + πΜ (π, π¦π (π) , ππ (πΌ (π))) ] ππ, + ∫ [π2 π (π‘, π) + 0 π2 π (π‘, π) ] πΏπ¦π (π) ππ. ππ2 (25) 0 < π‘ < π‘1 ; (22) π¦π+1 (π‘) = π¦π (π‘) π‘1 +∫ 0 σΈ σΈ π (π‘, π) [π¦π From the above formula, the stationary conditions are obtained as π2 π (π‘, π) = 0, ππ2 ππ (π‘, π) σ΅¨σ΅¨σ΅¨σ΅¨ 1− σ΅¨ = 0, ππ σ΅¨σ΅¨σ΅¨π=π‘ σ΅¨ π(π‘, π)σ΅¨σ΅¨σ΅¨π=π‘ = 0. π2 π (π‘, π) + 2 (π) + π π¦π (π) + πΜ (π, π¦π (π) , ππ (πΌ (π))) ] ππ π‘ σΈ σΈ + ∫ π (π‘, π) [π¦π (π) + π2 π¦π (π) π‘1 + πΜ (π, π¦π (π) , π¦π (πΌ (π))) ] ππ, π‘ > π‘1 , (23) (26) Moreover, the general Lagrange multiplier π (π‘, π) = 1 sin π (π − π‘) π (27) Journal of Applied Mathematics 5 can be readily identified by (26). Thus, the variational iteration formula can be written as π¦π+1 (π‘) Now the VIM for (29) can read π¦π+1 (π‘) = π¦π (π‘) = π¦π (π‘) +∫ π‘ 0 π‘ σΈ σΈ σΈ + ∫ π (π‘, π) [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π) 1 σΈ σΈ sin π (π − π‘) [π¦π (π) + π2 π¦π (π) π 0 Μ (π, π¦π (π) , π (πΌ (π)))] ππ, +π + π (π, π¦π (π) , π (πΌ (π))) ] ππ, 0 < π‘ < π‘1 ; 0 < π‘ < π‘1 ; π¦π+1 (π‘) (31) π¦π+1 (π‘) = π¦π (π‘) π‘1 = π¦π (π‘) +∫ π‘1 0 σΈ σΈ σΈ +∫ π (π‘, π) [π¦π (π)+π (π) π¦π (π) + π (π) π¦π (π) 0 1 σΈ σΈ sin π (π − π‘) [π¦π (π) + π2 π¦π (π) π Μ (π, π¦π (π) , π (πΌ (π)))] ππ +π π‘ + π (π, π¦π (π) , π (πΌ (π))) ] ππ +∫ π‘ π‘1 σΈ σΈ σΈ +∫ π (π‘, π) [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π) π‘1 1 σΈ σΈ sin π (π − π‘) [π¦π (π) + π2 π¦π (π) π Μ (π, π¦π , π¦π (πΌ (π)))] ππ, +π π‘ > π‘1 , + π (π, π¦π (π) , π¦π (πΌ (π))) ] ππ, π‘ > π‘1 . (28) Theorem 2. Suppose that the initial value problems (20) satisfy the condition (21), and π¦(π‘), π¦π (π‘) ∈ πΆ2 [0, π], π = 1, 2, . . . . Then the sequence {π¦π (π‘)}∞ π=1 defined by (28) with π¦0 (π‘) converges to the solution of (20). (32) Μ denotes the restrictive where π¦π (π‘) = π(π‘) for π‘ ∈ [−π, 0]; π Μ variation, that is, πΏπ = 0. Thus, we have πΏπ¦π+1 (π‘) = πΏπ¦π (π‘) Proof. The proof process is similar that in Theorem 1. π‘ 2.3. The Third Kind of Second-Order Delay Differential Equations. In order to improve the iteration speed, we modify the above iterative formulas and reconstruct the Lagrange multiplier. Consider the initial value problems of secondorder delay differential equations σΈ σΈ σΈ π¦ (π‘) + π (π‘) π¦ (π‘) + π (π‘) π¦ (π‘) + π (π‘, π¦ (π‘) , π¦ (πΌ (π‘))) = 0, σΈ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π) 0 Μ (π, π¦π (π) , π (πΌ (π))) ] ππ +π = πΏπ¦π (π‘) π‘ σΈ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π)+π (π) π¦π (π)+π (π) π¦π (π)] ππ, 0 0 < π‘ < π‘1 . (33) π‘ ∈ [0, π] , π¦σΈ (π‘) = πσΈ (π‘) , π¦ (π‘) = π (π‘) , π‘ ∈ [−π, 0] , π‘ ∈ [−π, 0] , (29) where π(π‘) is a differentiable function, πΌ(π‘) ∈ πΆ1 [0, π] is a strictly monotone increasing function and satisfies that −π ≤ πΌ(π‘) ≤ π‘ and πΌ(0) = −π, there exists π‘1 ∈ [0, π] such that πΌ(π‘1 ) = 0, π(π‘), π(π‘) are bounded functions, and π : π· = [0, π] × π × π → π is a given continuous mapping and satisfies the Lipschitz condition σ΅© σ΅© σ΅© σ΅©σ΅© σ΅©σ΅©π (π‘, π’1 , π£) − π (π‘, π’2 , π£)σ΅©σ΅©σ΅© ≤ πΎ0 σ΅©σ΅©σ΅©π’1 − π’2 σ΅©σ΅©σ΅© , σ΅©σ΅© σ΅© σ΅© σ΅© σ΅©σ΅©π (π‘, π’, π£1 ) − π (π‘, π’, π£2 )σ΅©σ΅©σ΅© ≤ πΎ1 σ΅©σ΅©σ΅©π£1 − π£2 σ΅©σ΅©σ΅© , where πΎ0 , πΎ1 are Lipschitz constants. (30) Using integration by parts to (32), we have πΏπ¦π+1 (π‘) = πΏπ¦π (π‘) π‘1 σΈ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π) 0 Μ (π, π¦π (π) , π (πΌ (π)))] ππ +π π‘ σΈ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π) π‘1 Μ (π, π¦π (π) , π¦π (πΌ (π)))] ππ +π 6 Journal of Applied Mathematics = πΏπ¦π (π‘) Note that π‘ σΈ σΈ σΈ + ∫ πΏπ (π‘, π) [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π)] ππ 0 π‘ σΈ = πΏπ¦π (π‘) + ∫ π (π‘, π) πΏππ¦π (π) + ∫ π (π‘, π) π (π) πΏππ¦π (π) 0 π‘ π (π‘, π) = −π− ∫0 π(π)ππ [π’1 (π) π’2 (π‘) − π’2 (π) π’1 (π‘)] . (42) Substituting (42) into (31) and (32), we obtain + ∫ πΏπ (π‘, π) π (π) π¦π (π) ππ π¦π+1 (π‘) = π¦π (π‘) 0 σ΅¨σ΅¨ ππ (π‘, π) σ΅¨ + π (π) π (π)) πΏπ¦π (π)σ΅¨σ΅¨σ΅¨ σ΅¨σ΅¨π=π‘ ππ σ΅¨ σΈ + π (π‘, π) πΏ π¦π (π)σ΅¨σ΅¨σ΅¨σ΅¨π=π‘ π‘ π‘ + ∫ π− ∫0 π(π)ππ [π’1 (π) π’2 (π‘) − π’2 (π) π’1 (π‘)] = (1 − 0 (41) π‘ π‘ π‘ π 2 (π‘, π) . √π (π‘, 0) π’2 (π) = Equation (40) can be expressed as 0 +∫ [ π 1 (π‘, π) , √π (π‘, 0) π’1 (π) = 0 + π (π, π¦π (π) , π (πΌ (π))) ] ππ, π2 π (π‘, π) π (π (π) π (π‘, π)) − + π (π) π (π‘, π)] π2 (π) ππ 0 < π‘ < π‘1 ; × πΏπ¦π (π) ππ. (34) π¦π+1 (π‘) = π¦π (π‘) π‘1 From the above formula, the stationary conditions are obtained as π2 π (π‘, π) π (π (π) π (π‘, π)) − + π (π) π (π‘, π) = 0, π2 π ππ σ΅¨σ΅¨ ππ (π‘, π) σ΅¨ 1− + π (π) π (π‘, π)σ΅¨σ΅¨σ΅¨ = 0, σ΅¨σ΅¨π=π‘ ππ σ΅¨ π (π‘, π)σ΅¨σ΅¨σ΅¨π=π‘ = 0. π1 πσΈ 1 (π‘, π‘) + π2 πσΈ 2 (π‘, π‘) = 1. (35) (36) (37) π‘ π‘ σΈ σΈ σΈ × [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π) + π (π, π¦π , π¦π (πΌ (π))) ] ππ, π‘ > π‘1 . (44) Theorem 3. Suppose that the initial value problems (29) satisfy the condition (30), and π¦(π‘), π¦π (π‘) ∈ πΆ2 [0, π], π = 1, 2, . . . . Then the sequence {π¦π (π‘)}∞ π=1 defined by (43) and (44) with π¦0 (π‘) converges to the solution of (29). Proof. The proof process is similar to that in Theorem 1. (38) Using the Liouville formula, we have π (π‘, π‘) = π (π‘, 0) π∫0 π(π)ππ . π‘ + ∫ π− ∫0 π(π)ππ [π’1 (π) π’2 (π‘) − π’2 (π) π’1 (π‘)] π‘1 σ΅¨σ΅¨ π (π‘,π‘) π (π‘,π‘) σ΅¨σ΅¨ Note that π(π‘, π‘) = σ΅¨σ΅¨σ΅¨ πσΈ 1 (π‘,π‘) πσΈ 2 (π‘,π‘) σ΅¨σ΅¨σ΅¨ is the Wronski determinant 2 σ΅¨ σ΅¨ 1 of π 1 (π‘, π), π 2 (π‘, π). We have −π 2 (π‘, π‘) π 1 (π‘, π) + π 1 (π‘, π‘) π 2 (π‘, π) . π (π‘, π) = π (π‘, π‘) 0 +π (π, π¦π (π) , π (πΌ (π))) ] ππ Using the initial conditions of (35), we have π1 π 1 (π‘, π‘) + π2 π 2 (π‘, π‘) = 0, π‘ + ∫ π− ∫0 π(π)ππ [π’1 (π) π’2 (π‘) − π’2 (π) π’1 (π‘)] σΈ σΈ σΈ × [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π) We suppose that π 1 (π‘, π), π 2 (π‘, π) are the fundamental solutions of (35); the corresponding general solution of (35) is π (π‘, π) = π1 π 1 (π‘, π) + π2 π 2 (π‘, π) . (43) σΈ σΈ σΈ × [π¦π (π) + π (π) π¦π (π) + π (π) π¦π (π) 3. Illustrative Examples In this section, some illustrative examples are given to show the efficiency of the VIM for solving second-order delay differential equations. Example 4. Consider the initial value problem of secondorder differential equation with pantograph delay (39) So π(π‘, π) can be expressed as −π 2 (π‘, π‘) π 1 (π‘, π) + π 1 (π‘, π‘) π 2 (π‘, π) − ∫0π‘ π(π)ππ π (π‘, π) = . π π 1 (π‘, 0) πσΈ 2 (π‘, 0) − πσΈ 1 (π‘, 0) π 2 (π‘, 0) (40) π‘ π‘ π¦σΈ σΈ (π‘) = −π¦ ( ) − π¦2 (π‘) + sin4 (π‘) + sin2 ( ) + 8, 2 2 π‘ > 0, πσΈ (0) = 0, π (0) = 2, (45) Journal of Applied Mathematics 7 with the exact solution π¦(π‘) = (5 − cos 2π‘)/2. Using the VIM given in formulas (9) and (10), we construct the correction functional π¦π+1 (π‘) 2.04 2.03 = π¦π (π‘) π‘ π σΈ σΈ 2 + ∫ (π − π‘) (π¦π (π) + π¦π ( ) + π¦π (π) − sin4 (π) 2 0 − sin2 (π) − 8) ππ, 2.02 π = 1, 2, . . . . (46) 2.01 We take π¦0 (π‘) = 2 as the initial approximation and obtain that π¦1 (π‘) = 2 5 23 2 1 1 5 + π‘ + cos π‘ + cos2 π‘ − cos4 π‘, 4 16 2 16 16 π¦2 (π‘) = − − 0 1 1 11 π‘ sin π‘ cos π‘ + 3 cos ( π‘) + cos π‘ 256 2 16 Figure 1: Results for Example 4. = π¦π (π‘) +∫ π‘ 0 + 1 1 39 1 π‘ sin π‘ cos π‘ + 120 cos ( π‘) + cos ( π‘) 256 4 8 2 + 1 2 1393 157 2 1 cos π‘ + cos π‘ cos4 π‘ + π‘ cos π‘ 2048 512 16 2048 − 1 1 1 2 1 π‘ cos ( π‘) − π‘2 cos ( π‘) , 32 2 2 4 1 π σΈ σΈ 2 ( ) sin (4π − 4π‘) (π¦π (π) + 16π¦π (π) − π¦π 4 4 + sin2 π) ππ, π = 1, 2, . . . . (49) We take π¦0 (π‘) = 4π‘ as the initial approximation, and obtain that π¦1 (π‘) = −0.0390625 + 0.0625π‘2 + sin (4π‘) .. . + 0.04166666667 cos (2π‘) (47) The exact and approximate solutions are plotted in Figure 1, which shows that the method gives a very good approximation to the exact solution. Example 5. Consider the second-order delay differential equation π (0) = 0. 0.2 π¦π+1 (π‘) 1 15 1 121 + 14π‘ sin ( π‘) + π‘ sin ( π‘) + π‘ sin π‘ 4 16 2 2048 πσΈ (0) = 4, 0.15 Using the VIM given in formulas (28), we construct the correction functional 815 4 23 6 252541 9781 2 + π‘ + π‘ + π‘ 2048 4096 49125 491520 π‘ π¦σΈ σΈ (π‘) = −16π¦ (π‘) + π¦2 ( ) − sin2 π‘, 4 0.1 (t) 989 815 2 23 4 1 1 1 + π‘ + π‘ + π‘ sin ( π‘) + π‘ sin π‘ 512 512 1536 2 2 16 1 157 2 + cos π‘ − cos4 π‘, 512 16 π¦3 (π‘) = − 0.05 − 0.002604166667 cos (4π‘) , π¦2 (π‘) = 0.00613912861 − 3.998216869π‘ + 0.1805413564π‘2 − 0.4340277778π‘3 + π (π‘4 ) + (0.006666666667 − 0.5208333333π‘ + π (π‘2 )) sin π‘ + (−0.1946373457 − 0.5555555556π‘ + π (π‘2 )) cos π‘ − 0.1085069444 sin (2π‘) − 2 cos 4π‘, π‘ > 0, (48) .. . (50) 8 Journal of Applied Mathematics Table 1: The errors of the iteration solutions. π‘ = 0.01 1.9048πΈ − 09 1.89278πΈ − 05 Iterative formula (43) Iterative formula (9) π‘ = 0.05 1.1905πΈ − 06 1.0972πΈ − 03 Example 6. Consider the second-order delay differential equation π‘ 2 π¦σΈ σΈ (π‘) = − π¦σΈ (π‘) + 16π¦2 ( ) + 6 − π‘4 , π‘ 2 π‘ > 0, (51) πσΈ (0) = 0, with the exact solution π¦(π‘) = π‘2 . From (35), we can solve that π(π‘, π) = −π + π2 /π‘. Using the VIM given in formulas (43) and (44), we construct the correction functional π¦π+1 (π‘) = π¦π (π‘) π‘ 0 π2 π 2 σΈ σΈ σΈ 2 ( ) (52) ) (π¦π (π) + π¦π (π) − 16π¦π π‘ π 2 − 6 + π4 ) ππ, π = 1, 2, . . . . We take π¦0 (π‘) = 2π‘ as the initial approximation and obtain that 1 π¦1 (π‘) = − π‘6 + π‘2 , 42 π¦2 (π‘) = π‘2 + π‘ = 0.15 906428πΈ − 05 3.8062πΈ − 02 Scholars and the Innovative Research Team in the University of China (IRT1179), the Aid Program for Science and Technology Innovative Research Team in Higher Educational Institutions of Hunan Province of China, and the Fund Project of Hunan Province Education Office (11C1120). References π (0) = 0, + ∫ (−π + π‘ = 0.1 1.9048πΈ − 05 9.2763πΈ − 03 4 6 1 10 1 π‘ − π‘ + π‘14 , 21 1760 1935360 (53) .. . We use the iterative formulas (9) and (43) for Example 6, respectively. When the iteration number π = 2, the corresponding relative errors are showed in Table 1. Table 1 shows that the iteration speed of the iterative formula (43) for Example 6 is much faster than that of iterative formula (9). This demonstrates that it is important to choose a reasonable Lagrange multiplier. 4. Conclusion In this paper, we apply the VIM to obtain the analytical or approximate analytical solutions of second-order delay differential equations. Some illustrative examples show that this method gives a very good approximation to the exact solution. The VIM is a promising method for second-order delay differential equations. Acknowledgments The authors would like to thank the projects from NSF of China (11226322, 11271311), the Program for Changjiang [1] Y. Xu, J. J. Zhao, and M. Z. Liu, “TH-stability of π-method for a second-order delay differential equation,” Mathematica Numerica Sinica, vol. 26, no. 2, pp. 189–192, 2004. [2] C. M. Huang and W. H. Li, “Delay-dependent stability analysis of the trapezium rule for a class of second-order delay differential equations,” Mathematica Numerica Sinica, vol. 29, no. 2, pp. 155–162, 2007. [3] X. H. Ding, J. Y. Zou, and M. Z. Liu, “π-stability of continuous Runge-Kutta-NystroΜm method for a class of delayed second order differential equations,” Numerical Mathematics, vol. 27, no. 2, pp. 123–132, 2005. [4] J.-H. He, “Variational iteration method: a kind of non-linear analytical technique: some examples,” International Journal of Non-Linear Mechanics, vol. 34, no. 4, pp. 699–708, 1999. [5] J.-H. He, “Some asymptotic methods for strongly nonlinear equations,” International Journal of Modern Physics B, vol. 20, no. 10, pp. 1141–1199, 2006. [6] J.-H. He, “Variational iteration method for autonomous ordinary differential systems,” Applied Mathematics and Computation, vol. 114, no. 2-3, pp. 115–123, 2000. [7] Z.-H. Yu, “Variational iteration method for solving the multipantograph delay equation,” Physics Letters A, vol. 372, no. 43, pp. 6475–6479, 2008. [8] L. Xu, “Variational iteration method for solving integral equations,” Computers & Mathematics with Applications, vol. 54, no. 7-8, pp. 1071–1078, 2007. [9] S.-P. Yang and A.-G. Xiao, “Convergence of the variational iteration method for solving multi-delay differential equations,” Computers & Mathematics with Applications, vol. 61, no. 8, pp. 2148–2151, 2011. [10] S. Yang, A. Xiao, and H. Su, “Convergence of the variational iteration method for solving multi-order fractional differential equations,” Computers & Mathematics with Applications, vol. 60, no. 10, pp. 2871–2879, 2010. [11] Y. Zhao and A. Xiao, “Variational iteration method for singular perturbation initial value problems,” Computer Physics Communications, vol. 181, no. 5, pp. 947–956, 2010. [12] H. Liu, A. Xiao, and Y. Zhao, “Variational iteration method for delay differential-algebraic equations,” Mathematical & Computational Applications, vol. 15, no. 5, pp. 834–839, 2010. [13] M. Rafei, D. D. Ganji, H. Daniali, and H. Pashaei, “The variational iteration method for nonlinear oscillators with discontinuities,” Journal of Sound and Vibration, vol. 305, no. 4-5, pp. 614–620, 2007. Journal of Applied Mathematics [14] V. Marinca, N. HerisΜ§anu, and C. Bota, “Application of the variational iteration method to some nonlinear one-dimensional oscillations,” Meccanica, vol. 43, no. 1, pp. 75–79, 2008. [15] M. Tatari and M. Dehghan, “On the convergence of He’s variational iteration method,” Journal of Computational and Applied Mathematics, vol. 207, no. 1, pp. 121–128, 2007. [16] J.-H. He and X.-H. Wu, “Variational iteration method: new development and applications,” Computers & Mathematics with Applications, vol. 54, no. 7-8, pp. 881–894, 2007. [17] J.-H. He, “Variational iteration method—some recent results and new interpretations,” Journal of Computational and Applied Mathematics, vol. 207, no. 1, pp. 3–17, 2007. [18] J.-H. He, “A short remark on fractional variational iteration method,” Physics Letters A, vol. 375, no. 38, pp. 3362–3364, 2011. [19] J.-H. He, “Asymptotic methods for solitary solutions and compactons,” Abstract and Applied Analysis, vol. 2012, Article ID 916793, 130 pages, 2012. 9 Advances in Operations Research Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Advances in Decision Sciences Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Mathematical Problems in Engineering Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Algebra Hindawi Publishing Corporation http://www.hindawi.com Probability and Statistics Volume 2014 The Scientific World Journal Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Differential Equations Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Volume 2014 Submit your manuscripts at http://www.hindawi.com International Journal of Advances in Combinatorics Hindawi Publishing Corporation http://www.hindawi.com Mathematical Physics Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Complex Analysis Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Mathematics and Mathematical Sciences Journal of Hindawi Publishing Corporation http://www.hindawi.com Stochastic Analysis Abstract and Applied Analysis Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com International Journal of Mathematics Volume 2014 Volume 2014 Discrete Dynamics in Nature and Society Volume 2014 Volume 2014 Journal of Journal of Discrete Mathematics Journal of Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Applied Mathematics Journal of Function Spaces Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Optimization Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014