Development of TRIP: fast sparse multivariate polynomial multiplication using burst tries

  • Authors:

  • Mickaël Gastineau;Jacques Laskar

  • Affiliations:

  • Paris Observatory – IMCCE – CNRS UMR8028, Paris;Paris Observatory – IMCCE – CNRS UMR8028, Paris

  • Venue:
  • ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Flat vector representation of sparse multivariate polynomials is introduced in the computer algebra system TRIP with specific care to the cache memory. Burst tries are considered as an intermediate storage during the sparse multivariate polynomial multiplication by paying attention to the memory allocations. Timing and memory consumption are examined and compared with other recursive representations and other computer algebra systems.