# Continued Fraction Algorithms, Functional Operators, and Structure Constants

1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : Continued fractions lie at the heart of a number of classical algorithms like Euclid's greatest common divisor algorithm or the lattice reduction algorithm of Gauss that constitutes a 2-dimensional generalization. This paper surveys the main properties of functional operators, ---transfer operators--- due to Ruelle and Mayer (also following Lévy, Kuzmin, Wirsing, Hensley, and others) that describe precisely the dynamics of the continued fraction transformation. Spectral characteristics of transfer operators are shown to have many consequences, like the normal law for logarithms of continuants associated to the basic continued fraction algorithm, where better convergence terms are obtained, and a purely analytic estimation of the average number of steps of the Euclidean algorithm. Transfer operators also lead to a complete analysis of the «Hakmem» algorithm for comparing two rational numbers via partial continued fraction expansions, and of the «digital tree» algorithm for completely sorting $n$ real numbers by means of their continued fraction representations. Thus, a small number of «structure constants» appear to govern the behaviour of a variety of continued fraction based algorithms.
Keywords :
Document type :
Reports
Domain :

https://hal.inria.fr/inria-00073768
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:43:02 PM
Last modification on : Friday, February 4, 2022 - 3:10:27 AM
Long-term archiving on: : Thursday, March 24, 2011 - 12:58:50 PM

### Identifiers

• HAL Id : inria-00073768, version 1

### Citation

Philippe Flajolet, Brigitte Vallée. Continued Fraction Algorithms, Functional Operators, and Structure Constants. [Research Report] RR-2931, INRIA. 1996. ⟨inria-00073768⟩

Record views