Fast computation of continued fractions

Omer Eg̃eciog̃lu, Çetin K. Koç, Josep RifàI Coma

    Research output: Contribution to journalArticleResearchpeer-review

    2 Citations (Scopus)


    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. © 1991.
    Original languageEnglish
    Pages (from-to)167-169
    JournalComputers and Mathematics with Applications
    Publication statusPublished - 1 Jan 1991


    Dive into the research topics of 'Fast computation of continued fractions'. Together they form a unique fingerprint.

    Cite this