A Fast Algorithm for Computing Order-K Fibonacci Numbers

DOI10.1093/COMJNL/26.3.224MaRDI QIDQ3670557zbMATH OpenOpenAlexFDO

Authors 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

order-k Fibonacci numbersspace complexitytime complexity

Mathematics Subject Classification ID

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

Cited in

(6)

• Fast computation of solutions of linear difference equations by Er's rule
• The generalized order-\(k\) Fibonacci-Pell sequence by matrix methods
• 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
• On the computing of the generalized order-k Pell numbers in log time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670557)