# A long note on Mulders' short product

1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The short product of two power series is the meaningful part of the product of these objects, i.e. $\sum_{i+j < n} a_ib_j x^{i+j}$. In \cite{Mulders00}, Mulders gives an algorithm to compute a short product faster than the full product in the case of Karatsuba's multiplication \cite{KaOf62}. This algorithm works by selecting a cutoff point $k$ and performing a full $k\times k$ product and two $(n-k)\times (n-k)$ short products recursively. Mulders also gives a heuristically optimal cutoff point $\beta n$. In this paper, we determine the optimal cutoff point in Mulders' algorithm. We also give a slightly more general description of Mulders' method.
Mots-clés :
Type de document :
Article dans une revue
Journal of Symbolic Computation, Elsevier, 2004, 37 (3), pp.391--401
Domaine :

https://hal.inria.fr/inria-00100069
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:13:52
Dernière modification le : jeudi 11 janvier 2018 - 06:20:00

### Identifiants

• HAL Id : inria-00100069, version 1

### Citation

Guillaume Hanrot, Paul Zimmermann. A long note on Mulders' short product. Journal of Symbolic Computation, Elsevier, 2004, 37 (3), pp.391--401. 〈inria-00100069〉

### Métriques

Consultations de la notice