On two methods for accelerating convergence of series

DOI10.1007/BF01390184zbMath0518.65001MaRDI QIDQ1054114

Bruno Gabutti

Publication date: 1984

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132912

zbMATH Keywords

uniform convergenceentire functionEuler-Knopp transformationestimates of the remaindercompact recursive algorithmcompletely monotonic coefficients

Mathematics Subject Classification ID

Numerical summation of series (65B10)

Related Items (6)

Generalized Faber polynomials and an optimal error recovery algorithm ⋮ A new transformation for computing hypergeometric series and the exact evaluation of the transonic adiabatic flow over a smooth bump ⋮ An algorithm for computing generalized Euler's transformations of series ⋮ Accelerated polynomial approximation of finite order entire functions by growth reduction ⋮ Stable convergence acceleration using Laplace transforms ⋮ Some generalizations of the Euler-Knopp transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical application of Euler's series transformation and its generalizations
• Convergence acceleration on a general class of power series
• Truncation error bounds for g-fractions
• An Acceleration Method for the Power Series of Entire Functions of Order 1
• On High Precision Methods for Computing Integrals Involving Bessel Functions
• The T +m Transformation
• A note on the generalised Euler transformation
• Continued Fractions and Totally Monotone Sequences
• ON THE ZEROS OF THE RIEMANN ZETA FUNCTION

This page was built for publication: On two methods for accelerating convergence of series