A Fast Algorithm for Computing Order-K Fibonacci Numbers

DOI10.1093/COMJNL/26.3.224zbMath0521.68039OpenAlexW2160342396MaRDI QIDQ3670557

M. C. Er

Publication date: 1983

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/26.3.224

zbMATH Keywords

time complexityspace complexityorder-k Fibonacci numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (6)

A fast algorithm for computing large Fibonacci numbers ⋮ A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers ⋮ An O(k²log(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

This page was built for publication: A Fast Algorithm for Computing Order-K Fibonacci Numbers