Sparse polynomial multiplication and division in Maple 14

Authors:
Michael Monagan;Roman Pearce
Affiliations:
Simon Fraser University, Burnaby B.C., Canada;Simon Fraser University, Burnaby B.C., Canada
Venue:
ACM Communications in Computer Algebra
Year:
2011

Citing 10
Cited 3

The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Monomial representations for Gröbner bases computations

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
The Altran system for rational function manipulation — a survey

Communications of the ACM
Comparing the speed of programs for sparse polynomial multiplication

ACM SIGSAM Bulletin
Sparse polynomial arithmetic

ACM SIGSAM Bulletin
Parallel sparse polynomial multiplication using heaps

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Parallel sparse polynomial division using heaps

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Sparse polynomial division using a heap

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

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Polynomial division using dynamic arrays, heaps, and packed exponent vectors

CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing

On the bit-complexity of sparse polynomial and series multiplication

Journal of Symbolic Computation
POLY: a new polynomial data structure for Maple 17

ACM Communications in Computer Algebra
On the complexity of multivariate blockwise polynomial multiplication

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate new routines for sparse multivariate polynomial multiplication and division over the integers that we have integrated into Maple 14 through the expand and divide commands. These routines are currently the fastest available, and the multiplication routine is parallelized with superlinear speedup. The performance of Maple is significantly improved. We describe our polynomial data structure and compare it with Maple's. Then we present benchmarks comparing Maple 14 with Maple 13, Magma, Mathematica, Singular, Pari, and Trip.