Fast computation of continued fractions

DOI10.1016/0898-1221(91)90095-LMaRDI QIDQ750523zbMATH OpenFDO

Authors Josep Rifà, Ömer Eğecioğlu, Çetin Kaya Koç

Publication date 1991

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

zbMATH Keywords

algorithmperiodic continued fraction

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 periodic continued fractions
• An O(log n) algorithm for computing periodic continued fractions and its applications
• A chained-matrices approach for parallel computation of continued fractions and its applications
• scientific article; zbMATH DE number 1408352
• A fast method to transform continued fractions to common fractions

Cites work

• scientific article; zbMATH DE number 3749543 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• Depth-size trade-offs for parallel prefix computation
• Efficient parallel algorithms for linear recurrence computation
• Fast computation of periodic continued fractions
• Parallel Prefix Computation

Cited in

(12)

• Matrices, continued fractions, and fast algorithms
• A fast method to transform continued fractions to common fractions
• scientific article; zbMATH DE number 3874603 (Why is no real title available?)
• scientific article; zbMATH DE number 1408352 (Why is no real title available?)
• On the computing time of the continued fractions method
• Fast computation of periodic 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 1919527 (Why is no real title available?)
• Computation of the Regular Continued Fraction for Euler's Constant
• The Computational Complexity of Continued Fractions

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

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