Next: New library packages
Up: New features that have
Previous: Arithmetic over finite
-
ellipsoid: surface area of an ellipsoid
-
evalr: evaluation over a range(s)
-
fnormal: floating point normalization
-
galois: compute the galois group of a (univariate) polynomial (up to degree 7)
-
history: a history mechanism (an alternative to Maple "s)
-
iratrecon: rational reconstruction
-
mellin: Mellin transform
-
poisson: Poisson series expansion
-
irreduc: irreducibility test of a (multivariate) polynomial
-
roots: compute the roots of a (univariate) polynomial
-
shake: real interval arithmetic (to Digits precision)
-
sturm: use the Sturm sequence to find the number of real roots in an interval
-
sturmseq: compute the Sturm sequence of a polynomial over Q or R
-
thiele: continued fraction interpolation
-
userinfo: generate user information
-
ztrans, invztrans: the Z-transform and its inverse
-
C: Maple to C language translator
-
FFT: Fast Fourier transform
-
Hermite: compute the Hermite normal form of a matrix over a finite field
-
Irreduc: irreducibility test of a (univariate) polynomial mod p
-
MOLS: generates mutually orthogonal Latin squares
-
Nullspace: compute the nullspace of a matrix over a finite field
-
Primitive: tests if a univariate polynomial over a finite field is primitive
-
Randpoly: random univariate polynomial of degree mod
-
Randprime: random monic irreducible univariate polynomial of degree mod
-
Smith: compute the Smith normal form of a matrix over a finite field