A fast algorithm for computing large Fibonacci numbers

  title={A fast algorithm for computing large Fibonacci numbers},
  author={Daisuke Takahashi},
  journal={Inf. Process. Lett.},
  • D. Takahashi
  • Published 2000
  • Computer Science
  • Inf. Process. Lett.

Figures and Tables from this paper

Improved algorithms for the calculation of Fibonacci numbers
New algorithms that compute Fibonacci numbers, having complexity less than log based on recursive algorithms, are presented, all in tail-recursive form so they can easily be converted to their iterative form.
Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5
Computing Fibonacci Numbers Fast using the Chinese Remainder Theorem
The purpose of this paper is to investigate the calculation of Fibonacci numbers using the Chinese Remainder Theorem (CRT). This paper begins by laying down some general conclusions that can be made
Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci
Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be applied to Lucas. A
On the period of Fibonacci sequences in nilpotent groups
On the computing of the generalized order-k Pell numbers in log time
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence
A simple and fast algorithm for computing the N-th term of a given linearly recurrent sequence and several algorithmic applications, notably to polynomial modular exponentiation, powering of matrices and high-order lifting are discussed.
3-Step Fibonacci series modulo m
. By interpreting various sums involving Fibonacci and Lucas numbers physically, we show how one can often generate an additional summation with little effort. To illustrate the fruitfulness of the


Computing Sums of Order-k Fibonacci Numbers in Log Time
  • M. Er
  • Mathematics
    Inf. Process. Lett.
  • 1983
On the Number of Arithmetical Operations for Finding Fibonacci Numbers
An algorithm for the machine calculation of complex Fourier series
Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
The Art in Computer Programming
Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.
Computing fibonacci numbers quickly
Computing Fibonacci Numbers (and Similarly Defined Functions) in Log Time
A Fast Algorithm for Computing Order-K Fibonacci Numbers
  • M. Er
  • Computer Science
    Comput. J.
  • 1983
An Iterative Program to Calculate Fibonacci Numbers in O(log n) Arithmetic Operations