A presentation of the Fibonacci algorithm

DOI10.1016/0020-0190(84)90099-1zbMath0563.10004OpenAlexW2085045078MaRDI QIDQ1057303

Alain J. Martin, Martin Rem

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90099-1

zbMATH Keywords

algorithmprogramFibonacci number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recurrences (11B37) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (14)

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 elementary and unified approach to program correctness ⋮ Improved algorithms for the calculation of Fibonacci numbers ⋮ On the logarithmic evaluation of recurrence relations ⋮ 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 ⋮ Fast computation of periodic continued fractions ⋮ An O(log n) algorithm for computing periodic continued fractions and its applications

Cites Work

• Unnamed Item
• Computing Fibonacci numbers (and similarly defined functions) in log time

This page was built for publication: A presentation of the Fibonacci algorithm