Ergodic computations with continued fractions and Jacobi's algorithm-Reference-Cited by-同舟云学术

Ergodic computations with continued fractions and Jacobi's algorithm

Published:1972-06 Issue:3 Volume:19 Page:195-205
ISSN:0029-599X
Container-title:Numerische Mathematik
language:en
Short-container-title:Numer. Math.

Author:

Beyer W. A.,Waterman M. S.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF01404688.pdf

Reference15 articles.

1. Billingsley, Patrick: Ergodic theory and information. New York, London, and Sidney: John Wiley & Sons, Inc. 1965.

2. Jacobi, C. G. J.: Allgemeine Theorie der kettenbruchähnlichen Algorithmen, in welchen jede Zahl aus drei vorhergehenden gebildet wird. J. Reine Angew. Math.69, 29?64 (1968).

3. Knuth, D. E.: Euler's constant to 1271 places. Math. Comp.16, 275?281 (1962).

4. Lehmer, D. H.: Euclid's algorithm for large numbers. Amer. Math. Monthly45, 227?233 (1938).

5. Perron, Oskar: Grundlagen für eine Theorie des Jacobischen Kettenbruchalgorithmus. Math. Ann.64, 1?76 (1907).

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Some behaviour of convergents for θ-expansion and regular continued fraction (RCF) expansion;PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2020 (MATHTECH 2020): Sustainable Development of Mathematics & Mathematics in Sustainability Revolution;2021

2. On the convergent of θ-expansions of continued fractions;AIP Conference Proceedings;2018

3. Multidimensional greatest common divisor and Lehmer algorithms;BIT;1977-12

4. The algorithms of Euclid and Jacobi†;International Journal of Mathematical Education in Science and Technology;1976-08

5. F-Expansions of rationals;Aequationes Mathematicae;1975-10