Convergence Acceleration by Extraction of Linear Subsequences

Abstract

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.