/ / Article

Research Article | Open Access

Volume 2013 |Article ID 286529 | https://doi.org/10.1155/2013/286529

Sabir Widatalla, M. Z. Liu, "New Iterative Method Based on Laplace Decomposition Algorithm", Journal of Applied Mathematics, vol. 2013, Article ID 286529, 7 pages, 2013. https://doi.org/10.1155/2013/286529

# New Iterative Method Based on Laplace Decomposition Algorithm

Revised28 Jan 2013
Accepted29 Jan 2013
Published14 Mar 2013

#### Abstract

We introduce a new form of Laplace decomposition algorithm (LDA). By this form a new iterative method was achieved in which there is no need to calculate Adomian polynomials, which require so much computational time for higher-order approximations. We have implemented this method for the solutions of different types of nonlinear pantograph equations to support the proposed analysis.

#### 1. Introduction

Since 2001, Laplace decomposition algorithm (LDA) has been one of the reliable mathematical methods for obtaining exact or numerical approximation solutions for a wide range of nonlinear problems.

The Laplace decomposition algorithm was developed by Khuri in  to solve a class of nonlinear differential equations. The basic idea in Laplace decomposition algorithm, which is a combined form of the Laplace transform method with the Adomian decomposition method, was developed to solve nonlinear problems. The disadvantage of the Laplace decomposition algorithm is that the solution procedure for calculation of Adomian polynomials is complex and difficult and takes a lot of computational time for higher-order approximations as pointed out by many researchers .

The Laplace decomposition algorithm plays an important role in modern scientific research for solving various kinds of nonlinear models; for example, Laplace decomposition algorithm was used in  to solve a model for HIV infection of cells; LDA was employed in  to solve Abel's second kind singular integral equations. In  it was used to solve boundary Layer equation.

Even though there has been some developments in the LDA , the use of Adomian polynomials has not been abandoned.

The main purpose of this paper is to introduce a new iterative method based on Laplace decomposition algorithm procedure without the need to compute Adomian polynomials and thus reduce the size of calculations needed.

The scheme is tested for some classes of pantograph equations, and the results demonstrate reliability and efficiency of the proposed method.

#### 2. Basic Idea of LDA and the New Technique

To illustrate the basic concept of Laplace decomposition algorithm, we consider the following general nonlinear model: where is the highest order derivative, and are linear and nonlinear operators, respectively, and is an inhomogeneous term.

Applying the Laplace transform (denoted throughout this paper by ) to both sides of (1) and using given conditions, we obtain where

The Laplace decomposition algorithm defines the unknown function by an infinite series as where the components will be determined recurrently. Substituting this infinite series into (2) and using the linearity of Laplace transform lead to

Also the nonlinear functions are defined by infinite series as follows: where are the Adomian polynomials , depending only on , and defined by

Substituting (6) into (5), we get

The Laplace decomposition algorithm presents the recurrence relation as

Applying the inverse Laplace transform to (8) leads to

Equation (10) can be written as

By taking and (11), the following procedure can be constructed:

Consequently, the exact solution may be obtained by

For the analytic nonlinear operator , we can write

By considering,(12) and (14) can be reconstructed as

Equation (15) is a new iteration method based on LDA. The advantage of this scheme is that there is no need to calculate Adomian polynomials.

#### 3. Test Problems

In this section we will apply our scheme to different types of pantograph equations.

Example 1 (see ). Consider the following nonlinear pantograph differential equation:
The exact solution of this problem .
Based on the iteration formula (15), we get
Thus, we get
Knowing that the exact solution of this exampleisgiven in ,
We see that the approximation solutions obtained by the present method have good agreement with the exact solution of this problem.
In Table 1 the absolute errors of the present method and standard LDA for are compared.
Figure 1 compares the numerical errors for , and obtained by (a) the present method and (b) the standard LDA. This plot indicates that the series solution obtained by the present method converges faster than the standard LDA.

 Exact solution Standard LDA Present method 0.2 1.048708864495296 0.6 1.137669652809217 0.8 1.177476957990361 1.0 1.213898289556670 2.0 1.339484983470599 4.0 1.276427846019296 6.0 8.0 10 1.910

Example 2. Consider the following nonlinear pantograph integrodifferential equation (PIDE):
For this example we write iteration formula (15) as
and the first terms are which gives the exact solution by .
In Table 2 we compare the absolute errors of the present method for and the standard LDA for and the differential transform method described in  with nine terms.
Figure 2 displays the numerical errors obtained by the present method and the standard LDA.

 Exact solution DTM  Standard LDA Present method 0.2 0.6 0.8 1.0 2.0 4.0 6.0 7.3079 8.0 148.51 3.6889 1.2615

