New iterative method based on Laplace decomposition algorithm (Q2375478): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59002604, #quickstatements; #temporary_batch_1704783578975 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59002604 / rank | |||
Normal rank | |||
Revision as of 08:05, 9 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New iterative method based on Laplace decomposition algorithm |
scientific article |
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
