An Algorithm for Evaluation of Remote Terms in A Linear Recurrence Sequence
J. C. P. Miller, D. J. S. Brown · The Computer Journal · 1966
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.