POLY: A New Polynomial Data Structure for Maple 17

Michael Monagan () and Roman Pearce ()
Additional contact information
Michael Monagan: Simon Fraser University, Department of Mathematics
Roman Pearce: Simon Fraser University, Department of Mathematics

A chapter in Computer Mathematics, 2014, pp 325-348 from Springer

Abstract: Abstract We demonstrate how a new data structure for sparse distributed polynomials in the Maple 17 kernel significantly accelerates several key Maple library routines. The POLY data structure and its associated kernel operations are programmed for compactness, scalability, and low overhead. This allows polynomials to have tens of millions of terms, increases parallel speedup, and improves the performance of Maple library routines.

Keywords: Total Degree; Lexicographical Order; Computer Algebra System; Polynomial Multiplication; Parallel Speedup (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-43799-5_24

Ordering information: This item can be ordered from
http://www.springer.com/9783662437995

DOI: 10.1007/978-3-662-43799-5_24

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().