Construction of New Generalizations of Wynn's Epsilon and Rho Algorithm by Solving Finite Difference Equations in the Transformation Order
arXiv:1903.10198
Abstract
We construct new sequence transformations based on Wynn's epsilon and rho algorithms. The recursions of the new algorithms include the recursions of Wynn's epsilon and rho algorithm and of Osada's generalized rho algorithm as special cases. We demonstrate the performance of our algorithms numerically by applying them to some linearly and logarithmically convergent sequences as well as some divergent series.
arXiv comment32 pages, LaTeX2e, 0 figures
References in corpus (6)
- From Useful Algorithms for Slowly Convergent Series to Physical Predictions Based on Divergent Perturbative Expansions
- Scalar Levin-Type Sequence Transformations
- On the role of power expansions in quantum field theory
- Prediction Properties of Aitken's Iterated Delta^2 Process, of Wynn's Epsilon Algorithm, and of Brezinski's Iterated Theta Algorithm
- The strange history of B functions or how theoretical chemists and mathematicians do (not) interact
- Verallgemeinerte Summationsprozesse als numerische Hilfsmittel für quantenmechanische und quantenchemische Rechnungen