Low complexity algorithms for linear recurrences
From MaRDI portal
Publication:2958967
DOI10.1145/1145768.1145781zbMath1356.65246OpenAlexW3101523321MaRDI QIDQ2958967
Alin Bostan, Thomas Cluzeau, Bruno Salvy, 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
complexitylinear recurrencescomputer algebrasummationcreative telescopingpolynomial and rational solutions
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Numerical aspects of recurrence relations (65Q30)
Related Items (4)
Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications ⋮ Difference integrability conditions for parameterized linear difference and differential equations ⋮ Converging to Gosper's algorithm ⋮ Accelerating indefinite summation: simple classes of summands
This page was built for publication: Low complexity algorithms for linear recurrences
