The E-algorithm and the Ford–Sidi algorithm
The E-algorithm and the Ford–Sidi algorithm are two general extrapolation algorithms. It is proved that the E-algorithm and the Ford–Sidi algorithm are mathematically (although not operationally) equivalent. A slightly more economical algorithm is given. Operation counts are discussed.
Saved in:
| Published in | Journal of Computational and Applied Mathematics Vol. 122; no. 1; pp. 223 - 230 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English Japanese |
| Published |
Elsevier B.V
01.10.2000
Elsevier BV |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0377-0427 1879-1778 |
| DOI | 10.1016/S0377-0427(00)00366-6 |
Cover
| Summary: | The
E-algorithm and the Ford–Sidi algorithm are two general extrapolation algorithms. It is proved that the
E-algorithm and the Ford–Sidi algorithm are mathematically (although not operationally) equivalent. A slightly more economical algorithm is given. Operation counts are discussed. |
|---|---|
| ISSN: | 0377-0427 1879-1778 |
| DOI: | 10.1016/S0377-0427(00)00366-6 |