Example 3. Consider the following nonlinear PIDE: which has the exact solution . The iteration form of (15) for this example is
We obtain the following successive approximations:
Note that the exact solution of this example is
In Table 3 we compare the absolute errors of the present method for and the standard LDA for and the differential transform method described in  with four terms.
Figure 3 displays the numerical errors obtained by the present method and the standard LDA.

 Exact solution DTM  Standard LDA Present method 0.2 0.4 0.6 1.093271280234305 0.8 1.780432742793974 1.0 2.718281828459046 2.0 14.77811219786130 2.111 1.4168 1.1919 3.0 60.25661076956300 21.25 14.341 9.6958

Example 4. Consider a system of multipantograph equations:
We can adapt (15) to solve this system as follows:
Table 4 gives the absolute errors of the present method. The table clearly indicates that when we increase the truncation limit , we have less error.
Table 5 summarizes the CPU times needed to obtain the first three components of the series solutions pertaining to the four above-mentioned examples by the present method and the standard LDA. The CPU time analysis was conducted on a personal computer with a 3.77 GHz processor and 4 GB of RAM using MATLAB 7.10.

 Exact solution Present method 0.2 0.4 0.6 0.8 1.0 0.2 0.4 0.6 0.8 1.0
 Solution method The required CPU time [in seconds] Example 1 Example 2 Example 3 Example 4 Present method 1.1716 2.0121 1.5608 3.0301 Standard LDA 1.1872 2.4046 1.9201 3.3431

#### 4. Conclusion

In this work, we have presented a new iteration method based on the Laplace decomposition algorithm.

The advantage of the new method is that it does not require Adomian polynomials and thus reduces the calculation size.

The new iterative method has been employed to solve different classes of nonlinear pantograph equations, in which the results obtained are in close agreement with the exact solutions.

The convergence of this method is the subject of ongoing research.

#### Acknowledgments

The authors wish to thank the referees for valuable comments. The research was supported by the NSF of China no. 11071050.

1. S. Widatalla, Iterative methods for solving nonlinear pantograph equations [Ph.D. thesis], Harbin Institute of Technology, 2013.
2. S. A. Khuri, “A Laplace decomposition algorithm applied to a class of nonlinear differential equations,” Journal of Applied Mathematics, vol. 1, no. 4, pp. 141–155, 2001.
3. H. K. Mishra and A. K. Nagar, “He-Laplace method for linear and nonlinear partial differential equations,” Journal of Applied Mathematics, vol. 2012, Article ID 180315, 16 pages, 2012.
4. A. Saadatmandi and M. Dehghan, “Variational iteration method for solving a generalized pantograph equation,” Computers & Mathematics with Applications, vol. 58, no. 11-12, pp. 2190–2196, 2009.
5. A. Ghorbani, “Beyond Adomian polynomials: he polynomials,” Chaos, Solitons and Fractals, vol. 39, no. 3, pp. 1486–1492, 2009.
6. M. Y. Ongun, “The Laplace Adomian Decomposition Method for solving a model for HIV infection of $CD{4}^{+}T$ cells,” Mathematical and Computer Modelling, vol. 53, no. 5-6, pp. 597–603, 2011.
7. M. Khan and M. A. Gondal, “A reliable treatment of Abel's second kind singular integral equations,” Applied Mathematics Letters, vol. 25, no. 11, pp. 1666–1670, 2012.
8. Y. Khan, “An effective modification of the Laplace decomposition method for nonlinear equations,” International Journal of Nonlinear Sciences and Numerical Simulation, vol. 10, pp. 1373–1376, 2009. View at: Google Scholar
9. Y. Khan and N. Faraz, “Application of modified Laplace decomposition method for solving boundary layer equation,” Journal of King Saud University, vol. 23, pp. 115–119, 2011. View at: Google Scholar
10. M. Hussain and M. Khan, “Modified Laplace decomposition method,” Applied Mathematical Sciences, vol. 4, no. 33-36, pp. 1769–1783, 2010.
11. S. Widatalla and M. A. Koroma, “Approximation algorithm for a system of pantograph equations,” Journal of Applied Mathematics, vol. 2012, Article ID 714681, 9 pages, 2012.
12. G. Adomian, Solving Frontier Problems of Physics: The Decomposition Method, Kluwer Academic Publishers, Boston, Mass, USA, 1994. View at: MathSciNet
13. A. Iserles, “On nonlinear delay differential equations,” Transactions of the American Mathematical Society, vol. 344, no. 1, pp. 441–477, 1994.

#### More related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.