On the bit-complexity of sparse polynomial and series multiplication

  • Authors:

  • Joris Van Der Hoeven;GréGoire Lecerf

  • Affiliations:

  • Laboratoire dInformatique, UMR 7161 CNRS, ícole polytechnique, 91128 Palaiseau Cedex, France;Laboratoire dInformatique, UMR 7161 CNRS, ícole polytechnique, 91128 Palaiseau Cedex, France

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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, under the assumption that a tight superset of the support of the product is known, we are able to observe the benefit of asymptotically fast arithmetic for sparse 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.