Skip to main content
Log in

Particular rules for the vector ε-algorithm

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

The aim of this paper is to give a singular rule for the vector ε-algorithm. This singular rule avoids a too rapid growth of rounding errors when applying the vector ε-algorithm. Another rule is given which works when two adjacent vectors are equal.

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. Brezinski, C.: Some results in the theory of the vector ε-algorithm. Linear Algebra8, 77–86 (1974)

    Google Scholar 

  2. Brezinski, C.: Computation of the eigenelements of a matrix by the ε-algorithm. Linear Algebra11, 7–20 (1975)

    Google Scholar 

  3. Wynn, P.: Singular rules for certain nonlinear algorithms. B.I.T.3, 175–195 (1963)

    Google Scholar 

  4. Wynn, P.: Acceleration techniques for iterated vector and matrix problems. Math. Comp.16, 301–322 (1962)

    Google Scholar 

  5. Wynn, P.: A numerical method for estimating parameters in mathematical models. Centre de Recherches Mathématiques, Université de Montréal, CRM-443 (1974)

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cordellier, F. Particular rules for the vector ε-algorithm. Numer. Math. 27, 203–207 (1977). https://doi.org/10.1007/BF01396640

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation