POLY: a new polynomial data structure for Maple 17

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:
2013

Citing 7
Cited 0

Hacker's Delight

Hacker's Delight
Parallel sparse polynomial multiplication using heaps

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Parallel sparse polynomial division using heaps

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Sparse polynomial multiplication and division in Maple 14

ACM Communications in Computer Algebra
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate how a new data structure for sparse distributed polynomials in the Maple kernel significantly accelerates a large subset of Maple library routines. The POLY data structure and its associated kernel operations (degree, coeff, subs, has, diff, eval, ...) are programmed for high scalability, allowing polynomials to have hundreds of millions of terms, and very low overhead, increasing parallel speedup in existing routines and improving the performance of high level Maple library routines.