`ISRN Computational MathematicsVolume 2012, Article ID 704184, 6 pageshttp://dx.doi.org/10.5402/2012/704184`
Research Article

## A Comparative Study on the Stability of Laplace-Adomian Algorithm and Numerical Methods in Generalized Pantograph Equations

1Department of Mathematics, Harbin Institute of Technology, Harbin 150001, China
2Department of Mathematics, Sinnar University, Singa 107, Sudan

Received 31 May 2012; Accepted 29 July 2012

Academic Editors: T. Allahviranloo and K. T. Miura

Copyright © 2012 Sabir Widatalla. 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.

#### Abstract

The main objective of this paper is to examine the stability and convergence of the Laplace-Adomian algorithm to approximate solutions of the pantograph-type differential equations with multiple delays. This is done by comparatively investigating it with other methods.

#### 1. Introduction

Delay differential equations (DDEs) are a large and important class of differential equations in which the derivative of the unknown function at a certain time is given in terms of the values of the function at previous times. They often arise in wide and diverse range of applications in population studies [1, 2], economics [3], medical biology [4, 5], controls of mechanical systems [6], and so forth. The pantograph equation is one of the most important kinds of DDEs. The name pantograph was used by Iserles and Liu [7] to study how the electric current is collected by the pantograph of an electric locomotive, from where it gets its name.

In recent years, some promising approximate analytical solutions have been proposed, such as the Taylor collocation method [8], Bernstein polynomials [9], spline method [10, 11], and other methods are reviewed in [2, 12, 13].

In this work we consider the following problems

Problem 1.

Problem 2.
where is an analytical function, , and ; ,   .

The aim of this paper is to employ and examine the stability of the Laplace-Adomian algorithm (LAA) for solving Problems 1 and 2. This method was first proposed by Khuri [14], who applied the scheme to a class of nonlinear differential equations. In this method the solution is given as an infinite series usually converging very rapidly to the exact solution of the problem.

A major advantage of this method is that it is free from round-off errors and without any discretization or restrictive assumptions. Therefore, results obtained by LAA are more accurate and efficient. LAA has been shown to accurately and easily approximate solutions of large class of linear and nonlinear ODEs and PDEs [1416]; for example, Ongun [17] employed LAA to give an approximate solution of nonlinear ordinary differential equation systems, such as a model for HIV infection of T cells, Wazwaz [18] also used this method for handling the nonlinear Volterra integro-differential equations, Khan and Faraz [19] modified LAA to obtain series solutions of the boundary layer equation, and Yusufoglu [20] adapted LAA to solve the Duffing equation.

The numerical technique of LAA basically illustrates how the Laplace transforms are used to approximate the solution of the nonlinear differential equations by manipulating the decomposition method that was first introduced by Adomian [21, 22].

To illustrate the basic idea of the Laplace-Adomian algorithm, we consider the following nonlinear operator: with the initial condition where is a linear operator, is a nonlinear operator, and is a given analytical function.

The technique consists first of applying the Laplace transform (denoted throughout this paper by ) to both sides of (3), to get Applying the formulas of the Laplace transform, we obtain where Suppose the answer to (3) is as follows: where the terms are to be recursively computed, the nonlinear operator is decomposed as follows: where is an infinite series of the Adomian polynomials , calculated by the formula [21]

Substituting (8) and (9) into (6) leads to

Using the linearity of the Laplace transform gives (11) as

Matching both sides of (11) yields

Generally

Applying the inverse Laplace transform to (13) gives the initial approximation

Substituting this value of into the inverse Laplace transform of (14) gives . The other terms can be obtained recursively in similar fashion from

Using (18), we can rewrite them as follows to obtain :

Subsiutiting the values of into (8) gives

The sum of terms in (8), that is, , where , tends to . This means that is an appropriate approximation of . The terms in the above series soon tend to zero where has been the coefficients of calculations derived from the operation , is the number of terms, and is the order of the operation derivation. Therefore, it has a rapid convergence.

