Journal Article (Journal Article)

The authors describe and compare five methods for extrapolating to the limit (or anti-limit) of a vector sequence without explicit knowledge of the sequence generator. The methods are the minimal polynomial extrapolation (MPE); the reduced rank extrapolation (RRE); the vector and scalar versions of the epsilon algorithm (VEA, SEA); and the topological epsilon algorithm (TEA). We cover the derivation and error analysis of iterated versions of the algorithms, as applied to both linear and nonlinear problems, and we show why these versions tend to converge quadratically. We also present samples from extensive numerical testing that has led us to the following conclusions: (a) TEA, in spite of its role as a theoretical link between the polynomial-type and the epsilon-type methods, has no practical application; (b) MPE is at least as good as RRE, and VEA at least as good as SEA, in almost all situations; (c) there are circumstances in which either MPE or VEA is superior to the other.

Full Text

Duke Authors

Cited Authors

  • Smith, DA; Ford, WF; Sidi, A

Published Date

  • January 1, 1987

Published In

Volume / Issue

  • 29 / 2

Start / End Page

  • 199 - 233

International Standard Serial Number (ISSN)

  • 0036-1445

Digital Object Identifier (DOI)

  • 10.1137/1029042

Citation Source

  • Scopus