Fast computation of solutions of linear difference equations by Er's rule

DOI10.1016/0020-0255(92)90021-YzbMath0762.65088OpenAlexW2071933258MaRDI QIDQ1187207

M. C. Er

Publication date: 28 June 1992

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(92)90021-y

zbMATH Keywords

algorithmlinear difference equation

Mathematics Subject Classification ID

Additive difference equations (39A10)

Cites Work

• A presentation of the Fibonacci algorithm
• An O(log n) algorithm for computing general order-k Fibonacci numbers
• Computing Fibonacci numbers (and similarly defined functions) in log time
• An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
• An interative program to calculate Fibonacci numbers in O(log n) arithmetic operations
• Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method
• Computing sums of order-k Fibonacci numbers in log time
• A Fast Algorithm for Computing Order-K Fibonacci Numbers
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast computation of solutions of linear difference equations by Er's rule