An O( n) algorithm for computing the nth element of the solution of a difference equation

DOI10.1016/0020-0190(80)90002-2MaRDI QIDQ1151752zbMATH OpenOpenAlexFDO

Authors Friedrich J. Urbanek

Publication date 1980

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(80)90002-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• An O(log n) algorithm for computing general order-k Fibonacci numbers
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)

Cited in

(11)

• Horner's rule and the computation of linear recurrences
• On the number of arithmetical operations for finding Fibonacci numbers
• Fast computation of solutions of linear difference equations by Er's rule
• A chained-matrices approach for parallel computation of continued fractions and its applications
• Computing sums of order-k Fibonacci numbers in log time
• A fast algorithm for computing large Fibonacci numbers
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
• An O(k²log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space
• Fast computation of periodic continued fractions
• An O(log n) algorithm for computing periodic continued fractions and its applications
• On the computing of the generalized order-k Pell numbers in log time

This page was built for publication: An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151752)