A presentation of the Fibonacci algorithm
From MaRDI portal
Another derivation of an algorithm (with program) of \textit{D. Gries} and \textit{G. Levin} [ibid. 11, 68-69 (1980; Zbl 0452.68052)] for computing the nth Fibonacci number is presented.
Cites work
Cited in
(15)- Horner's rule and the computation of linear recurrences
- On the number of arithmetical operations for finding Fibonacci numbers
- On the logarithmic evaluation of recurrence relations
- Fast computation of solutions of linear difference equations by Er's rule
- A chained-matrices approach for parallel computation of continued fractions and its applications
- The generalized order-\(k\) Fibonacci-Pell sequence by matrix methods
- A fast algorithm for computing large Fibonacci numbers
- Improved algorithms for the calculation of Fibonacci numbers
- A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
- An O(k2log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space
- scientific article; zbMATH DE number 6034 (Why is no real title available?)
- An elementary and unified approach to program correctness
- Fast computation of periodic continued fractions
- An O(log n) algorithm for computing periodic continued fractions and its applications
- On the computing of the generalized order-k Pell numbers in log time
This page was built for publication: A presentation of the Fibonacci algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057303)