An Algorithm for Evaluation of Remote Terms in A Linear Recurrence Sequence
From MaRDI portal
Publication:5530037
DOI10.1093/comjnl/9.2.188zbMath0151.21101OpenAlexW2146347744MaRDI QIDQ5530037
J. C. P. Miller, D. J. S. Brown
Publication date: 1966
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/9.2.188
Related Items (4)
Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications ⋮ Beating binary powering for polynomial matrices ⋮ Unnamed Item ⋮ Efficient computation of terms of linear recurrence sequences of any order
This page was built for publication: An Algorithm for Evaluation of Remote Terms in A Linear Recurrence Sequence