Skip to main content

Use of Continued Fractions and Algorithms Related to Them

  • Chapter
Alcune questioni di analisi numerica

Part of the book series: C.I.M.E. Summer Schools ((CIME,volume 35))

  • 278 Accesses

Abstract

A. In these lectures, we are dealing with the explicite or implicite use of continued fractions for the numerical solution of a number of problems. This means, that we are dealing with algorithms related to continued fractions. Since continued fractions have a profound connection with a certain class of (infinite) matrices, and since in our algorithms necessarily the approximants of continued fractions, which correspond to finite segments of these matrices play a role, there is good reason to base our lectures on the matrix theory of continued fractions. In Part I, we give an introduction to concepts and notations, and derive the principal algorithms, which we subsume under the name rhombus algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
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.

Bibliography

  1. A.C. Aitken, On Bernoulli's Numerical Solution of Algebraic Equations, Proc. Roy. Soc., Edinb. 46 (1926), 289–305.

    MATH  Google Scholar 

  2. F.L. Bauer, The Quotient. Difference and ε-Algorithm, in: On Numerical Approximation, edited by R.E. Langer, Madison, 1959.

    Google Scholar 

  3. ——, The g-Algorithm, J. Soc. Indust. Appl. Math. 8 (1960), 1 – 17.

    Article  MathSciNet  MATH  Google Scholar 

  4. 4 ——, Ein direktes Itertionsverfharen zur Hurwitz Zerlegung eines Polynoms, Archiv der Elektrischen Ubertragung, 9 (1955), 285–290.

    Google Scholar 

  5. J. Hadamard Essai sur l'—étude des fonctions données par leur développement de Taylor, Thèse (Gauthier-Villars, Paris 1892).

    Google Scholar 

  6. A.S. Householder, Unitary triangularization of a nonsymetric matrix, J. Assoc. comput. Mach., 5 (1958), pp. 339–342.

    MathSciNet  MATH  Google Scholar 

  7. P.L. Bauer, Sequential reduction to tridiagonal form, J .Soc. Indust. Appl. Math., (1959), pp. 107–113.

    Google Scholar 

  8. O. Perron, Die Lehre fon den Kettenbrüchen, Band II, B.G. Teubner-Verlag, Stuttgart, 1957.

    Google Scholar 

  9. H. Rutishauser, Der Quotienten-Differenzen-Algorithmus, Birkhauser-Verlag, Basel/Suttgart, 1957.

    MATH  Google Scholar 

  10. T.J. Stieltjes, Recherches sur les fonctions continues, Ann. Sci Toulouse, vol 8(1894), J, pp., 1–122; vol 9(1894), A, pp. 1–47.

    MathSciNet  Google Scholar 

  11. ——, Oeuvres, vol. 2.

    Google Scholar 

  12. H.S. Wall, Analytic Theory of Continued Fractions, D. van Nostrand Company, Inc., Princeton, N.J., 1948.

    MATH  Google Scholar 

  13. P. Wynn, On a device for computing the εm (Sm)-transformation, MTAC. vol. 10(1956), pp. 91–96

    MathSciNet  MATH  Google Scholar 

  14. ——, On a procrustean technique for the numerical transformation of slowly convergent sequences and series, Proc. Cambrige Phil. Soc., 52(1956) part 4, pp. 663–671.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Aldo Ghizzetti (Coordinatore)

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bauer, F.L. (2010). Use of Continued Fractions and Algorithms Related to Them. In: Ghizzetti, A. (eds) Alcune questioni di analisi numerica. C.I.M.E. Summer Schools, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11027-6_4

Download citation

Publish with us

Policies and ethics