An O(log n) algorithm for computing periodic continued fractions and its applications

DOI10.1016/0898-1221(91)90074-EzbMath0714.11089OpenAlexW2147861109MaRDI QIDQ750524

D. Kharzeev

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90074-e

zbMATH Keywords

algorithmFibonacci numbersperiodic continued fractionscomputation of continued fractions

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)

A chained-matrices approach for parallel computation of continued fractions and its applications

Cites Work

• Unnamed Item
• 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

This page was built for publication: An O(log n) algorithm for computing periodic continued fractions and its applications