In mathematics, particularly computer algebra, Abramov's algorithm computes all rational solutions of a linear recurrence equation with polynomial coefficients. It was introduced by Sergei A. Abramov in 1989 as a procedure for solving this class of recurrence relations within computer algebra systems. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Connections
In Field
Source Wikipedia: Abramov's algorithm
Sources
Wikipedia: Abramov's algorithm
In Field: Computer Algebra, Lead sentenceQuote, In Field: Computer Algebra, Lead sentence
Abramov's algorithm computes all rational solutions of a linear recurrence equation with polynomial coefficients.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.