Relaxed mltiplication using the middle product

In previous work, we have introduced the technique of relaxed power series computations. With this technique, it is possible to solve implicit equations almost as quickly as doing the operations which occur in the implicit equation. In this paper, we present a new relaxed multiplication algorithm for the resolution of linear equations. The algorithm has the same asymptotic time complexity as our previous algorithms, but we improve the space overhead in the divide and conquer model and the constant factor in the F.F.T. model.

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

[2]  David Thomas,et al.  The Art in Computer Programming , 2001 .

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

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

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

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

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

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

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

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

[11]  P. Zimmermann,et al.  Speeding up the Division and Square Root of Power Series , 2000 .