New iterative method based on Laplace decomposition algorithm (Q2375478)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6175790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New iterative method based on Laplace decomposition algorithm |
scientific article; zbMATH DE number 6175790 |
Statements
New iterative method based on Laplace decomposition algorithm (English)
0 references
14 June 2013
0 references
Summary: 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.
0 references
0 references
0 references
0.7842365503311157
0 references
0.7777594327926636
0 references
0.7777202725410461
0 references
0.769436240196228
0 references
0.7640490531921387
0 references
