Fast algorithms for polynomial solutions of linear differential equations
From MaRDI portal
Publication:5262741
Recommendations
Cited in
(23)- scientific article; zbMATH DE number 2145162 (Why is no real title available?)
- Low complexity algorithms for linear recurrences
- Fast algorithms for differential equations in positive characteristic
- Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
- Differential equations for algebraic functions
- On \(p\)-adic differential equations with separation of variables
- Fast algorithms for zero-dimensional polynomial systems using duality
- Complexity estimates for two uncoupling algorithms
- scientific article; zbMATH DE number 3919643 (Why is no real title available?)
- Fast recursive algorithms for a class of linear equations
- General theory for integer-type algorithm for higher order differential equations
- Fast computation of power series solutions of systems of differential equations
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- Polynomial and rational solutions of holonomic systems
- Systems of linear equations with dense univariate polynomial coefficients
- Polynomial solutions of certain differential equations arising in physics
- Computing hypergeometric solutions of linear recurrence equations
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- Solving difference equations whose coefficients are not transcendental
- On the complexity of skew arithmetic
- scientific article; zbMATH DE number 2151234 (Why is no real title available?)
- Integrable planar homogeneous potentials of degree \(- 1\) with small eigenvalues
- Computing Polynomial Solutions and Annihilators of Integro-Differential Operators with Polynomial Coefficients
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)
