Approximation algorithm for a system of pantograph equations (Q443049)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithm for a system of pantograph equations |
scientific article; zbMATH DE number 6063462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for a system of pantograph equations |
scientific article; zbMATH DE number 6063462 |
Statements
Approximation algorithm for a system of pantograph equations (English)
0 references
6 August 2012
0 references
Summary: We show how to adapt an efficient numerical algorithm to obtain an approximate solution of a system of pantograph equations. This algorithm is based on a combination of Laplace transform and Adomian decomposition method. Numerical examples reveal that the method is quite accurate and efficient, it approximates the solution to a very high degree of accuracy after a few iterates.
0 references
0 references
0 references
0.8333925604820251
0 references
0.8293423652648926
0 references
0.7984113097190857
0 references
0.7975977063179016
0 references
0.795167088508606
0 references
