Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
From MaRDI portal
Publication:6222138
arXiv1012.0284MaRDI QIDQ6222138
Author name not available (Why is that?)
Publication date: 1 December 2010
Abstract: A fast simple O(log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster Fibonacci algorithm. In addition, a fast simple recursive algorithm for individual Lucas numbers is given that is O(log n).
This page was built for publication: Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6222138)