#### 3. Test Problems

In this section, we will apply Laplace-Adomian algorithm to solve the pantograph delay equation. The absolute errors in Tables 14 are the values of at selected points. All iterates are calculated by using Matlab 7.

Table 1: Comparison of the absolute errors for Example 1.
Table 2: Comparison of the absolute errors for for Example 2.
Table 3: Absolute errors for Example 3.
Table 4: Absolute errors for Example 4.
##### 3.1. Stability of the Laplace-Adomian Algorithm

A method is said to be stable when the obtained solution undergoes small variations as there are slight variations in inputs and parameters and when probable perturbations in parameters that are effective in equations and conditions prevailing them do not introduce, in comparison to the physical reality of the problem, any perturbations in what is returned. We propose here to compare the Laplace-Adomian algorithm with other numerical methods by offering examples and examining the stability of the Laplace-Adomian algorithm.

Example 1 (Evans and Raslan [13]). Consider the following pantograph equation:
The exact solution is . Applying the result of (17) gives us
The iteration formula (18) for this example is

In Table 1 we make a comparison between the absolute errors obtained by the Bernstien series [9] in column 2, together with the spline method [10, 11] in columns 3 and 4, and finally, the Laplace-Adomian algorithm with , and in the last three columns. Given the following absolute errors that were obtained from these methods, we can conclude that the rate of convergence of LAA is higher than the other methods. However, taking a closer look at the errors of LAA shows that the error increases significantly more than the other methods in the bottom of the columns. This means that the stability of LAA is decreasing more than the other methods.

Example 2 (Muroya et al. [23]). Consider the following pantograph equation:
The exact solution is . Applying the result of (17), gives us
The other terms of the sequences can be obtained directly from (18) as in general
Table 2 compares the results of the Laplace-Adomian algorithm and the Taylor collocation method [8]. It can be seen that the Laplace-Adomian algorithm is weaker in the stability than Taylor collocation method and yet is stronger in the convergence.

Example 3 (Liu and Li [12]). Consider the multipantograph delay equation with variable coefficients Here , and . The initial approximation for this example is And from (18), we obtain Comparisons of approximate solutions for few terms with exact solution are illustrated in Table 3.

Example 4. Consider the pantograph equation of third order Let us start with an initial approximation
The other terms of the sequences can be obtained directly from (18) where is the Adomian polynomials that represent the nonlinear term . The Adomian polynomials for are given by
Table 4 shows the absolute error of the numerical approximation by using a few iterations.

The results for Examples 34 in Figures 1 and 2, respectively, show that the approximations converge rapidly and only a few iterations are sufficient to obtain accurate solutions.

Figure 1: Error for and for Example 3.
Figure 2: Error for and for Example 4.

Example 5. Consider the multipantograph equation Following the procedures in the previous examples gives us
According to (18), we obtain Thus which is the exact solution.

#### 4. Conclusion

In this paper, the Laplace-Adomian algorithm has been successfully applied to the generalized pantograph equations with multiple delays to obtain high approximate solutions or exact solutions with little iterations used. Moreover, the Laplace-Adomian algorithm is simple and easy to use and stronger in convergence compared with other methods. Despite these advantages, it is seen that its stability is lower than other numerical methods.

#### References

