New iterative method based on Laplace decomposition algorithm (Q2375478): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jam/WidatallaL13, #quickstatements; #temporary_batch_1731475607626 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jam/WidatallaL13 / rank | |||
Normal rank | |||
Latest revision as of 07:01, 13 November 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
0 references
0 references
