Low complexity algorithms for linear recurrences

DOI10.1145/1145768.1145781MaRDI QIDQ2958967zbMATH OpenOpenAlexFDO

Authors Alin Bostan, Bruno Salvy, Thomas Cluzeau, Frédéric Chyzak

Publication date 3 February 2017

Published in Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00068922/file/BoChClSa06.pdf

zbMATH Keywords

complexitycomputer algebracreative telescopinglinear recurrencespolynomial and rational solutionssummation

Mathematics Subject Classification ID

Numerical aspects of recurrence relations (65Q30) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• Solving linear recurrence equations with polynomial coefficients
• Computing hypergeometric solutions of linear recurrence equations
• Fast algorithms for polynomial solutions of linear differential equations
• scientific article; zbMATH DE number 1263411
• Hypergeometric solutions of linear recurrences with polynomial coefficients

Cited in

(13)

• Accelerating indefinite summation: simple classes of summands
• On the complexity of polynomial recurrence sequences
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
• The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients
• An efficient algorithm for deriving summation identities from mutual recurrences
• Difference integrability conditions for parameterized linear difference and differential equations
• scientific article; zbMATH DE number 2151190 (Why is no real title available?)
• An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
• Solving linear recurrence equations with polynomial coefficients
• Fast algorithms for polynomial solutions of linear differential equations
• Efficient computation of terms of linear recurrence sequences of any order
• FPS in action
• Converging to Gosper's algorithm

This page was built for publication: Low complexity algorithms for linear recurrences

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