Convergence Acceleration by Extraction of Linear Subsequences

Claude Brezinski, Jean-Paul Delahaye, B. Germain-Bonne · SIAM Journal on Numerical Analysis · 1983

Logarithmic sequences are usually difficult to accelerate. In this paper we show how to extract a subsequence converging linearly. This subsequence can be easily accelerated by classical algorithms. Theoretical results are given as well as an algorithmic extraction procedure. Numerical examples illustrate the results.

Read the paper · More papers on PaperTik