Computation of Continued Fractions Without Input Values
- 1 July 1995
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 64 (211) , 1307-1317
- https://doi.org/10.2307/2153497
Abstract
An algorithm for the computation of the continued fraction expansions of numbers which are zeros of differentiable functions is given. The method is direct in the sense that it requires function evaluations at appropriate steps, rather than the value of the number as input in order to deliver the expansion. Statistical data on the first 10000 partial quotients for various real numbers are also given.Keywords
This publication has 7 references indexed in Scilit:
- Pi and the AGM, by Jonathan M. Borwein and Peter B. Borwein. Pp. 414. £38.95. 1998. ISBN 0 471 31515 X (Wiley Interscience).The Mathematical Gazette, 1999
- Folded continued fractionsJournal of Number Theory, 1992
- An introduction to continued fractionsPublished by Cambridge University Press (CUP) ,1986
- On continued fractions and finite automataMathematische Annalen, 1973
- On the Sum and Product of Continued FractionsAnnals of Mathematics, 1947
- Note on an Absolute Constant of KhintchineThe American Mathematical Monthly, 1939
- Euclid's Algorithm for Large NumbersThe American Mathematical Monthly, 1938