论文信息 - Sparse polynomial multiplication and division in Maple 14

Sparse polynomial multiplication and division in Maple 14

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.

Michael B. Monagan | Roman Pearce

[1] Stephen C. Johnson,et al. Sparse polynomial arithmetic , 1974, SIGS.

[2] Michael B. Monagan,et al. Parallel sparse polynomial division using heaps , 2010, PASCO.

[3] Hans Schönemann,et al. SINGULAR: a computer algebra system for polynomial computations , 2001, ACCA.

[4] Richard J. Fateman. Comparing the speed of programs for sparse polynomial multiplication , 2003, SIGS.

[5] Michael B. Monagan,et al. Parallel sparse polynomial multiplication using heaps , 2009, ISSAC '09.

[6] Jacques Laskar,et al. Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries , 2006, International Conference on Computational Science.

[7] Andrew D. Hall,et al. The Altran system for rational function manipulation — a survey , 1971, CACM.

[8] Bruce W. Char,et al. A Tutorial Introduction to Maple , 1986, J. Symb. Comput..

[9] Hans Schönemann,et al. Monomial representations for Gröbner bases computations , 1998, ISSAC '98.

[10] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[11] Michael B. Monagan,et al. Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors , 2007, CASC.

[12] Michael B. Monagan,et al. Sparse polynomial division using a heap , 2011, J. Symb. Comput..