New Iterative Method Based on Laplace Decomposition Algorithm
Authors:
Open Access
- 1 January 2013
- journal article
- research article
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-7
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.Keywords
Funding Information
- National Natural Science Foundation of China (11071050)
This publication has 10 references indexed in Scilit:
- A reliable treatment of Abel’s second kind singular integral equationsApplied Mathematics Letters, 2012
- Approximation Algorithm for a System of Pantograph EquationsJournal of Applied Mathematics, 2012
- He‐Laplace Method for Linear and Nonlinear Partial Differential EquationsJournal of Applied Mathematics, 2012
- The Laplace Adomian Decomposition Method for solving a model for HIV infection ofcellsMathematical and Computer Modelling, 2011
- Application of modified Laplace decomposition method for solving boundary layer equationJournal of King Saud University – Science, 2011
- An Effective Modification of the Laplace Decomposition Method for Nonlinear EquationsInternational Journal of Nonlinear Sciences and Numerical Simulation, 2009
- Variational iteration method for solving a generalized pantograph equationComputers & Mathematics with Applications, 2009
- Beyond Adomian polynomials: He polynomialsChaos, Solitons & Fractals, 2009
- A Laplace decomposition algorithm applied to a class of nonlinear differential equationsJournal of Applied Mathematics, 2001
- On Nonlinear Delay Differential EquationsTransactions of the American Mathematical Society, 1994