Quasi-optimal Multiplication of Linear Differential Operators

We show that linear differential operators with polynomial coefficients over a field of characteristic zero can be multiplied in quasi-optimal time. This answers an open question raised by van der Hoeven.

[1]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[2]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[3]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[4]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[5]  Victor Y. Pan,et al.  How to Multiply Matrices Faster , 1984, Lecture Notes in Computer Science.

[6]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.

[7]  O. Ore.  Theory of Non-Commutative Polynomials , 1933 .

[8]  Alfred V. Aho,et al.  Evaluating Polynomials at Fixed Sets of Points , 1975, SIAM J. Comput..

[9]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[10]  Robert T. Moenck.  Another polynomial homomorphism , 2004, Acta Informatica.

[11]  V. Pan.  Structured Matrices and Polynomials , 2001 .

[12]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[13]  V. Pan,et al.  Polynomial and matrix computations (vol. 1): fundamental algorithms , 1994 .

[14]  V. Pan.  Structured Matrices and Polynomials: Unified Superfast Algorithms , 2001 .

[15]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[16]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[17]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[18]  A. J. Stothers.  On the complexity of matrix multiplication , 2010 .

[19]  Amin Shokrollahi,et al.  Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation , 2000, STOC '00.

[20]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[21]  Ziming Li,et al.  Power series solutions of singular (q)-differential equations , 2012, ISSAC.

[22]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[23]  Dima Grigoriev,et al.  Complexity of Factoring and Calculating the GCD of Linear Ordinary Differential Operators , 1990, J. Symb. Comput..

[24]  W. Marsden.  I and J , 2012 .

[25]  Joris van der Hoeven.  FFT-like Multiplication of Linear Differential Operators , 2002, J. Symb. Comput..

[26]  Öystein Ore.  Formale Theorie der linearen Differentialgleichungen. (Erster Teil). , 1932 .

[27]  Nicolas Le Roux,et al.  Products of ordinary differential operators by evaluation and interpolation , 2008, ISSAC '08.

[28]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[29]  D. Grigor'ev,et al.  Complexity of factoring and calculating the GCD of linear ordinary differential operators , 1990 .

[30]  Francis Y. L. Chin.  A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation , 1976, SIAM J. Comput..