ACCELERATION BY SUBSEQUENCE TRANSFORMATIONS

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 (/?(/)) for which (yΠ(,)) will be linear for every y which converges at the same rate as or faster (slower) than a fixed sequence Λ\