The Middle Product Algorithm, I. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

The Middle Product Algorithm, I.

Abstract

We present new algorithms for the inverse, division, and square root of power series. The key trick is a new algorithm --- MiddleProduct or, for short, MP --- computing the n middle coefficients of a (2n-1)*n full product in the same number of multiplications as a full n*n product. This improves previous work of Brent, Mulders, Karp and Markstein, Burnikel and Ziegler. A forthcoming paper will study the floating-point case.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4664.pdf (658.83 Ko) Télécharger le fichier

Dates and versions

inria-00071921 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071921 , version 1

Cite

Guillaume Hanrot, Michel Quercia, Paul Zimmermann. The Middle Product Algorithm, I.. [Research Report] RR-4664, INRIA. 2002. ⟨inria-00071921⟩
164 View
43870 Download

Share

Gmail Facebook Twitter LinkedIn More