Nonlinear Sequence Transformations: Computational Tools for the Acceleration of Convergence and the Summation of Divergent Series
arXiv:math/0107080
Abstract
Convergence problems occur abundantly in all branches of mathematics or in the mathematical treatment of the sciences. Sequence transformations are principal tools to overcome convergence problems of the kind. They accomplish this by converting a slowly converging or diverging input sequence into another sequence with hopefully better numerical properties. Padé approximants, which convert the partial sums of a power series to a doubly indexed sequence of rational functions, are the best known sequence transformations, but the emphasis of the review will be on alternative sequence transformations which for some problems provide better results than Padé approximants.
29 pages, LaTeX, 0 figures
References in corpus (8)
- Calculation of the Electron Self Energy for Low Nuclear Charge
- Numerical Evidence that the Perturbation Expansion for a Non-Hermitian -Symmetric Hamiltonian is Stieltjes
- Convergence Acceleration via Combined Nonlinear-Condensation Transformations
- Scalar Levin-Type Sequence Transformations
- Prediction Properties of Aitken's Iterated Delta^2 Process, of Wynn's Epsilon Algorithm, and of Brezinski's Iterated Theta Algorithm
- Asymptotic Improvement of Resummation and Perturbative Predictions in Quantum Field Theory
- Iterative Solution of the Ornstein-Zernike Equation with Various Closures Using Vector Extrapolation
- Irregular Input Data in Convergence Acceleration and Summation Processes: General Considerations and Some Special Gaussian Hypergeometric Series as Model Problems