An Algorithm for Evaluation of Remote Terms in A Linear Recurrence Sequence
Open Access
- 1 August 1966
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 9 (2) , 188-190
- https://doi.org/10.1093/comjnl/9.2.188
Abstract
A method is described for computing terms Un given by a linear recurrence relation from initial conditions near n = 0, whereby values for large n may be obtained without computing all intermediate values. The total number of operations is of order log n.Keywords
This publication has 0 references indexed in Scilit: