Acceleration by subsequence transformations

Thomas Alan Keagy and William F. Ford

Vol. 132 (1988), No. 2, 357–362

DOI: 10.2140/pjm.1988.132.357

Abstract

The acceleration field of subsequence matrix transformations are studied with respect to the convergence rate of the sequence being accelerated. Included is a proof that no subsequencing algorithm exists which will determine a set of subscripts (n(i)) for which (y_n(i)) will be linear for every y which converges at the same rate as or faster (slower) than a fixed sequence x.

Mathematical Subject Classification 2000

Primary: 65B10

Secondary: 40D20

Milestones

Received: 23 February 1987

Published: 1 April 1988