On the computing of the generalized order-k Pell numbers in log time
- 3 March 2006
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 181 (1) , 511-515
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Computing fibonacci numbers quicklyInformation Processing Letters, 1989
- On the number of arithmetical operations for finding Fibonacci numbersTheoretical Computer Science, 1989
- A presentation of the Fibonacci algorithmInformation Processing Letters, 1984
- Computing sums of order-k Fibonacci numbers in log timeInformation Processing Letters, 1983
- A Fast Algorithm for Computing Order-K Fibonacci NumbersThe Computer Journal, 1983
- Derivation of an O(k2 log n) algorithm for computing order-k fibonacci numbers from the O(k3log n) matrix multiplication methodInformation Processing Letters, 1980
- Computing Fibonacci numbers (and similarly defined functions) in log timeInformation Processing Letters, 1980
- An O(log n) algorithm for computing the nth element of the solution of a difference equationInformation Processing Letters, 1980
- An interative program to calculate fibonacci numbers in O(log n) arithmetic operationsInformation Processing Letters, 1978
- Generalized Fibonacci Numbers and Associated MatricesThe American Mathematical Monthly, 1960