Fast computation of periodic continued fractions

DOI10.1016/0020-0190(89)90157-9MaRDI QIDQ750520zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 1989

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://ntur.lib.ntu.edu.tw/bitstream/246246/154483/1/02.pdf

zbMATH Keywords

algorithmrational formssecond order linear recurrencescomputation of quadratic surdsconvergent of a periodic continued fractionsubstitution scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Continued fractions (11A55) Continued fractions; complex-analytic aspects (30B70) Convergence and divergence of continued fractions (40A15) Continued fraction calculations (number-theoretic aspects) (11Y65)

Recommendations

• Fast computation of continued fractions
• Fast computation of continued fraction expansions.
• scientific article; zbMATH DE number 3874603
• On the computing time of the continued fractions method
• An O(log n) algorithm for computing periodic continued fractions and its applications
• Algorithmes des fractions continues et de Jacobi-Perron
• The Computational Complexity of Continued Fractions
• scientific article; zbMATH DE number 1408352
• scientific article; zbMATH DE number 3965304

Cites work

• scientific article; zbMATH DE number 3695547 (Why is no real title available?)
• scientific article; zbMATH DE number 3053340 (Why is no real title available?)
• A presentation of the Fibonacci algorithm
• An O(log n) algorithm for computing general order-k Fibonacci numbers
• An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
• An essay on continued fractions
• Computing Fibonacci numbers (and similarly defined functions) in log time

Cited in

(13)

• Fast arithmetic with general Gauß periods
• On the partial quotients of one of the continued fractions
• A fast method to transform continued fractions to common fractions
• scientific article; zbMATH DE number 3874603 (Why is no real title available?)
• On the computing time of the continued fractions method
• Comparison of various generalizations of continued fractions
• Algorithms for calculating continued fractions
• Fast computation of continued fractions
• Fast computation of continued fraction expansions.
• An O(log n) algorithm for computing periodic continued fractions and its applications
• scientific article; zbMATH DE number 1186953 (Why is no real title available?)
• scientific article; zbMATH DE number 1113823 (Why is no real title available?)
• On the optimal continued fraction expansion of a quadratic surd

This page was built for publication: Fast computation of periodic continued fractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750520)