Tumble, a fast simple iteration algorithm for Fibonacci

DOI10.1016/J.IPL.2003.10.012MaRDI QIDQ1029078zbMATH OpenOpenAlexFDO

Authors L. F. Johnson

Publication date 9 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2003.10.012

zbMATH Keywords

algorithmsFibonacci numbersLucas numbersrecurrence relations

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Analysis of algorithms (68W40)

Recommendations

• Improved algorithms for the calculation of Fibonacci numbers
• A fast algorithm for computing large Fibonacci numbers
• On the number of arithmetical operations for finding Fibonacci numbers
• Fast Computation of Fibonacci Numbers and Their Sums
• scientific article; zbMATH DE number 5320061

Cites work

• A fast algorithm for computing large Fibonacci numbers
• Fibonacci and Lucas numbers with applications. Volume I
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)

Cited in

(1)

• scientific article; zbMATH DE number 5124574 (Why is no real title available?)

This page was built for publication: Tumble, a fast simple iteration algorithm for Fibonacci

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