Affiliation:
1. Simon Fraser University, Burnaby, British Columbia
Abstract
The principal data structure Maple uses to represent polynomials and general mathematical expressions involving functions like sin
x, e
2x
, y'(x),(n/k)
etc., is known to the Maple developers as the sum-of-products data structure. Gaston Gonnet, as the primary author of the Maple kernel, designed and implemented this data structure in the early 1980s. As part of the process of simplifying a mathematical formula, he represented every Maple object and every sub-object uniquely in memory. This makes testing for equality of expressions very fast. In this article, on occasion of Gonnet's retirement, we present details of his design, its pros and cons, and changes we and others have made to it over the years. One of the cons of the sum-of-products data structure is it is not as efficient at multiplying multivariate polynomials as other special purpose computer algebra systems. We describe a new data structure called POLY that we added to Maple 17 (released in 2013) to improve performance for polynomials in Maple, and recent work done for Maple 18 (released in 2014).
Publisher
Association for Computing Machinery (ACM)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Interpolation Algorithm for Computing Dixon Resultants;Computer Algebra in Scientific Computing;2022
2. Sparse nonnegative convolution is equivalent to dense nonnegative convolution;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
3. Algorithms and Data Structures for Sparse Polynomial Arithmetic;Mathematics;2019-05-17
4. What Can (and Can't) we Do with Sparse Polynomials?;Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation;2018-07-11
5. Sparse Polynomial Arithmetic with the BPAS Library;Developments in Language Theory;2018