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

DOI10.1016/0020-0190(78)90022-4MaRDI QIDQ1249422zbMATH OpenOpenAlexFDO

Authors Joseph Shortt

Publication date 1978

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

Full work available at URL https://doi.org/10.1016/0020-0190(78)90022-4

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites work

• An axiomatic basis for computer programming

Cited in

(8)

• An O(k²log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
• A fast algorithm for computing large Fibonacci numbers
• On the computing of the generalized order-k Pell numbers in log time
• Computing Fibonacci numbers (and similarly defined functions) in log time
• Fast Computation of Fibonacci Numbers and Their Sums
• An O(log n) algorithm for computing general order-k Fibonacci numbers
• Fast computation of solutions of linear difference equations by Er's rule

This page was built for publication: An interative program to calculate Fibonacci numbers in O(log n) arithmetic operations

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