An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
From MaRDI portal
Publication:1151752
DOI10.1016/0020-0190(80)90002-2zbMath0458.68010OpenAlexW2001413445MaRDI QIDQ1151752
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(80)90002-2
Related Items (11)
A chained-matrices approach for parallel computation of continued fractions and its applications ⋮ A fast algorithm for computing large Fibonacci numbers ⋮ A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers ⋮ Horner's rule and the computation of linear recurrences ⋮ On the number of arithmetical operations for finding Fibonacci numbers ⋮ An O(k2log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space ⋮ Fast computation of solutions of linear difference equations by Er's rule ⋮ On the computing of the generalized order-\(k\) Pell numbers in log time ⋮ Fast computation of periodic continued fractions ⋮ An O(log n) algorithm for computing periodic continued fractions and its applications ⋮ Computing sums of order-k Fibonacci numbers in log time
Cites Work
This page was built for publication: An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
