The middle product algorithm I. Speeding up the division and square root of power series

Applicable Algebra in Engineering, Communications and Computing

Volumn 14, Issue 6, 2004, Pages 415-438

  Hanrot, Guillaume ^a   Quercia, Michel ^b   Zimmermann, Paul ^b  

^a LORIA   (France)

^b NONE   (France)

Author keywords

Division; Inversion; Middle product; Newton's method; Square root

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; INVERSE PROBLEMS; ITERATIVE METHODS; MATHEMATICAL MODELS; POLYNOMIALS; ROOT LOCI; THEOREM PROVING;

MIDDLE PRODUCT ALGORITHM; POWER SERIES; SQUARE ROOT; TRANSPOSITION PRINCIPLE;

ALGORITHMS;

EID: 1842534273     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-003-0144-2     Document Type: Article

References (13)

1. Brent, R.P.: The complexity of multiple-precision arithmetic. In: The Complexity of Computational Problem Solving. R.S. Anderssen and R.P. Brent, (eds.), University of Queensland Press, pp. 126-165
2. Burnikel, C., Ziegler, J.: Fast recursive division. Research Report MPI-I-98-1-022, MPI Saarbrücken, 1998
3. Hanrot, G., Quercia, M., Zimmermann, P.: The Middle Product Algorithm, II, Floating point arithmetic. In preparation
4. Kaltofen, E.: Challenges of symbolic computation: My favorite open problems. J. Symbolic Comput. 29(6), 891-919 (2000)
5. Kaminski, M., Kirpatrick, D.G., Bshouty, N.H.: Addition requirements for matrix and transposed matrix products. J. Algorithms, 9, 354-364 (1988)
6. Karatsuba, A.A., Ofman, Y.P.: Multiplication of multiplace numbers by automata. Dokl. Akad. Nauk SSSR 145(2), 293-294 (1962)
7. Karp, A.H., Markstein, P.: High-precision division and square root. ACM Trans. Math. Softw. 23(4), 561-589 (1997)
8. Krandick, W., Johnson, J.R.: Efficient multiprecision floating point multiplication with exact rounding. RISC-Linz Report Series 93-76, RISC-Linz, Johannes Kepler University, 1993
9. Mulers, T.: On short multiplications and divisions. AAECC 11(1), 69-88 (2000)
10. Schönhage, A., Strassen, V.: Schnelle Multiplikation großer Zahlen. Computing 7, 281-292 (1971)
11. Shoup, V.: Efficient computation of minimal polynomials in algebraic extension of finite fields. In: Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (Vancouver, Canada), S. Dooley, (ed.), ACM, pp. 53-58.
12. van der Hoeven, J.: Relax, but don't be too lazy. J. Symbolic Comput. 34(6), 479-542 (2002)
13. Zimmermann, P.: Karatsuba square root. Research Report 3805, INRIA, 1999