Relaxed Multiplication Using the Middle Product

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2003, Pages 143-147

  Van der Hoeven, Joris ^a  

^a UNIVERSITÉ PARIS SUD   (France)

Author keywords

Middle product; Power series; Relaxed multiplication

Indexed keywords

ALGORITHMS; FAST FOURIER TRANSFORMS; LINEAR EQUATIONS; MATHEMATICAL MODELS; THEOREM PROVING;

MULTIPLE PRECISION ARITHMETIC; RELAXED MULTIPLICATION;

COMPUTATIONAL METHODS;

EID: 1542300117     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. CANTOR, D., AND KALTOFEN, E. On fast multiplication of polynomials over arbitrary algebras. Acta Information 28 (1991), 693-701.
2. COOLEY, J., AND TUKEY, J. An algorithm for the machine calculation of complex Fourier series. Math. Computat. 19 (1965), 297-301.
3. HANROT, G., QUERCIA, M., AND ZIMMERMANN, P. Speeding up the division and square root of power series. Research Report 3973, INRIA, July 2000. Available from http://www.inria.fr/RRRT/RR-3973.html.
4. HANROT, G., QUERCIA, M., AND ZIMMERMANN, P. The middle product algorithm I. speeding up the division and square root of power series. Submitted, 2002.
5. HANROT, G., AND ZIMMERMANN, P. A long note on mulders' short product. Research Report 4654, INRIA, Dec. 2002. Available from http://www.loria.fr/~hanrot/Papers/mulders.ps.
6. KARATSUBA, A., AND OFMAN, J. Multiplication of multidigit numbers on automata. Soviet Physics Doklady 7 (1963), 595-596.
7. KNUTH, D. The Art of Computer Programming, 3-rd ed., vol. 2: Seminumerical Algorithms. Addison-Wesley, 1997.
8. MULDERS, T. On short multiplication and division. AAECC 11, 1 (2000), 69-88.
9. SCHÖNHAGE, A., AND STRASSEN, V. Schnelle Multiplikation grosser Zahlen. Computing 7 7 (1971), 281-292.
10. VAN DER HOEVEN, J. Lazy multiplication of formal power series. In Proc. ISSAC '97 (Maui, Hawaii, July 1997), W. W. Küchlin, Ed., pp. 17-20.
11. VAN DER HOEVEN, J. Relax, but don't be too lazy. JSC 34 (2002), 479-542.