An O(log n) algorithm for computing periodic continued fractions and its applications
type: Item
instance of: scholarly article
title: An O(log n) algorithm for computing periodic continued fractions and its applications
zbMATH Open document ID: 0714.11089
DOI: 10.1016/0898-1221(91)90074-E
author: D. Kharzeev
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 11Y65
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 11A55
Mathematics Subject Classification ID: 30B70
Mathematics Subject Classification ID: 40A15
zbMATH DE Number: 4175090
zbMATH Keywords: computation of continued fractions
zbMATH Keywords: algorithm
zbMATH Keywords: periodic continued fractions
zbMATH Keywords: Fibonacci numbers
MaRDI profile type: Publication
cites work: Computing Fibonacci numbers (and similarly defined functions) in log time
cites work: Q3994953
cites work: Q5585020
cites work: A presentation of the Fibonacci algorithm
cites work: Q5736199
cites work: An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
cites work: An O(log n) algorithm for computing general order-k Fibonacci numbers
full work available at URL: 0898-1221(91)90074-e
OpenAlex ID: W2147861109
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4175090