Fast Computation of Fibonacci Numbers and Their Sums

DOI10.1080/02522667.1985.10698804zbMath0572.10002OpenAlexW2007086003MaRDI QIDQ3689237

M. C. Er

Publication date: 1985

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1985.10698804

zbMATH Keywords

algorithmFibonacci numberscomputationmatrix method

Mathematics Subject Classification ID

Recurrences (11B37) Software, source code, etc. for problems pertaining to number theory (11-04) Algorithms in computer science (68W99)

Related Items (1)

An O(k²log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space

Cites Work

• An interative program to calculate Fibonacci numbers in O(log n) arithmetic operations

This page was built for publication: Fast Computation of Fibonacci Numbers and Their Sums