Fast computation of solutions of linear difference equations by Er's rule (Q1187207): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0255(92)90021-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071933258 / rank | |||
Normal rank | |||
Latest revision as of 10:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of solutions of linear difference equations by Er's rule |
scientific article |
Statements
Fast computation of solutions of linear difference equations by Er's rule (English)
0 references
28 June 1992
0 references
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.
0 references
linear difference equation
0 references
algorithm
0 references
0 references
