Application of Matrix Multiplication in Fibonacci Sequence Calculation

ZhouWeixing, Chen Si, Zhang Fan

Computer & Telecommunication ›› 2017, Vol. 1 ›› Issue (9) : 71-73.

Computer & Telecommunication ›› 2017, Vol. 1 ›› Issue (9) : 71-73.

Application of Matrix Multiplication in Fibonacci Sequence Calculation

  • ZhouWeixing,Chen Si,Zhang Fan
Author information +
History +

Abstract

This paper introduces some algorithms of Fibonacci sequence calculation, analyzes the time complexity of recursive, bottom-up and Binet formula algorithms, gives a method to reduce the time complexity by using two dimension matrix multiplication, and compares the execution time of different amount of calculation among these algorithms. It modifies the long data type to BigInteger data type to resolve the data overflow problem, and compares different algorithms’execution time for large number calculation.

Key words

Fibonacci / recursive / Binet formula / matrix

Cite this article

Download Citations
ZhouWeixing, Chen Si, Zhang Fan. Application of Matrix Multiplication in Fibonacci Sequence Calculation[J]. Computer & Telecommunication. 2017, 1(9): 71-73

Accesses

Citation

Detail

Sections
Recommended

/