Fast computation of solutions of linear difference equations by Er's rule (Q1187207): Difference between revisions

A linear difference equation of \(k\)-th order is considered. An efficient algorithm for the computation of the \(n\)-th element of the solution is presented. This algorithm only uses \(O(k^ 2\log({n\over k}))\) time and \(O(k)\) space for performing the task and is better than previously known results.