The E-algorithm and the Ford-Sidi algorithm

DOI10.1016/S0377-0427(00)00366-6MaRDI QIDQ1590784zbMATH OpenFDO

Authors Naoki Osada

Publication date 21 December 2000

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-0427(00)00366-6

zbMATH Keywords

\(E\)-algorithmconvergence accelerationFord-Sidi algorithm

Mathematics Subject Classification ID

Extrapolation to the limit, deferred corrections (65B05)

Review text

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.

Recommendations

• Some results on convergence acceleration for the E-algorithm
• Convergence acceleration of some logarithmic sequences
• Acceleration property for the E-algorithm and an application to the summation of series
• Acceleration property for the columns of the E-algorithm
• Acceleration results for the vector E-algorithm

Cites work

• A general extrapolation algorithm
• A general extrapolation procedure revisited
• Acceleration of Linear and Logarithmic Convergence
• An Algorithm for a Generalization of the Richardson Extrapolation Process
• Extrapolation methods theory and practice
• Generalized neville type extrapolation schemes
• Vereinfachte Rekursionen zur Richardson-Extrapolation in Spezialfällen

Cited in

(3)

• Acceleration property for the E-algorithm and an application to the summation of series
• An acceleration theorem for the \(\rho\)-algorithm
• Extended procedures for extrapolation to the limit

This page was built for publication: The \(E\)-algorithm and the Ford-Sidi algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1590784)