1. W. G. Aiello, H. I. Freedman, and J. Wu, “Analysis of a model representing stage-structured population growth with state-dependent time delay,” SIAM Journal on Applied Mathematics, vol. 52, no. 3, pp. 855–869, 1992.
2. Y. Kuang, Delay Differential Equations with Applications in Population Dynamics, Academic, New York, NY, USA, 1993.
3. P. Brunovský, A. Erdélyi, and H.-O. Walther, “On a model of a currency exchange rate—local stability and periodic solutions,” Journal of Dynamics and Differential Equations, vol. 16, no. 2, pp. 393–432, 2004.
4. R. V. Culshaw and S. Ruan, “A delay-differential equation model of HIV infection of CD4+ T-cells,” Mathematical Biosciences, vol. 165, no. 1, pp. 27–39, 2000.
5. A. De Gaetano and O. Arino, “Mathematical modelling of the intravenous glucose tolerance test,” Journal of Mathematical Biology, vol. 40, no. 2, pp. 136–168, 2000.
6. H. O. Walther, “On a model for soft landing with state-dependent delay,” Journal of Dynamics and Differential Equations, vol. 19, no. 3, pp. 593–622, 2007.
7. A. Iserles and Y. K. Liu, “On pantograph integro-differential equations,” Journal of Integral Equations and Applications, vol. 6, no. 2, pp. 213–237, 1994.
8. M. Gülsu and M. Sezer, “A taylor collocation method for solving high-order linear pantograph equations with linear functional argument,” Numerical Methods for Partial Differential Equations, vol. 27, no. 6, pp. 1628–1638, 2011.
9. O. R. Işik, Z. Güney, and M. Sezer, “Bernstein series solutions of pantograph equations using polynomial interpolation,” Journal of Difference Equations and Applications, vol. 18, no. 3, pp. 357–374, 2012.
10. A. El-Safty and S. M. Abo-Hasha, “On the application of spline functions to initial value problems with retarded argument,” International Journal of Computer Mathematics, vol. 32, pp. 173–179, 1990.
11. M. Shadia, Numerical solution of delay differential and neutral differential equations using spline methods [Ph.D. thesis], Assuit University, Assuit, Egypt, 1992.
12. M. Z. Liu and D. Li, “Properties of analytic solution and numerical solution of multi-pantograph equation,” Applied Mathematics and Computation, vol. 155, no. 3, pp. 853–871, 2004.
13. D. J. Evans and K. R. Raslan, “The Adomian decomposition method for solving delay differential equation,” International Journal of Computer Mathematics, vol. 82, no. 1, pp. 49–54, 2005.
14. 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.
15. M. Khan, M. Hussain, H. Jafari, and Y. Khan, “Application of Laplace decomposition method to solve nonlinear coupled partial differential equations,” World Applied Sciences Journal, vol. 9, Special Issue of Applied Math, pp. 13–19, 2010.
16. S. A. Khuri, “A new approach to Bratu's problem,” Applied Mathematics and Computation, vol. 147, no. 1, pp. 131–136, 2004.
17. M. Y. Ongun, “The Laplace Adomian Decomposition Method for solving a model for HIV infection of CD4+T cells,” Mathematical and Computer Modelling, vol. 53, no. 5-6, pp. 597–603, 2011.
18. A. M. Wazwaz, “The combined Laplace transform-Adomian decomposition method for handling nonlinear Volterra integro-differential equations,” Applied Mathematics and Computation, vol. 216, no. 4, pp. 1304–1309, 2010.
19. Y. Khan and N. Faraz, “Application of modified Laplace decomposition method for solving boundary layer equation,” Journal of King Saud University, vol. 23, no. 1, pp. 115–119, 2011.
20. E. Yusufoglu, “Numerical solution of Duffing equation by the Laplace decomposition algorithm,” Applied Mathematics and Computation, vol. 177, no. 2, pp. 572–580, 2006.
21. G. Adomian, Solving Frontier Problems of Physics: The Decomposition Method, Kluwer Academic Publishers, Boston, Mass, USA, 1994.
22. G. Adomian, “A review of the decomposition method in applied mathematics,” Journal of Mathematical Analysis and Applications, vol. 135, no. 2, pp. 501–544, 1988.
23. Y. Muroya, E. Ishiwata, and H. Brunner, “On the attainable order of collocation methods for pantograph integro-differential equations,” Journal of Computational and Applied Mathematics, vol. 152, no. 1-2, pp. 347–366, 2003.