Fast Computation of Fibonacci Numbers and Their Sums

DOI10.1080/02522667.1985.10698804MaRDI QIDQ3689237zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(8)

• scientific article; zbMATH DE number 17620 (Why is no real title available?)
• Tumble, a fast simple iteration algorithm for Fibonacci
• Fibonacci linear forms and parallel arithmetic algorithms for large numbers
• scientific article; zbMATH DE number 1807669 (Why is no real title available?)
• An O(k²log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space
• Acceleration of extended Fibonacci sequences
• Improved algorithms for the calculation of Fibonacci numbers
• A fast algorithm for computing large Fibonacci 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)