On Fast Computation of Continued Fractions (1991)
by
Ömer Egecioglu
,
Cetin K. Koc
,
Josep Rifa I Coma
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Egecioglu91onfast,
author = {Ömer Egecioglu and Cetin K. Koc and Josep Rifa I Coma},
title = {On Fast Computation of Continued Fractions},
year = {1991}
}
author = {Ömer Egecioglu and Cetin K. Koc and Josep Rifa I Coma},
title = {On Fast Computation of Continued Fractions},
year = {1991}
}
Bookmarks
OpenURL
Abstract:
We give an O(log n) algorithm to compute the nth convergent of a periodic continued fraction. The algorithm is based on matrix representation of continued fractions, due to Milne-Thomson. This approach also allows for the computation of first n convergents of a general continued fraction in O(log n) time using O(n/log n) processors.
Citations
| 477 | The Art of Computer Programming, Volume 2: Seminumerical Algorithms (2nd Edition – Knuth - 1981 |
| 17 | Parallel pre x computation – Ladner, Fisher - 1980 |
| 9 | The Power of Parallel Pre x – Kruskal, Rudolph, et al. - 1985 |
| 5 | Efficient parallel algorithms for linear recurrence computation – Greenberg, Ladner, et al. - 1982 |
| 3 | New bounds for parallel pre circuits – Fich - 1983 |
| 3 | Depth-size trade-os for parallel pre computation – Snir - 1986 |
| 1 | Fast Computation of Periodic Continued Fractions – Chung, Chen, et al. - 1989 |
| 1 | The Calculus of Finite Dierences, 2nd Unaltered Edition – Milne-Thomson - 1981 |
