FFT-like multiplication of linear differential operators

DOI10.1006/jsco.2000.0496zbMath1006.16029OpenAlexW2029001542MaRDI QIDQ1599537

Joris van der Hoeven

Publication date: 11 June 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2000.0496

zbMATH Keywords

skew polynomial ringslinear differential operatorscomputationmatrix multiplication

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordinary and skew polynomial rings and semigroup rings (16S36) Rings of differential operators (associative algebraic aspects) (16S32) Computational aspects of associative rings (general theory) (16Z05)

Related Items (7)

Ore polynomial rings in one variable in computer algebra. ⋮ Inverse linear difference operators ⋮ Computing the bound of an Ore polynomial. Applications to factorization ⋮ Optimization techniques for small matrix multiplication ⋮ On Computing the Hermite Form of a Matrix of Differential Polynomials ⋮ On the Differential and Full Algebraic Complexities of Operator Matrices Transformations ⋮ On the complexity of skew arithmetic

Cites Work

• Unnamed Item
• How to multiply matrices faster
• Matrix multiplication via arithmetic progressions
• Gaussian elimination is not optimal
• Fast multiplication of large numbers
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: FFT-like multiplication of linear differential operators