A fast algorithm for computing large Fibonacci numbers
From MaRDI portal
Publication:294835
DOI10.1016/S0020-0190(00)00112-5zbMath1339.11102WikidataQ127975205 ScholiaQ127975205MaRDI QIDQ294835
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001125?np=y
Mathematical problems of computer architecture (68M07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Calculation of integer sequences (11Y55)
Related Items (10)
Truncated Lucas sequence and its period ⋮ On the period of Fibonacci sequences in nilpotent groups. ⋮ 3-step Fibonacci series modulo \(m\). ⋮ 3-step Fibonacci sequences in nilpotent groups. ⋮ Applications of Fibonacci sequences in a finite nilpotent group. ⋮ An application of Fibonacci numbers in matrices. ⋮ On the computing of the generalized order-\(k\) Pell numbers in log time ⋮ The generalized order-\(k\) Fibonacci-Pell sequence by matrix methods ⋮ Tumble, a fast simple iteration algorithm for Fibonacci ⋮ An application of Fibonacci sequences in groups
Cites Work
- Unnamed Item
- A presentation of the Fibonacci algorithm
- On the number of arithmetical operations for finding 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 interative program to calculate Fibonacci numbers in O(log n) arithmetic operations
- 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
- Fast multiplication of large numbers
- A Fast Algorithm for Computing Order-K Fibonacci Numbers
- An Algorithm for the Machine Calculation of Complex Fourier Series
This page was built for publication: A fast algorithm for computing large Fibonacci numbers
