| |
| |
|
| |
More mathematics
Continuous efforts to improve and augment the Maple math engine result in numerous additions for Maple 12.
Highlights:
- The new ability to analyze and solve systems of parametrized polynomial equations and inequalities. This ability allows you to ask questions such as “For which parameter values does the system of equations have at least one solution?” Problems in science and engineering, such as determining the stability of a control system, can be phrased as questions of this type.
- Support for inert functions in Maple has been greatly extended to include any Maple or user-defined function. When using the inert representation, Maple does not evaluate the function until it is specifically requested, by using the value command. Inert representations can be used to set up problems involving specialized floating-point evaluation routines, to preserve the overall structure of an expression, or to delay the evaluation of parts of an expression.
|
|
|
|
| |
- A new version of the Zeilberger algorithm for definite hypergeometric summation has been added to the SumTools[Hypergeometric] package. This new version is based on universal denominators and is faster than the other version, which is based on Gosper's algorithm.
- The number theory package contains a new command, which tests whether a polynomial is cyclotomic.
- The solve command takes further advantage of the FGb library, the world’s most efficient Groebner bases engine. It also uses a new, faster sparse exact linear system solver for systems with rational coefficients.
- The linear algebra package contains a new command for computing the Kronecker tensor product of two matrices.
- Sets now have a deterministic ordering that is not based on runtime properties.
|
|
|
