Skip to main content
Springer Nature Link
Log in

The complete analysis of the binary Euclidean algorithm

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1423))

Included in the following conference series:

  • 244 Accesses

Abstract

We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We analyse the three main parameters of the binary continued fraction expansion, namely the height, the number of steps of the binary Euclidean algorithm, and finally the sum of the exponents of powers of 2 contained in the numerators of the binary continued fraction. The average values of these parameters are shown to be asymptotic to A i log N, and the three constants A i are related to the invariant measure of the Perron-Frobenius operator linked to this dynamical system. The binary Euclidean algorithm has been previously studied in 1976 by Brent who provided a partial analysis of the number of steps, based on a heuristic model and some unproven conjecture. Our methods are quite different, not relying on heuristic hypothesis or conjecture, and more general, since they allow us to study all the parameters of the binary continued fraction expansion.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Richard P. Brent. Analysis of the binary Euclidean algorithm, Algorithms and Complexity, New directions and recent results, ed. by J.F. Traub, Academic Press 1976, pp 321–355.

    Google Scholar 

  2. Richard P. Brent. Unpublished, cf [Kn, 4.5.2]

    Google Scholar 

  3. Richard P. Brent. Further analysis of the binary Euclidean algorithm, manuscript, Feb 98, submitted to FUN'98.

    Google Scholar 

  4. Hervé Daudé, Philippe Flajolet, and Brigitte Vallée. An analysis of the Gaussian Algorithm for Lattice Reduction, ANTS '1994, Lecture Notes in Computer Science 877, pp 144–158. Extended version in Combinatorics, Probability and Computing (1997) 6, pp 397–433.

    Google Scholar 

  5. Hubert Delange. Généralisation du Théorème d'Ikehara. Ann. Sc. ENS, (1954) 71, pp 213–242.

    MATH  MathSciNet  Google Scholar 

  6. John G. Dixon. The number of steps in the Euclidean Algorithm, Journal of Number Theory 2 (1970) pp 414–422.

    Article  MATH  MathSciNet  Google Scholar 

  7. Christian Faivre. Distribution of Lévy constants for quadratic numbers, Acta Arithmetica, LXI. 1 (1992), pp 13–34.

    MathSciNet  Google Scholar 

  8. Philippe Flajolet. Analytic analysis of algorithms, In Proceedings of the 19th International Colloquium “Automata, Languages and Programming”, Vienna, July 1992, W. Kuich, editor, Lecture Notes in Computer Science 623, pp 186–210

    Google Scholar 

  9. Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics, Book in preparation (1999), see also INRIA Research Reports 1888, 2026, 2376, 2956.

    Google Scholar 

  10. Philippe Flajolet and Brigitte Vallée. Continued Fraction Algorithms, Functional Operators and Structure Constants, Theoretical Computer Science 194 (1998), pp 1–34.

    Article  MATH  MathSciNet  Google Scholar 

  11. Alexandre Grothendieck. Produits tensoriels topologiques et espaces nucléaires, Mem. Am. Math. Soc. 16 (1955)

    Google Scholar 

  12. Alexandre Grothendieck. La théorie de Fredholm, Bull. Soc. Math. France 84 pp 319–384.

    Google Scholar 

  13. H. Heilbronn. On the average length of a class of continued fractions, Number Theory and Analysis, ed. by P. Turan, New-York, Plenum, 1969, pp 87–96.

    Google Scholar 

  14. Doug Hensley. The distribution of badly approximate rationals and continuants with bounded digits II, Journal of Number Theory, 34 pp 293–334 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  15. Doug Hensley. The Hausdorff dimensions of some continued fraction Cantor sets, Journal of Number theory 33, (1989) pp 182–198

    Article  MATH  MathSciNet  Google Scholar 

  16. Doug Hensley. Continued fraction Cantor sets, Hausdorff dimension, and functional analysis, Journal of Number Theory 40 (1992) pp 336–358.

    Article  MATH  MathSciNet  Google Scholar 

  17. Doug Hensley. A polynomial time algorithm for the Hausdorff dimension of a continued fraction Cantor set, Journal of Number Theory 58 No. 1, May 1996 pp 9–45.

    Article  MATH  MathSciNet  Google Scholar 

  18. D.E. Knuth. The Art of Computer Programming, Vol 2, third edition (1997), Sec. 4.5.2.

    Google Scholar 

  19. M. Krasnoselsky. Positive solutions of operator equations, Chap. 2 P. Noordhoff, Groningen. (1964)

    Google Scholar 

  20. Dieter H. Mayer. Continued fractions and related transformations, In Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces, M. K. Tim Bedford and C. Series, Eds. Oxford University Press, 1991, pp. 175–222.

    Google Scholar 

  21. Dieter H. Mayer. Spectral properties of certain composition operators arising in statistical mechanics, Commun. Math. Phys. 68, 1–8 (1979)

    Article  MATH  Google Scholar 

  22. Mark Pollicott. A complex Ruelle-Perron-Frobenius Theorem and two counterexamples, Ergod. Th. and Dynm. Sys (1984), 4, pp 135–146

    MATH  MathSciNet  Google Scholar 

  23. David Ruelle. Thermodynamic formalism. Addison Wesley (1978)

    Google Scholar 

  24. H. Schwartz. Composition operators in H p, Ph.D. Thesis, Univ. of Tomedo.

    Google Scholar 

  25. Joel Shapiro, P.D. Taylor, Compact, nuclear, and Hilbert-Schmidt composition operators on H 2, Indiana Univ. Math. J. (1973) 23, pp 471–496

    Article  MATH  MathSciNet  Google Scholar 

  26. Joel Shapiro. Composition operators and classical function theory, Universitext: tracts in mathematics, Springer-Verlag, 1993.

    Google Scholar 

  27. Joel Shapiro. Compact composition operators on spaces of boundary regular holomorphic functions, Proceedings of the AMS, 100, (1997), pp 49–57

    Article  Google Scholar 

  28. Brigitte Vallée. Opérateurs de Ruelle-Mayer généralisés et analyse des algorithmes de Gauss et d'Euclide, Acta Arithmetica LXXXI.2 (1997) pp 101–144.

    Google Scholar 

  29. Brigitte Vallée. Algorithms for computing signs of 2 x 2 determinants: dynamics and average-case algorithms, Proceedings of the 8 th Annual European Symposium on Algorithms, ESA'97, pp 486–499, LNCS 1284, Springer Verlag.

    Google Scholar 

  30. Brigitte Vallée. Fractions continues à contraintes périodiques, Les Cahiers du GR-EYC 1997, Université de Caen, to appear in Journal of Number Theory.

    Google Scholar 

  31. Brigitte Vallée. Dynamical systems and average-case analysis of generai tries, Les cahiers du GREYC 1997, Université de Caen; also in Proceedings of RALCOM'97, Santorini Island, October 1997.

    Google Scholar 

  32. Brigitte Vallée. Unpublished, cf [Kn, 4.5.2]

    Google Scholar 

  33. Brigitte Vallée. Dynamics of the binary Euclidean algorithm: Functional analysis and operators, les Cahiers du GREYC, Université de Caen (1998), to appear in Algorithmica (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GREYC, Université de Caen, 14032, Caen Cedex, France

    Brigitte Vallée

Authors
  1. Brigitte Vallée
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joe P. Buhler

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vallée, B. (1998). The complete analysis of the binary Euclidean algorithm. In: Buhler, J.P. (eds) Algorithmic Number Theory. ANTS 1998. Lecture Notes in Computer Science, vol 1423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054853

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64657-0

  • Online ISBN: 978-3-540-69113-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics