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

DOI10.1016/0020-0190(78)90022-4zbMath0385.65057OpenAlexW2086665113MaRDI QIDQ1249422

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)

Related Items (8)

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

Cites Work

• An axiomatic basis for computer programming

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