Approximation algorithm for a system of pantograph equations (Q443049): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q58907217, #quickstatements; #temporary_batch_1704771653347 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58907217 / rank | |||
Normal rank | |||
Revision as of 05:42, 9 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithm for a system of pantograph equations |
scientific article |
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
