Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Particular rules for the Θ-algorithm

  • 37 Accesses

  • 5 Citations


The Θ-algorithm is an extrapolation algorithm which can be very useful in accelerating some slowly convergent sequences. Like the other acceleration algorithms, the Θ-algorithm is quite sensitive to the propagation of rounding errors due to cancellation in the difference between two almost equal quantities.

In order to (partially) avoid this drawback, particular rules are given. They have to be used, instead of the usual rules of the algorithm, when two adjacent quantities in a column are nearly equal. Numerical examples show that these rules can improve the numerical stability of the algorithm in some cases while, in other cases, the improvement is non-existent.

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


  1. [1]

    C. Brezinski, Accélération de suites à convergence logarithmique, C.R. Acad. Sci. Paris 273 (1971) A: 727–730.

  2. [2]

    C. Brezinski,Algorithmes d'Accélération de la Convergence — Etude Numérique (Editions Technip, Paris, 1978).

  3. [3]

    C. Brezinski, Other manifestations of the Schur complement, Lin. Alg. Appl. 111 (1988) 231–247.

  4. [4]

    C. Brezinski and M. Redivo Zaglia,Extrapolation Methods. Theory and Practice (North-Holland, Amsterdam, 1991).

  5. [5]

    C. Brezinski, M. Morandi Cecchi and M. Redivo Zaglia, The reverse bordering method, SIAM J. Matrix Anal. Appl., to appear.

  6. [6]

    F. Cordellier, Démonstration algébrique de l'extension de l'identité de Wynn aux tables de Padé non normales, in:Padé Approximation and its Applications, ed. L. Wuytack, Lecture Notes in Mathematics, vol. 765 (Springer, Berlin, 1979) pp. 36–60.

  7. [7]

    F. Cordellier, Particular rules for the vector ɛ-algorithm, Numer. Math. 27 (1977) 203–207.

  8. [8]

    D.A. Smith and W.F. Ford, Acceleration of linear and logarithmic convergence, SIAM J. Numer. Anal. 16 (1979) 223–240.

  9. [9]

    D.A. Smith and W.F. Ford, Numerical comparison of nonlinear convergence accelerators, Math. Comput. 38 (1982) 481–499.

  10. [10]

    E.J. Weinger and J. Čížek, Rational approximations for the modified Bessel function of the second kind, Comput. Phys. Commun. 59 (1990) 471–493.

  11. [11]

    P. Wynn, Singular rules for certain nonlinear algorithms, BIT 3 (1963) 175–195.

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Redivo Zaglia, M. Particular rules for the Θ-algorithm. Numer Algor 3, 353–369 (1992). https://doi.org/10.1007/BF02141943

Download citation

AMS(MOS) subject classifications

  • 65B05
  • 65G05


  • Acceleration
  • extrapolation methods
  • rounding errors