Two Numerical Methods to Solve the Second Order Multi-pantograph Equation with Boundary Conditions

Mahdi Ahmadinia^1, and Zeinab Safari¹

¹Department Mathematics, University of Qom, Qom, Iran

Cite this paper:
Mahdi Ahmadinia and Zeinab Safari. Two Numerical Methods to Solve the Second Order Multi-pantograph Equation with Boundary Conditions. Applied Mathematics and Physics. 2014; 2(4):124-127. doi: 10.12691/amp-2-4-1

Abstract

In this article, we present two numerical methods to solve the second order multi-pantograph equation with boundary conditions. The multi-pantograph equation is converted to an integral equation then the integral equation is solved by two projective methods. Some properties of Chebyshev polynomials are employed to prove the convergence analysis of the two proposed methods. Finally, numerical examples also are given to illustrate the efficiency and validity of the two proposed methods.

Keywords:
Multi-pantograph equation Integral equation Chebyshev polynomials

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]	K. Atkinson and W. Han, Theoretical Numerical Analysis A Functional Analysis Frame-work, , 2009.
[2]	H. Brunner, Q. Huang and H. Xie,“Discontinuous Galerkin methods for delay differential equations of pantograph type,” SIAM J. Numer. Anal, 48. 1944-1967. 2010.
[3]	R. L. Burden and J. D. Faires, Numerical Analysis, Brooks/Cole, Boston, 2011.
[4]	M.Z. Liu and D. Li, “Properties of analytic solution and numerical solution of multi-pantograph equation,”Appl. Math. Comput., 155. 853-871. 2004.
[5]	A. Saadatmand and M. Dehghan, “Variational iteration method for solving a generalized pantograph equation,” Comput. Math. Appl. 58(11-12). 2190-2196. 2009.
[6]	M. Sezer and A. Akyüz-Daşcıoğlu, “A Taylor method for numerical solution of generalized pantograph equations with linear functional argument,”J. Comput. Appl. Math., 200. 217-225. 2007.
[7]	M. Sezer, S. Yalçinbaş and M. Gülsu,“A Taylor polynomial approach for solving generalized pantograph equations with nonhomogeneous term,” Int. J. Comput. Math., 85(7), 1055-1063. 2008.
[8]	M. Sezer, S. Yalçinbaş and N. Şahin, “Approximate solution of multi-pantograph equation with variable coefficients,” J. Comput. Appl. Math., 214. 406-416. 2008.
[9]	L. N. Trefethen, “Is Gauss quadrature better than Clenshaw-Curtis?,” SIAM Review, 50. 67-87. 2008.
[10]	E.Yusufoğlu, “An efficient algorithm for solving generalized pantograph equations with linear function alargument,” Appl. Math. Comput, 217(7). 3591-3595. 2010.
[11]	Ş. Yüzbaşi, “An efficient algorithm for solving multi-pantograph equations systems,” Comput. Math. Appl, 64, 589-603, 2012.
[12]	S.Yüzbaşi, N. Şahin, and M. Sezer. “A Bessel collocation method for numerical solution of generalized pantograph equations.” Numerical Methods for Partial Differential Equations, 28(4). 1105-1123, 2012.
[13]	Ş.Yüzbaşi, N. Şahin and M. Sezer, “Numerical solutions of systems of linear Fredholm integro-differential equations with Bessel polynomial bases,” Comput. Math. Appl, 61(10), 3079-3096, 2011.
[14]	Ş.Yüzbaşi, N. Şahin and M. Sezer, “A Bessel polynomial approach for solving linear neutral delay differential equations with variable coefficients,” J. Adv. Res. Differ. Equ. 3(1). 81-101, 2011.
[15]	Z. H. Yu, “Variational iteration method for solving the multi-pantograph delay equation,” Phys. Lett. A, 372(43). 6475-6479. 2008.