- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Journal of Applied Mathematics
Volume 2012 (2012), Article ID 714681, 9 pages
Approximation Algorithm for a System of Pantograph Equations
1Department of Mathematics, Harbin Institute of Technology, Harbin 150001, China
2Department of Physics and Mathematics, College of Education, Sinnar University, Singa, Sudan
Received 23 November 2011; Accepted 2 January 2012
Academic Editor: Yuantong Gu
Copyright © 2012 Sabir Widatalla and Mohammed Abdulai Koroma. 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.
We show how to adapt an efficient numerical algorithm to obtain an approximate solution of a system of pantograph equations. This algorithm is based on a combination of Laplace transform and Adomian decomposition method. Numerical examples reveal that the method is quite accurate and efficient, it approximates the solution to a very high degree of accuracy after a few iterates.
The pantograph equation: where is one of the most important kinds of delay differential equation that arise in many scientific models such as population studies, number theory, dynamical systems, and electrodynamics, among other. In particular, it was used by Ockendon and Tayler  to study how the electric current is collected by the pantograph of an electric locomotive, from where it gets its name.
The primary aim of this paper is to develop the Laplace decomposition for a system of multipantograph equations: where , and are analytical functions, and .
In 2001, the Laplace decomposition algorithm (LDA) was proposed by khuri in , 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 LDA are more accurate and efficient. LDA has been shown to easily and accurately to approximate a solutions of a large class of linear and nonlinear ODEs and PDEs [2–4]. Ongun , for example, employed LDA to give an approximate solution of nonlinear ordinary differential equation systems which arise in a model for HIV infection of CD4+ T cells, Wazwaz  also used this method for handling nonlinear Volterra integro-differential equations, Khan and Faraz  modified LDA to obtain series solutions of the boundary layer equation, and Yusufoglu  adapted LDA to solve Duffing equation.
The numerical technique of LDA basically illustrates how Laplace transforms are used to approximate the solution of the nonlinear differential equations by manipulating the decomposition method that was first introduced by Adomian [9, 10].
2. Adaptation of Laplace Decomposition Algorithm
We illustrate the basic idea of the Laplace decomposition algorithm by considering the following system:
With the initial condition where is first-order differential operator, and , , are linear and nonlinear operators, respectively, and , , are analytical functions.
The technique consists first of applying Laplace transform (denoted throughout this paper by ) to the system of equations in (2.1) to get
Using the properties of Laplace transform, and the initial conditions in (2.2) to get where
The Laplace decomposition algorithm admits a solution of  in the form where the terms are to be recursively computed. The nonlinear operator is decomposed as follows: and are the so-called Adomian polynomials that can be derived for various classes of nonlinearity according to specific algorithms set by Adomian [9, 10]. Substituting (2.6) and (2.7) into (2.4),and Using the linearity of Laplace transform, we get
We thus have the following recurrence relations from corresponding terms on both sides of (2.9):
Applying the inverse Laplace transform to (2.10) gives the initial approximation Substituting these values of into the inverse Laplace transform of (2.11) gives . The other terms can be obtained recursively in similar fashion from
To provide clearly a view of the analysis presented above, three illustrative systems of pantograph equations have been used to show the efficiency of this method.
3. Test Problems
Example 3.1. Consider the two-dimensional pantograph equations:
Applying the result of (2.14) gives us
The iteration formula (2.15) for this example is
Starting with an initial approximations and and use the iteration formula (3.3). We can obtain directly the other components as
Table 1 shows the absolute error of LDA with = 2, 4, and 6.
Example 3.2. Consider the system of multipantograph equations:
Let us start with an initial approximation:
The iteration formula (2.15) for this example is
Table 2 shows the absolute error of LDA with , and 3.
Example 3.3. Consider the three-dimensional pantograph equations: By (2.14) our initial approximation is
The iteration formula (2.15) for this example is where
Table 3 shows the absolute error of LDA with , and 3.
The main objective of this paper is to adapt Laplace decomposition algorithm to investigate systems of pantograph equations. We also aim to show the power of the LAD method by reducing the numerical calculation without need to any perturbations, discretization, or/and other restrictive assumptions which may change the structure of the problem being solved. LDA method gives rapidly convergent successive approximations through the use of recurrence relations. We believe that the efficiency of the LDA gives it a much wider applicability.
- J. R. Ockendon and A. B. Tayler, “The dynamics of a current collection system for an electric locomotive,” Proceedings of the Royal Society of London A, vol. 322, no. 1551, pp. 447–468, 1971.
- 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.
- S. A. Khuri, “A new approach to Bratu's problem,” Applied Mathematics and Computation, vol. 147, no. 1, pp. 131–136, 2004.
- 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, pp. 13–19, 2010.
- 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.
- 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.
- Y. Khan and N. Faraz, “Application of modified Laplace decomposition method for solving boundary layer equation,” Journal of King Saud University—Science, vol. 23, no. 1, pp. 115–119, 2011.
- E. Yusufoğlu, “Numerical solution of Duffing equation by the Laplace decomposition algorithm,” Applied Mathematics and Computation, vol. 177, no. 2, pp. 572–580, 2006.
- G. Adomian, Solving Frontier Problems of Physics: The Decomposition Method, vol. 60 of Fundamental Theories of Physics, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994.
- 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.