ACM communications in computer algebra · 2011 · 11 citations · 9 references
Mathematical ProgrammingMaple 14Massively-parallel ComputingArray ComputingPolynomial Data StructureEngineeringAlgorithmic LibraryComputer EngineeringComputer AlgebraAlgebraic MethodParallel ProgrammingComputer ScienceSparse Polynomial MultiplicationParallel ComputingComputational GeometryApplied AlgebraMaple 13Vectorization
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.
9
A tutorial introduction to Maple
Bruce W. Char, Gregory J. Fee, K. O. Geddes et al. · Journal of Symbolic Computation · 1986 · 83 citations
Mathematical Programming, Engineering, Algorithmic Library +5
S. C. Johnson · ACM SIGSAM Bulletin · 1974 · 66 citations · Full text
Mathematical Programming, Sparse Representation, Engineering +14