Sparse Distributed Multivariate Polynomial data structure is a dedicated data structure to represent polynomials. This data structure provides more efficient basic polynomial arithmetic than the generic sum. For example, the command a := SDMPolynom(x^3+5*x^2+11*x+15,x); creates the polynomial

This is a univariate polynomial in the variable x with integer coefficients.

Multivariate polynomials, and polynomials over other number rings and fields are constructed similarly.  For example, a := SDMPolynom(x*y^3+sqrt(-1)*y+y/2,[x,y]); creates

This is a bivariate polynomial in the variables x and y whose coefficients involve the imaginary number , which is denoted by capital I in Maple.

The type function can be used to test for polynomials. For example the command type(a, SDMPolynom)  tests whether the expression a is a polynomial in the variable x. For details, see type[SDMPolynom].

Polynomials in Maple are sorted in lexicographic order, that is, in descending power of the first indeterminate.

The remainder of this file contains a list of operations that are available for polynomials.

Utility Functions for Manipulating Polynomials

Arithmetic Operations on Polynomials

All the arithmetic operations on polynomials are wrapped inside the constructor SDMPolynom.

Mathematical Operations on Polynomials

Miscellaneous Polynomial Operations

The SDMPolynom command is thread-safe as of Maple 15.

For more information on thread safety, see index/threadsafe.