The \(E\)-algorithm and the Ford-Sidi algorithm (Q1590784)
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: The E-algorithm and the Ford-Sidi algorithm |
scientific article; zbMATH DE number 1548083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(E\)-algorithm and the Ford-Sidi algorithm |
scientific article; zbMATH DE number 1548083 |
Statements
The \(E\)-algorithm and the Ford-Sidi algorithm (English)
0 references
21 December 2000
0 references
Two methods for the acceleration of convergence of sequences are compared, the \(E\)-algorithm and the Ford-Sidi algorithm [cf. \textit{W. F. Ford} and \textit{A. Sidi}, SIAM J. Numer. Anal. 24, 1212-1232 (1987; Zbl 0627.65001)]. The number of arithmetic operations of these is given, and a new algorithm is presented which is slightly more efficient than that of Ford and Sidi.
0 references
convergence acceleration
0 references
\(E\)-algorithm
0 references
Ford-Sidi algorithm
0 references
0.8196786642074585
0 references
0.8184002637863159
0 references
0.801683247089386
0 references
0.790402352809906
0 references
0.7881084680557251
0 references
