Skip to main content
SpringerLink
Log in

Upon systems of recursions which obtain among the quotients of the Padé table

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Padé, H.: Sur la représentation approchés d'une fonction par des fractions rationelles. Ann. Ec. Norm. Sup.3, 9 (1892).

    Google Scholar 

  2. Frobenius, G.: Relationen zwischen den Näherungsbrüchen von Potenzreihen. Jour. für Math.90, 6 (1881).

    Google Scholar 

  3. Jacobi, C. G. J.: Von gebrochnen rationalen Funktionen. Jour. reine angew. Math.30, 127 (1845).

    Google Scholar 

  4. Wynn, P.: On a device for computing thee m (S n ) transformation. MTAC10, 91 (1956)

    Google Scholar 

  5. ——, L'ɛ-algoritmo e la tavola di Padé. Rend. di Mat. Roma20, 403 (1961).

    Google Scholar 

  6. ——, Singular rules for certain non-linear algorithms. Nord Tid. for Inf. Beh.3, 175 (1963).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Research Center, University of Wisconsin, 53706, Madison, Wisconsin, USA

    P. Wynn

Authors
  1. P. Wynn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wynn, P. Upon systems of recursions which obtain among the quotients of the Padé table. Numer. Math. 8, 264–269 (1966). https://doi.org/10.1007/BF02162562

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation