Prediction proberties of Aitken's iterated ^2 process, of Wynn's epsilon algorithm, and of Brezinski's iterated theta algorithm

From MaRDI portal
Publication:1590791

DOI10.1016/S0377-0427(00)00363-0zbMATH Open0974.65002arXivmath/0002111OpenAlexW1965260121MaRDI QIDQ1590791FDOQ1590791


Authors: Ernst Joachim Weniger Edit this on Wikidata


Publication date: 29 November 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: The prediction properties of Aitken's iterated Delta^2 process, Wynn's epsilon algorithm, and Brezinski's iterated theta algorithm for (formal) power series are analyzed. As a first step, the defining recursive schemes of these transformations are suitably rearranged in order to permit the derivation of accuracy-through-order relationships. On the basis of these relationships, the rational approximants can be rewritten as a partial sum plus an appropriate transformation term. A Taylor expansion of such a transformation term, which is a rational function and which can be computed recursively, produces the predictions for those coefficients of the (formal) power series which were not used for the computation of the corresponding rational approximant.


Full work available at URL: https://arxiv.org/abs/math/0002111




Recommendations




Cites Work


Cited In (28)





This page was built for publication: Prediction proberties of Aitken's iterated \(\Delta^2\) process, of Wynn's epsilon algorithm, and of Brezinski's iterated theta algorithm

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