Enhanced and Generalized One-Step Neville Algorithm: Fractional Powers and Access to the Convergence Rate
arXiv:2403.09586 · doi:10.1016/j.cpc.2024.109280
Abstract
The recursive Neville algorithm allows one to calculate interpolating functions recursively. Upon a judicious choice of the abscissas used for the interpolation (and extrapolation), this algorithm leads to a method for convergence acceleration. For example, one can use the Neville algorithm in order to successively eliminate inverse powers of the upper limit of the summation from the partial sums of a given, slowly convergent input series. Here, we show that, for a particular choice of the abscissas used for the extrapolation, one can replace the recursive Neville scheme by a simple one-step transformation, while also obtaining access to subleading terms for the transformed series after convergence acceleration. The matrix-based, unified formulas allow one to estimate the rate of convergence of the partial sums of the input series to their limit. In particular, Bethe logarithms for hydrogen are calculated to 100 decimal digits. Generalizations of the method to series whose remainder terms can be expanded in terms of inverse factorial series, or series with half-integer powers, are also discussed.
arXiv comment17 pages; RevTeX
References in corpus (7)
- From Useful Algorithms for Slowly Convergent Series to Physical Predictions Based on Divergent Perturbative Expansions
- Calculation of the Electron Self Energy for Low Nuclear Charge
- Convergence Acceleration via Combined Nonlinear-Condensation Transformations
- Resummation of Nonalternating Divergent Perturbative Expansions
- Implementation of the Combined--Nonlinear Condensation Transformation
- Two-Loop Corrections to the Large-Order Behavior of Correlation Functions in the One-Dimensional N-Vector Model
- Correlation Functions of the Anharmonic Oscillator: Numerical Verification of Two-Loop Corrections to the Large-Order Behavior