Fast Computation of Fibonacci Numbers and Their Sums

DOI10.1080/02522667.1985.10698804zbMATH Open0572.10002OpenAlexW2007086003MaRDI QIDQ3689237FDOQ3689237

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5320061
• On the number of arithmetical operations for finding Fibonacci numbers
• scientific article; zbMATH DE number 3857295
• A fast algorithm for computing large Fibonacci numbers
• Improved algorithms for the calculation of Fibonacci numbers

zbMATH Keywords

algorithmcomputationFibonacci numbersmatrix method

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Acceleration of extended Fibonacci sequences
• An O(k²log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space
• Title not available (Why is that?)
• A fast algorithm for computing large Fibonacci numbers
• Improved algorithms for the calculation of Fibonacci numbers
• Tumble, a fast simple iteration algorithm for Fibonacci
• Title not available (Why is that?)
• Fibonacci linear forms and parallel arithmetic algorithms for large numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689237)