Numerical comparisons of nonlinear convergence accelerators


Journal Article

As part of a continuing program of numerical tests of convergence accelerators, we have compared the iterated Aitken’s A2 method, Wynn’s e algorithm, Brezinski’s 0 algorithm, and Levin’s u transform on a broad range of test problems: linearly convergence alternating, monotone, and irregular-sign series, logarithmically convergent series, power method and Bernoulli method sequences, alternating and monotone asymptotic series, and some perturbation series arising in applications. In each category either the e algorithm or the u transform gives the best results of the four methods tested. In some cases differences among methods are slight, and in others they are quite striking. © 1982 American Mathematical Society.

Full Text

Duke Authors

Cited Authors

  • Smith, DA; Ford, WF

Published Date

  • January 1, 1982

Published In

Volume / Issue

  • 38 / 158

Start / End Page

  • 481 - 499

International Standard Serial Number (ISSN)

  • 0025-5718

Digital Object Identifier (DOI)

  • 10.1090/S0025-5718-1982-0645665-1

Citation Source

  • Scopus