Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

A hierarchically consistent, iterative sequence transformation

  • 44 Accesses

  • 15 Citations


Recently, the author proposed a new nonlinear sequence transformation, the iterative\(J\) transformation, which was shown to provide excellent results in several applications (Homeier [15]). In the present contribution, this sequence transformation is derived by a hierarchically consistent iteration of some basic transformation. Hierarchical consistency is proposed as an approach to control the well-known problem that the basic transformation can be generalized in many ways. Properties of the\(J\) transformation are studied. It is of similar generality as the well-knownE algorithm (Brezinski [3], Håvie [18]). It is shown that the\(J\) transformation can be implemented quite easily. In addition to the defining representation, there are alternative algorithms for its computation based on generalized differences. The kernel of the\(J\) transformation is derived. The expression for the kernel is relatively compact and does not depend on any lower-order transforms. It is shown that several important other sequence transformations can be computed in an economical way using the\(J\) transformation.

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


  1. [1]

    A. C. Aitken, On Bernoulli's numerical solution of algebraic equations, Proc. Roy. Soc. Edinburgh 46 (1926) 289–305.

  2. [2]

    P. Bjørstad, G. Dahlquist and E. Grosse Extrapolation of asymptotic expansions by a modified\(J\) formula, BIT 21 (1981) 56–65.

  3. [3]

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

  4. [4]

    C. Brezinski, A new approach to convergence acceleration methods, in:Nonlinear Numerical Methods and Rational Approximation, ed. A. Cuyt (Reidel, Dordrecht, 1988) pp. 373–405.

  5. [5]

    C. Brezinski, Quasi-linear extrapolation processes, in:Numerical Mathematics, Singapore 1988, eds. R.P. Agarval et al., International Series of Numerical Mathematics, Vol. 86 (Birkhäuser, Basel, 1988) pp. 373–405.

  6. [6]

    C. Brezinski and A. C. Matos, A derivation of extrapolation algorithms based on error estimates, Publication ANO-319, Université de Lille (1993), J. Comput. Appl. Math., to appear.

  7. [7]

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

  8. [8]

    C. Brezinski and M. Redivo Zaglia, A general extrapolation procedure revisited, Publication ANO-306, Université de Lille (1993), Adv. Comput. Math., to appear.

  9. [9]

    C. Brezinski and M. Redivo Zaglia, On the kernel of sequence transformations, Publication ANO-309, Université de Lille (1993), Appl. Numer. Math., to appear.

  10. [10]

    C. Brezinski and G. Walz, Sequences of transformations and triangular recursion schemes, with applications in numerical analysis. J. Comput. Appl. Math. 34 (1991) 361–383.

  11. [11]

    J. P. Delahaye and B. Germain-Bonne, Résultats négatifs en accélération de la convergence, Numer. Math. 35 (1980) 443–457.

  12. [12]

    W. F. Ford and A. Sidi, An algorithm for a generalization of the Richardson extrapolation process, SIAM J. Numer Anal. 24 (1988) 1212–1232.

  13. [13]

    B. Germain-Bonne, Transformations de suites, Rev. Française Automat. Rech. Operat. 7 (R-1) (1973) 84–90.

  14. [14]

    P. Hillion, Méthode d'Aitken itérée pour les suites oscillantes d'approximations, C. R. Acad. Sci. Paris A 280 (1975) 1701–1704.

  15. [15]

    H. H. H. Homeier, Some applications of nonlinear convergence accelerators, Int. J. Quantum Chem. 45 (1993) 545–562.

  16. [16]

    H. H. H. Homeier, Analytical and numerical studies of the convergence behavior of the\(J\) transformation. J. Comput. Appl. Math., submitted.

  17. [17]

    H. H. H. Homeier, Determinantal representations for the\(J\) transformation, Numer. Math., submitted.

  18. [18]

    T. Havie, Generalized Neville type extrapolation schemes, BIT 19 (1979) 204–213.

  19. [19]

    D. Levin, Development of non-linear transformations for improving convergence of sequences, Int. J. Comput. Math. B. 3 (1973) 371–388.

  20. [20]

    A. Sidi, An algorithm for a special case of a generalization of the Richardson extrapolation process, Numer. Math. 38 (1982) 299–307.

  21. [21]

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

  22. [22]

    J. Stoer,Einführung in die Numerische Mathematik I (Springer, Berlin, 1983).

  23. [23]

    E. J. Weniger, Nonlinear sequence transformations for the acceleration of convergence and the summation of divergent series. Comput. Phys. Rep. 10 (1989) 189–373.

  24. [24]

    E. J. Weniger, On the derivation of iterated sequence transformations for the acceleration of convergence and the summation of divergent series. Comput. Phys. Commun. 64 (1991) 19–45.

  25. [25]

    E. J. Weniger, Interpolation between sequence transformations. Numer. Algor. 3 (1992) 477–486.

  26. [26]

    J. Wimp,Sequence Transformations and Their Applications (Academic Press, New York, 1981).

  27. [27]

    P. Wynn, On a Procrustean technique for the numerical transformation of slowly convergent sequences and series. Proc. Cambridge Phil. Soc. 52 (1956) 663–671.

Download references

Author information

Additional information

Communicated by C. Brezinski

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Homeier, H.H.H. A hierarchically consistent, iterative sequence transformation. Numer Algor 8, 47–81 (1994).

Download citation


  • Convergence acceleration
  • extrapolation
  • summation
  • hierarchical consistency
  • model sequences
  • iterative transformations
  • Levin-type transformations
  • E algorithm
  • generalized difference schemes
  • operator method

AMS subject classification

  • AMS(MOS)
  • 65B05
  • 65B10