Fast algorithms for polynomial solutions of linear differential equations

DOI10.1145/1073884.1073893zbMATH Open1360.68920OpenAlexW1998639298MaRDI QIDQ5262741FDOQ5262741

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

complexitycomputer algebralinear recurrenceslinear differential equationspolynomial 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)

Cited In (14)

• Title not available (Why is that?)
• Computing Polynomial Solutions and Annihilators of Integro-Differential Operators with Polynomial Coefficients
• Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
• Title not available (Why is that?)
• Polynomial and rational solutions of holonomic systems
• Polynomial solutions of certain differential equations arising in physics
• Fast recursive algorithms for a class of linear equations
• Fast algorithms for zero-dimensional polynomial systems using duality
• Solving difference equations whose coefficients are not transcendental
• Integrable planar homogeneous potentials of degree \(- 1\) with small eigenvalues
• Computing hypergeometric solutions of linear recurrence equations

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

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