An O(log n) algorithm for computing general order-k Fibonacci numbers
From MaRDI portal
Publication:1141167
DOI10.1016/S0020-0190(80)90076-9zbMath0437.10004OpenAlexW2095062354MaRDI QIDQ1141167
Joseph Shortt, Thomas C. Wilson
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(80)90076-9
Related Items (13)
A chained-matrices approach for parallel computation of continued fractions and its applications ⋮ A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers ⋮ Computing Fibonacci numbers (and similarly defined functions) in log time ⋮ An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation ⋮ 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 ⋮ The generalized order-\(k\) Fibonacci-Pell sequence by matrix methods ⋮ Fast computation of periodic continued fractions ⋮ An O(log n) algorithm for computing periodic continued fractions and its applications ⋮ Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method ⋮ Computing sums of order-k Fibonacci numbers in log time ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)
Cites Work
This page was built for publication: An O(log n) algorithm for computing general order-k Fibonacci numbers
