POLY, a new polynomial data structure for Maple 17. 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, $dots$) 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.
References in zbMATH (referenced in 4 articles , 3 standard articles )
Showing results 1 to 4 of 4.
- Monagan, Michael; Tuncer, Baris: Using sparse interpolation in hensel lifting (2016)
- Monagan, Michael; Pearce, Roman: The design of Maple’s sum-of-products and POLY data structures for representing mathematical objects (2014)
- Monagan, Michael; Pearce, Roman: POLY: a new polynomial data structure for Maple 17 (2014)
- Monagan, Michael; Pearce, Roman: POLY: a new polynomial data structure for Maple 17 (2012) ioport