On the bit-complexity of sparse polynomial and series multiplication

Abstract : In this paper we present various algorithms for multiplying multivariate polynomials and series. All algorithms have been implemented in the C++ libraries of the Mathemagix system. We describe naive and softly optimal variants for various types of coefficients and supports and compare their relative performances. For the first time we are able to observe the benefit of non naive arithmetic for multivariate polynomials and power series, which might lead to speed-ups in several areas of symbolic and numeric computation. For the sparse representation, we present new softly linear algorithms for the product whenever the destination support is known, together with a detailed bit-complexity analysis for the usual coefficient types. As an application, we are able to count the number of the absolutely irreducible factors of a multivariate polynomial with a cost that is essentially quadratic in the number of the integral points in the convex hull of the support of the given polynomial. We report on examples that were previously out of reach.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Contributeur : Grégoire Lecerf <>
Soumis le : samedi 24 avril 2010 - 19:45:13
Dernière modification le : vendredi 10 février 2017 - 01:13:13
Document(s) archivé(s) le : mardi 28 septembre 2010 - 12:59:37


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00476223, version 1



Joris Van Der Hoeven, Grégoire Lecerf. On the bit-complexity of sparse polynomial and series multiplication. 2010. <hal-00476223>



Consultations de
la notice


Téléchargements du document