A simple and fast online power series multiplication and its analysis

This paper focuses on online (or relaxed) algorithms for the multiplication of power series over a field and their complexity analysis. We propose a new online algorithm for the multiplication using middle and short products of polynomials as building blocks, and we give the first precise analysis of the arithmetic complexity of various online multiplications. Our algorithm is faster than Fischer and Stockmeyer's by a constant factor; this is confirmed by experimental results.

[1]  Jean-Michel Muller,et al.  Modern Computer Arithmetic , 2016, Computer.

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

[3]  Romain Lebreton.  Contributions à l'algorithmique détendue et à la résolution des systèmes polynomiaux. (Contributions to relaxed algorithms and polynomial system solving) , 2012 .

[4]  Guillaume Hanrot,et al.  A long note on Mulders' short product , 2004, J. Symb. Comput..

[5]  Matthias Schröder,et al.  Fast Online Multiplication of Real Numbers , 1997, STACS.

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

[7]  Joris van der Hoeven,et al.  Relax, but Don't be Too Lazy , 2002, J. Symb. Comput..

[8]  Joris van der Hoeven.  Relaxed mltiplication using the middle product , 2003, ISSAC.

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

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

[11]  Joris van der Hoeven.  The truncated fourier transform and applications , 2004, ISSAC '04.

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

[13]  Jérémy Berthomieu,et al.  Relaxed p-adic Hensel lifting for algebraic systems , 2012, ISSAC.

[14]  Joris van der Hoeven,et al.  Faster relaxed multiplication , 2014, ISSAC.

[15]  Michael J. Fischer,et al.  Fast on-line integer multiplication , 1973, STOC '73.

[16]  J. V. D. Hoeven,et al.  Relaxed algorithms for p-adic numbers , 2011 .

[17]  Joris van der Hoeven.  New algorithms for relaxed multiplication , 2007, J. Symb. Comput..

[18]  Joris van der Hoeven,et al.  Lazy multiplication of formal power series , 1997, ISSAC.

[19]  Thom Mulders.  On Short Multiplications and Divisions , 2000, Applicable Algebra in Engineering, Communication and Computing.

[20]  F. C. Hennie,et al.  On-Line Turing Machine Computations , 1966, IEEE Trans. Electron. Comput..