Skip to main content
SpringerLink
Log in

A continued fraction algorithm

  • Scientific Notes
  • Published:
BIT Numerical Mathematics 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. Wall, H. S.,Analytic Theory of Continued Fractions, New York, 1948.

  2. Wrench, John W. and Shanks, Daniel,Questions concerning Khintchine's constant and the efficient computation of regular continued fractions, Math. Comp., vol. 20, 1966, pp. 444–448.

    Google Scholar 

  3. Lehmer, D. H.,Euclid's algorithm for large numbers, Amer. Math. Monthly, vol. 45, 1938, pp. 227–233.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kungl. Statskontoret, Stockholm, Sweden

    Hans Riesel

Authors
  1. Hans Riesel
    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

Riesel, H. A continued fraction algorithm. BIT 7, 76–80 (1967). https://doi.org/10.1007/BF01934129

Download citation

  • Issue Date:

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

Keywords

Search

Navigation