FFT-like multiplication of linear differential operators
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- On the complexity of skew arithmetic
- Products of ordinary differential operators by evaluation and interpolation
- Inverse linear difference operators
- On the differential and full algebraic complexities of operator matrices transformations
- Computing the bound of an Ore polynomial. Applications to factorization
- Ore polynomial rings in one variable in computer algebra.
- On Computing the Hermite Form of a Matrix of Differential Polynomials
- Efficient Quotients of Non-commutative Polynomials
- Optimization techniques for small matrix multiplication
- Sparse multiplication of multivariate linear differential operators
This page was built for publication: FFT-like multiplication of linear differential operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599537)