New Iterative Method Based on Laplace Decomposition Algorithm
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 o...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/286529 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832550736348577792 |
---|---|
author | Sabir Widatalla M. Z. Liu |
author_facet | Sabir Widatalla M. Z. Liu |
author_sort | Sabir Widatalla |
collection | DOAJ |
description | 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. |
format | Article |
id | doaj-art-f2a64147a6ba48d38fd71cb277aee7b8 |
institution | Kabale University |
issn | 1110-757X 1687-0042 |
language | English |
publishDate | 2013-01-01 |
publisher | Wiley |
record_format | Article |
series | Journal of Applied Mathematics |
spelling | doaj-art-f2a64147a6ba48d38fd71cb277aee7b82025-02-03T06:06:09ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/286529286529New Iterative Method Based on Laplace Decomposition AlgorithmSabir Widatalla0M. Z. Liu1Department of Mathematics, Harbin Institute of Technology, Harbin 150001, ChinaDepartment of Mathematics, Harbin Institute of Technology, Harbin 150001, ChinaWe 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.http://dx.doi.org/10.1155/2013/286529 |
spellingShingle | Sabir Widatalla M. Z. Liu New Iterative Method Based on Laplace Decomposition Algorithm Journal of Applied Mathematics |
title | New Iterative Method Based on Laplace Decomposition Algorithm |
title_full | New Iterative Method Based on Laplace Decomposition Algorithm |
title_fullStr | New Iterative Method Based on Laplace Decomposition Algorithm |
title_full_unstemmed | New Iterative Method Based on Laplace Decomposition Algorithm |
title_short | New Iterative Method Based on Laplace Decomposition Algorithm |
title_sort | new iterative method based on laplace decomposition algorithm |
url | http://dx.doi.org/10.1155/2013/286529 |
work_keys_str_mv | AT sabirwidatalla newiterativemethodbasedonlaplacedecompositionalgorithm AT mzliu newiterativemethodbasedonlaplacedecompositionalgorithm |