Invariants associated with the epsilon algorithm and its first confluent form

Article

Summary

It is shown that if numbers εr(m)(r=0, 1, ..., 2n;m=0, 1, ...) can be constructed from the initial values εr(m)=0 (m=1, 2, ...), εr(m)=Sm (m=0, 1, ...) by systematic use of the relationships εr+1(m)r-1(m+1)+(εr(m+D)r(m))–1 (r=0, 1, ..., 2n-1;m=0, 1, …) and an irreducible relationship of the form\(\sum\limits_{v = o}^n {C_v S_{m + v} = G} \). (m=0, 1, ...) withG=0 holds among the members of the sequence {Sm}, then\(\sum\limits_{r = o}^{2n - 2} {( - 1)^r \varepsilon _r^{(m)} \varepsilon _{r + 1}^{(m)} = - \frac{{\left\{ {\sum\limits_{v = 1}^n {vCv} } \right\}}}{{\left\{ {\sum\limits_{v = 0}^n {Cv} } \right\}}}} \) (m=0, 1, ...) Furthermore, if functions εr(μ) (r=0, 1, ..., 2n) are constructed from the initial values ε–1(μ)=0, ε0(μ)=S(μ) by systematic use of the relationships\(\varepsilon _{r + 1} (\mu ) = \varepsilon _{r - 1} (\mu ) + \left\{ {\frac{{d\varepsilon _r (\mu )}}{{d\mu }}} \right\}^{ - 1} \) (r=0, 1, ..., 2n–1) and the functionsS (μ) satisfies an irreducible equation of the form\(\sum\limits_{v = 0}^n {c_v \frac{{d^v S(\mu )}}{{d\mu ^v }} = G} \) withG=0, then\(\sum\limits_{r = 0}^{2n - 2} {( - 1)^r \varepsilon _r (\mu )\varepsilon _{r + 1} (\mu ) = - \frac{{c_1 }}{{c_0 }}} \) identically.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Wynn P.,On a device for computing the e m(Sn)transformation, Math. of Comp., 10 (1956), 91–96.MATHMathSciNetCrossRefGoogle Scholar
  2. [2]
    Jacobi C. G. J.,Über die Darstellung einer Reihe gegebener Werthe durch eine gebrochnen retionale Funktion, Journ. f. d. reine u. angew. Math., 30 (1845), 127–156.Google Scholar
  3. [3]
    Padé H.,Sur la représentation approchée d’une fonction par des fractions rationelles, Ann. Sci. Ecole Norm. Sup., 9 (1892), 1–93 (supplément).Google Scholar
  4. [4]
    Perron O.,Die Lehre von den Kettenbrüchen, Teubner, Stuttgart (1957).MATHGoogle Scholar
  5. [5]
    Wall H. S.,Analytic theory of continued fractions, Van Nostrand, New York (1948).MATHGoogle Scholar
  6. [6]
    de Montessus de Ballore R.,Sur les fractions continues algébriques, Bull. Soc. Math. de France, 30 (1902), 28–36.MATHGoogle Scholar
  7. [7]
    Hadamard J.,Essai sur l’étude des fonctions données par leur développement de Taylor, Jour. Math., 8 (1892), 101–186.Google Scholar
  8. [8]
    Markoff A.,Deux démonstrations de la convergence de certaines fractions continues. Acta Math., 19 (1895), 93–104.CrossRefMathSciNetGoogle Scholar
  9. [9]
    Stieltjes T. J.,Recherches sur les fractions continues, Ann. Fac. Sci. de Toulouse, 8 (1894), 1–122; 9 (1895), 1–47.MathSciNetGoogle Scholar
  10. [10]
    Hamburger H.,Ueber eine Erweiterung des Stieltjes’schen Momentenproblem, Math. Ann., 81 (1920), 235–319; 82 (1921), 120–164, 168–187.CrossRefMathSciNetGoogle Scholar
  11. [11]
    Nevanlinna R.,Asymptotische Entwickelungen beschränkter Funktionen und das Stieltjes’sche Momentenproblem, Ann. Acad. Sci. Fenn., Ser. A 18 (1922).Google Scholar
  12. [12]
    Wynn P.,Upon a convergence result in the theory of the Padé table, Trans. Amer. Math. Soc., 165 (1972), 239–249.MATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    Wynn P.,On confluent forms of certain non-linear algorithms, Arch. d. Math., 11 (1960), 223–236.MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Wynn P.,A note on a confluent form of the ε-algorithm, Arch. d. Math., 11 (1960), 237–240.MATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    Wynn P.,Upon the definition of an integral as the limit of a continued fraction, Arch. Rat. Mech. Anal., 28 (1968), 83–148.MATHCrossRefMathSciNetGoogle Scholar
  16. [16]
    Brezinski C.,Convergence d’une forme confluente de l’ε-algorithme, Comptes Rend. Acad. Sci., Ser. A, 273 (1971), 581.Google Scholar
  17. [17]
    Aitken A. C.,Determinants and matrices (6th Ed.), Oliver and Boyd, Edinburgh, (1949).MATHGoogle Scholar
  18. [18]
    Hankel G.,Über eine besondere Klasse der symmetrischen Determinanten (Leipzig dissertation), Gottingen (1861).Google Scholar
  19. [19]
    Bauer F. L.,Connections between the q—d algorithm of Rutishauser and the ε-algorithm of Wynn, Deutsche Forschungsgemeinschaft Tech. Report Ba/106, (1957).Google Scholar

Copyright information

© Springer 1972

Authors and Affiliations

  • P. Wynn
    • 1
  1. 1.MontréalCanada

Personalised recommendations