An acceleration theorem for the \(\rho\)-algorithm
From MaRDI portal
Publication:1923302
DOI10.1007/s002110050204zbMath0858.65001OpenAlexW2044607934MaRDI QIDQ1923302
Publication date: 25 March 1997
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050204
convergence accelerationasymptotic estimatesequence transformationrho-algorithmEuler-Maclaurin sum formula
Extrapolation to the limit, deferred corrections (65B05) Rate of convergence, degree of approximation (41A25) Approximation to limiting values (summation of series, etc.) (40A25)
Related Items (7)
Extrapolation methods for improving the convergence of oligomer calculations to the infinite chain limit of quasi-one-dimensional stereoregular polymers. ⋮ Introduction to the improved Levin-type algorithms for accelerating convergence of sequence. ⋮ Introduction to the determinantal formulae for the Levin-type algorithms ⋮ Convergence acceleration during the 20th century ⋮ Comparison of sequence accelerators for the Gaver method of numerical Laplace transform inversion ⋮ Construction of new generalizations of Wynn's epsilon and rho algorithm by solving finite difference equations in the transformation order ⋮ Transforming logarithmic to linear convergence by interpolation
This page was built for publication: An acceleration theorem for the \(\rho\)-algorithm
