Ergodic computations with continued fractions and Jacobi's algorithm

DOI10.1007/BF01404688zbMath0227.65005OpenAlexW4230603713MaRDI QIDQ2549556

William A. Beyer, Michael S. Waterman

Publication date: 1972

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132144

Mathematics Subject Classification ID

Acceleration of convergence in numerical analysis (65B99)

Related Items

The algorithms of Euclid and Jacobi†, F-expansions of rationals, Multidimensional greatest common divisor and Lehmer algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Computation of Euler's Constant
• Ergodische Theorie des Jacobischen Algorithmus
• Existenz eines invarianten Maßes beim Jacobischen Algorithmus
• Mischungseigenschaften und Entropie beim Jacobischen Algorithmus.
• Über die Geschlechter von Gittern über Ordnungen.
• A Kuzmin theorem for a class of number theoretic endomorphisms
• Questions Concerning Khintchine's Constant and the Efficient Computation of Regular Continued Fractions
• Euler's Constant to 1271 Places
• Euclid's Algorithm for Large Numbers