Fast computation of periodic continued fractions

DOI10.1016/0020-0190(89)90157-9zbMath0714.11087OpenAlexW1995985037MaRDI QIDQ750520

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) Continued fraction calculations (number-theoretic aspects) (11Y65) Convergence and divergence of continued fractions (40A15)

Related Items (1)

Fast computation of continued fractions

Cites Work

• Unnamed Item
• Unnamed Item
• A presentation of the Fibonacci algorithm
• An O(log n) algorithm for computing general order-k Fibonacci numbers
• Computing Fibonacci numbers (and similarly defined functions) in log time
• An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
• An essay on continued fractions

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