Numerical comparisons of nonlinear convergence accelerators

Authors:
David A. Smith and William F. Ford

Journal:
Math. Comp. **38** (1982), 481-499

MSC:
Primary 65B10; Secondary 65-04

MathSciNet review:
645665

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: As part of a continuing program of numerical tests of convergence accelerators, we have compared the iterated Aitken's method, Wynn's algorithm, Brezinski's 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 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.

**[1]**Milton Abramowitz and Irene A. Stegun,*Handbook of mathematical functions with formulas, graphs, and mathematical tables*, National Bureau of Standards Applied Mathematics Series, vol. 55, For sale by the Superintendent of Documents, U.S. Government Printing Office, Washington, D.C., 1964. MR**0167642****[2]**Richard Bellman and Robert Kalaba,*A note on nonlinear summability techniques in invariant imbedding.*, J. Math. Anal. Appl.**6**(1963), 465–472. MR**0148431****[3]**Carl M. Bender and Tai Tsun Wu,*Anharmonic oscillator*, Phys. Rev. (2)**184**(1969), 1231–1260. MR**0260323****[4]**W. G. Bickley &. J. C. P. Miller, "The numerical summation of slowly convergent series of positive terms,"*Philos. Mag.*, 7th Ser., v. 22, 1936, pp. 754-767.**[5]**E. Bodewig,*A practical refutation of the iteration method for the algebraic eigenproblem*, Math. Tables and Other Aids to Computation**8**(1954), 237–240. MR**0064479**, 10.1090/S0025-5718-1954-0064479-X**[6]**C. Brezinski, "Accélération de suites à convergence logarithmique,"*C.R. Acad. Sci. Paris Sér. A-B*, v. 273, 1971, pp. A727-A730.**[7]**Claude Brezinski,*Computation of the eigenelements of a matrix by the 𝜖-algorithm*, Linear Algebra and Appl.**11**(1975), 7–20. MR**0371044****[8]**E. Gekeler,*On the solution of systems of equations by the epsilon algorithm of Wynn*, Math. Comp.**26**(1972), 427–436. MR**0314226**, 10.1090/S0025-5718-1972-0314226-X**[9]**S. Graffi, V. Grecchi, and B. Simon,*Borel summability: application to the anharmonic oscillator*, Phys. Lett.**32B**(1970), 631–634. MR**0332068****[10]**Robert T. Gregory and David L. Karney,*A collection of matrices for testing computational algorithms*, Wiley-Interscience A Division of John Wiley & Sons, Inc., New York-London-Sydney, 1969. MR**0253538****[11]**Peter Henrici,*Elements of numerical analysis*, John Wiley & Sons, Inc., New York-London-Sydney, 1964. MR**0166900****[12]**K. Iguchi, "On the Aitken's -process,"*Inform. Process. in Japan*, v. 15, 1975, pp. 36-40.**[13]**Ken Iguchi,*An algorithm of an acceleration process covering the Aitken 𝛿²-process*, Information Processing in Japan**16**(1976), 89–93. MR**0455267****[14]**David Levin,*Development of non-linear transformations of improving convergence of sequences*, Internat. J. Comput. Math.**3**(1973), 371–388. MR**0359261****[15]**R. S. Martin, C. Reinsch, and J. H. Wilkinson,*Handbook Series Linear Algebra: Householder’s tridiagonalization of a symmetric matrix*, Numer. Math.**11**(1968), no. 3, 181–195. MR**1553959**, 10.1007/BF02161841**[16]**Anthony Ralston,*A first course in numerical analysis*, McGraw-Hill Book Co., New York-Toronto-London, 1965. MR**0191070****[17]**Daniel Shanks,*Non-linear transformations of divergent and slowly convergent sequences*, J. Math. and Phys.**34**(1955), 1–42. MR**0068901****[18]**Barry Simon,*Coupling constant analyticity for the anharmonic oscillator. (With appendix)*, Ann. Physics**58**(1970), 76–136. MR**0416322****[19]**David A. Smith and William F. Ford,*Acceleration of linear and logarithmic convergence*, SIAM J. Numer. Anal.**16**(1979), no. 2, 223–240. MR**526486**, 10.1137/0716017**[20]**Milton Van Dyke,*Analysis and improvement of perturbation series*, Quart. J. Mech. Appl. Math.**27**(1974), no. 4, 423–450. MR**0468591****[21]**J. H. Wilkinson,*The use of iterative methods for finding the latent roots and vectors of matrices*, Math. Tables Aids Comput.**9**(1955), 184–191. MR**0079833**, 10.1090/S0025-5718-1955-0079833-0**[22]**J. Wimp,*Toeplitz arrays, linear sequence transformations and orthogonal polynomials*, Numer. Math.**23**(1974), 1–17. MR**0359260****[23]**P. Wynn,*On a device for computing the 𝑒_{𝑚}(𝑆_{𝑛}) tranformation*, Math. Tables Aids Comput.**10**(1956), 91–96. MR**0084056**, 10.1090/S0025-5718-1956-0084056-6

Retrieve articles in *Mathematics of Computation*
with MSC:
65B10,
65-04

Retrieve articles in all journals with MSC: 65B10, 65-04

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1982-0645665-1

Keywords:
Acceleration of convergence,
iterated Aitken's ,
algorithm,
algorithm,
Levin's transforms,
linear convergence,
logarithmic convergence,
power series,
Fourier series,
power method,
Bernoulli's method,
asymptotic series,
perturbation series,
numerical tests

Article copyright:
© Copyright 1982
American Mathematical Society