Construction of New Generalizations of Wynn's Epsilon and Rho Algorithm by Solving Finite Difference Equations in the Transformation Order

DOI10.1007/S11075-019-00695-WarXiv1903.10198WikidataQ128097763 ScholiaQ128097763MaRDI QIDQ6316136FDOQ6316136

Authors: Xiangke Chang, Yi He, Xing-Biao Hu, Jian-Qing Sun, Ernst Joachim Weniger 

Publication date: 25 March 2019

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.

Mathematics Subject Classification ID

Numerical summation of series (65B10) Extrapolation to the limit, deferred corrections (65B05)

This page was built for publication: Construction of New Generalizations of Wynn's Epsilon and Rho Algorithm by Solving Finite Difference Equations in the Transformation Order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6316136)