Fast algorithms for polynomial solutions of linear differential equations

DOI10.1145/1073884.1073893zbMath1360.68920OpenAlexW1998639298MaRDI QIDQ5262741

Bruno Salvy, Thomas Cluzeau, Alin Bostan

Publication date: 16 July 2015

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

Full work available at URL: https://doi.org/10.1145/1073884.1073893

zbMATH Keywords

complexitylinear differential equationslinear recurrencescomputer algebrapolynomial solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Linear ordinary differential equations and systems (34A30)

Related Items (6)

Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications ⋮ Computing hypergeometric solutions of linear recurrence equations ⋮ Computing Polynomial Solutions and Annihilators of Integro-Differential Operators with Polynomial Coefficients ⋮ Solving difference equations whose coefficients are not transcendental ⋮ Integrable planar homogeneous potentials of degree \(- 1\) with small eigenvalues ⋮ Polynomial solutions of certain differential equations arising in physics

This page was built for publication: Fast algorithms for polynomial solutions of linear differential equations