A general extrapolation procedure revisited
- 48 Downloads
TheE-algorithm is the most general extrapolation algorithm actually known. The aim of this paper is to provide a new approach to this algorithm. This approach gives a deeper insight into theE-algorithm, and allows one to obtain new properties and to relate it to other algorithms. Some extensions of the procedure are discussed.
KeywordsConvergence acceleration extrapolation
AMS(MOS) subject classification65B05
Unable to display preview. Download preview PDF.
- B. Beckermann, A connection between theE-algorithm and the epsilon-algorithm, in:Numerical and Applied Mathematics, ed. C. Brezinski (Baltzer, Basel, 1989) pp. 443–446.Google Scholar
- C. Brezinski, Algebraic properties of theE-transformation, in:Numerical Analysis and Mathematical Modelling, Banach Center Publications, Vol. 24 (PWN, Warsaw, 1990) pp. 85–90.Google Scholar
- C. Brezinski and A.C. Matos, A derivation of extrapolation algorithms based on error estimates, J. Comput. Appl. Math., to appear.Google Scholar
- C. Brezinski and A. Salam, Matrix and vector sequence transformations revisited, submitted.Google Scholar
- C. Carstensen, On a general epsilon algorithm, in:Numerical and Applied Mathematics, ed. C. Brezinski (Baltzer, Basel, 1989) pp. 437–441.Google Scholar
- G. Mühlbach, Neville-Aitken algorithms for interpolation by functions of Čebyšev-systems in the sense of Newton and in a generalized sense of Hermite, in:Theory of Approximation, with Applications, ed. A.G. Law and B.N. Sahney(Academic Press, New York, 1967) pp. 200–212.Google Scholar