Fast in-place algorithms for polynomial operations: division, evaluation, interpolation

We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that such problems can be solved in (nearly) the same asymptotic time as fast polynomial multiplication. However, these reductions, even when applied to an in-place variant of fast polynomial multiplication, yield algorithms which require at least a linear amount of extra space for intermediate results. We demonstrate new in-place algorithms for the aforementioned polynomial computations which require only constant extra space and achieve the same asymptotic running time as their out-of-place counterparts. We also provide a precise complexity analysis so that all constants are made explicit, parameterized by the space usage of the underlying multiplication algorithms.

[1]  Alan H. Karp,et al.  High-precision division and square root , 1997, TOMS.

[2]  Arnold Schönhage.  Probabilistic Computation of Integer Polynomial GCDs , 1988, J. Algorithms.

[3]  H. T. Kung.  On computing reciprocals of power series , 1974 .

[4]  Michael Monagan,et al.  In-place Arithmetic for Polynomials over Zn , 1993 .

[5]  Bruno Grenet,et al.  Generic Reductions for In-place Polynomial Multiplication , 2019, ISSAC.

[6]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[7]  Joachim von zur Gathen,et al.  Modern Computer Algebra (3. ed.) , 2003 .

[8]  Michael B. Monagan.  In-place Arithmetic for Polinominals over Zn , 1992, DISCO.

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

[10]  Joris van der Hoeven,et al.  Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) , 2019, J. ACM.

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

[12]  Charles E. Leiserson,et al.  Cache-Oblivious Algorithms , 2003, CIAC.

[13]  S. Cook,et al.  ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .

[14]  David Harvey,et al.  An in-place truncated fourier transform and applications to polynomial multiplication , 2010, ISSAC.

[15]  Éric Schost,et al.  Tellegen's principle into practice , 2003, ISSAC '03.

[16]  Allan Borodin,et al.  Fast Modular Transforms via Division , 1972, SWAT.

[17]  Daniel S. Roche.  Space- and time-efficient polynomial multiplication , 2009, ISSAC '09.

[18]  Emmanuel Thomé.  Karatsuba multiplication with temporary space of size ≤ n , 2002 .

[19]  D. J. Bernstein.  Fast multiplication and its applications , 2008 .

[20]  Guillaume Hanrot,et al.  The Middle Product Algorithm I , 2004, Applicable Algebra in Engineering, Communication and Computing.

[21]  Joachim von zur Gathen,et al.  Computing Frobenius maps and factoring polynomials , 2005, computational complexity.

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