Skip to main content
SpringerLink
Log in

Recursive algorithms for the Padé table : Two approaches

  • B. Computation Of Padé Approximants And Related Topics
  • Conference paper
  • First Online:
Padé Approximation and its Applications

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 765))

Abstract

In [14], a relation is given between the Viskovatoff algorithm for the determination of continued fractions and the triangular factorization of Hankel matrices. In this paper this idea will be further develloped to include most of the known recursive algorithms for the computation of Padé approximants. The factorization interpretation links together the continued fraction approach and the recursive Padé computation in a natural way.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akaike, "Block Toeplitz matrix inversion", SIAM J. Appl. Math. 24 (1973), 234–241.

    Article  MathSciNet  MATH  Google Scholar 

  2. G.A. Baker Jr., "Recursive calculation of Padé approximants", P.R. Graves-Morris, ed. "Padé approximants and their applications", Academic Press, London, 1973, 83–91.

    Google Scholar 

  3. V. Belevitch, "INterpolation matrices", Philips Res. Rept. 25 (1970), 337–369.

    MathSciNet  MATH  Google Scholar 

  4. C. Brezinski, "Computation of Padé approximants and continued fractions", Journ. Comp. and Appl. Math., 2, 1976, 113–123.

    Article  MathSciNet  MATH  Google Scholar 

  5. A. Bultheel, "Recursive algorithms for non-normal Padé tables", subm. for publication.

    Google Scholar 

  6. A. Bultheel, "Fast factorization algorithms and Padé approximation", subm. for publication.

    Google Scholar 

  7. A. Bultheel, "Division algorithms for continued fractions and the Padé table", subm. for publication.

    Google Scholar 

  8. A. Bultheel, "Recursive algorithms for the matrix Padé problem", subm. for publication.

    Google Scholar 

  9. D. Bussonnais, "Tous les algorithms de calcul recurrente des approximants de Padé d'une serie. Construction des fractions continues correspondantes". Séminaire d'Analyse Numérique, no 293, Grenoble, 1978.

    Google Scholar 

  10. G. Claessens, "A new look at the Padé table and the different methods for computing its elements", Journ. of Comp. and Appl. Math., 1 (1975), 141–152.

    Article  MathSciNet  MATH  Google Scholar 

  11. A. Common, "Padé-Chebyshev approximation", these proceedings.

    Google Scholar 

  12. B. Cordellier, "Deux algorithmes de calcul recursif des éléments d'une table de Padé non normale", Presented at the conference on Padé approximation, Lille, 1978.

    Google Scholar 

  13. L.S. De Jong, "Numerical aspects of recursive realization algorithm", SIAM J. Contr. and Opt., 16 (1978), 646–659.

    Article  MATH  Google Scholar 

  14. W.B. Gragg, "Matrix interpretations and applications of the continued fraction algorithm", Rocky Mountain J. of Math., 4 (1974), 213–225.

    Article  MathSciNet  MATH  Google Scholar 

  15. W.B. Gragg, G.D. Johnson, "The Laurent-Padé table", IFIP Congress 74, North-Holland, 1974, 632–637.

    Google Scholar 

  16. W.B. Gragg, "Laurent, Fourier and Chebyshev-Padé tables", in Saff and Varga (eds.), "Padé and rational approximation, Theory and applications", Academic Press, New York, 1977, 61–72.

    Chapter  Google Scholar 

  17. P.R. Graves-Morris, T.R. Hopkins, "Reliable rational interpolation", manuscript feb. 1978.

    Google Scholar 

  18. P.R. Graves-Morris, "Numerical calculation of Padé approximants", these proceedings.

    Google Scholar 

  19. J.F. Hart et al., "Computer approximations", John Wiley and Sons, 1968.

    Google Scholar 

  20. P. Henrici, "Applied and computational complex analysis, vol. II", John Wiley and Sons, revised edition, 1977.

    Google Scholar 

  21. A.N. Khovanskii, "The application of continued fractions and their generalization to problems in approximation theory", P. Noordhoff N.V., Groningen, 1963.

    Google Scholar 

  22. R.J. McEliece, J.B. Shearer, "A property of Euclid's algorithm and an application to Padé approximation", SIAM J. Appl. Math., 34 (1978), 611–616.

    Article  MathSciNet  MATH  Google Scholar 

  23. J.A. Murphy, M.P. O'Donohoe, "A class of algorithms for obtaining rational approximants to functions which are defined by power series", Journ. of Appl. Math. and Physics (ZAMP), 28 (1977), 1121–1131.

    Article  MathSciNet  MATH  Google Scholar 

  24. J.L. Philips, "The triangular decomposition of Hankel matrices", Math. of Comp., 25 (1971), 599–602.

    Article  MathSciNet  Google Scholar 

  25. J. Rissanen, "Solution of linear equations with Hankel and Topelitz matrices", Numer. Math., 22 (1974), 361–366.

    Article  MathSciNet  MATH  Google Scholar 

  26. J. Rissanen, "Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomials", Math. of Comp., 27 (1973), 147–154.

    Article  MathSciNet  MATH  Google Scholar 

  27. W.F. Trench, "An algorithm for the inversion of finite Toeplitz matrices", SIAM J. Appl. Math. 12 (1964), 515–512.

    Article  MathSciNet  MATH  Google Scholar 

  28. W.F. Trench, "An algorithm for the inversion of finite Hankel matrices", SIAM J. Appl. Math., 13 (1965), 1102–1107.

    Article  MathSciNet  MATH  Google Scholar 

  29. P.J.S. Watson, "Algorithm for differentiation and integration", P.R. Graves-Morris (ed.), "Padé approximants and their applications", Academic Press, London, 1973, 93–98.

    Google Scholar 

  30. H. Werner, "Continued fractions for the numerical solution of rational interpolation", these proceedings.

    Google Scholar 

  31. S. Zohar, "Toeplitz matrix inversion: the algorithm of W.F. Trench", Journ. ACM, 16 (1969), 592–601.

    Article  MathSciNet  MATH  Google Scholar 

  32. S. Zohar, "The solution of a Toeplitz set of linear equations", Journ. ACM, 21 (1974), 272–276.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. K.U.Leuven Afdeling Toegepaste Wiskunde en Programmatie, Celestijnenlaan 200 A, B-3030, Heverlee, Belgium

    A. Bultheel

Authors
  1. A. Bultheel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luc Wuytack

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag

About this paper

Cite this paper

Bultheel, A. (1979). Recursive algorithms for the Padé table : Two approaches. In: Wuytack, L. (eds) Padé Approximation and its Applications. Lecture Notes in Mathematics, vol 765. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0085582

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09717-4

  • Online ISBN: 978-3-540-38511-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation