A long note on Mulders' short product - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2002

A long note on Mulders' short product

Résumé

The short product of two power series is the meaningful part of the product of these objects, i.e., _i+j < n a_ib_j x^i+j. In , Mulders gives an algorithm to compute a short product faster than the full product in the case of Karatsuba's multiplication . This algorithm work by selecting a cutoff point k and performing a full kk product and two (n-k)(n-k) short products recursively. Mulders also gives an heuristically optimal cutoff point n. In this paper, we determine the optimal cutoff point in Mulders' algorithm. We also give a slightly more general description of Mulders' method.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4654.pdf (303.56 Ko) Télécharger le fichier

Dates et versions

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

Identifiants

  • HAL Id : inria-00071931 , version 1

Citer

Guillaume Hanrot, Paul Zimmermann. A long note on Mulders' short product. [Research Report] RR-4654, INRIA. 2002. ⟨inria-00071931⟩
203 Consultations
208 Téléchargements

Partager

Gmail Facebook X LinkedIn More