Skip to main content
Log in

Acceleration property for the columns of the E-algorithm

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

A convergence acceleration result for the E-algorithm is proved for sequences such that the error has an asymptotic expansion on a scale of comparison for which a determinantal relation holds. This result is also generalized to the vector case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C. Brezinski, A general extrapolation algorithm, Numer. Math. 35 (1980) 175–187.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Brezinski, The asymptotic behaviour of sequences and new series transformations based on the Cauchy product, Rocky Mt. J. Math. 21 (1991).

  3. S. Karlin,Total Positivity, vol. 1 (Stanford U. Press, Stanford, 1962).

    Google Scholar 

  4. A.C. Matos, Acceleration results for the vector E-algorithm, Num. Algorithms 1 (1991) 237–260.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by C. Brezinski

Rights and permissions

Reprints and permissions

About this article

Cite this article

Matos, A.C., Prévost, M. Acceleration property for the columns of the E-algorithm. Numer Algor 2, 393–408 (1992). https://doi.org/10.1007/BF02139476

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02139476

Keywords

Navigation