Particular rules for the -algorithm

DOI10.1007/BF02141943MaRDI QIDQ688135zbMATH OpenFDO

Authors Michela Redivo-Zaglia

Publication date 31 August 1994

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02141943

zbMATH Keywords

convergence accelerationextrapolation algorithmnumerical examplesnumerical stabilityrounding errorstheta-algorithm

Mathematics Subject Classification ID

Extrapolation to the limit, deferred corrections (65B05)

Review text

Convergence acceleration methods are very useful tools which make it often possible to use sequences and series that converge slowly. The \(\Theta\)-algorithm is an extrapolation algorithm which can be very useful in accelerating some slowly convergent sequences. Like the other acceleration algorithms, the \(\Theta\)-algorithm is quite sensitive to the propagation of rounding errors due to cancellation in the difference between two almost equal quantities. In order to avoid partially this drawback, particular rules are given. They have to be used, instead of the usual of the algorithm, when two adjacent quantities in a column are nearly equal. Numerical examples show that these rules can improve the numerical stability of the algorithm in some cases while, in other cases, the improvement is non-existent.

Recommendations

• On the acceleration of two classes of sequences by the \(\widehat{\Theta}\)-algorithm
• Some results of convergence acceleration for a general \(\Theta\)-type algorithm
• An acceleration theorem for the \(\rho\)-algorithm
• Accelerated convergence of sequences of quadrature approximations
• A Convergence Acceleration Method for Some Logarithmically Convergent Sequences

Cites work

• Acceleration of Linear and Logarithmic Convergence
• Extrapolation methods theory and practice
• scientific article; zbMATH DE number 3393634 (Why is no real title available?)
• Numerical Comparisons of Nonlinear Convergence Accelerators
• Other manifestations of the Schur complement
• Particular rules for the vector -algorithm
• Rational approximations for the modified Bessel function of the second kind
• Singular rules for certain non-linear algorithms
• The Reverse Bordering Method

Cited in

(4)

• On the acceleration of two classes of sequences by the \(\widehat{\Theta}\)-algorithm
• Comparison of four nonlinear transforms on some classes of logarithmic fixed point sequences
• Convergence acceleration during the 20th century
• Some results of convergence acceleration for a general \(\Theta\)-type algorithm

This page was built for publication: Particular rules for the \(\Theta\)-algorithm

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