Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci
From MaRDI portal
Publication:6221601
arXiv1011.0148MaRDI QIDQ6221601
Author name not available (Why is that?)
Publication date: 31 October 2010
Abstract: Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be applied to Lucas. A formula is given to estimate the largest n, where F_n does not overflow the implementation's data type. The danger of timing runs on input that is too large for the computer representation leads to false research results.
This page was built for publication: Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6221601)