|
5.1.35 fglm
Syntax:
fglm ( ring_name, ideal_name )
Type:
- ideal
Purpose:
- computes for the given ideal in the given ring
a reduced Groebner basis in the current ring, by applying the so-called FGLM
(Faugere, Gianni, Lazard, Mora) algorithm.
The main application is to compute a lexicographical Groebner basis
from a reduced Groebner basis with respect to a degree ordering. This
can be much faster than computing a lexicographical Groebner basis
directly.
Assume:
- The ideal must be zero-dimensional and given as a reduced Groebner
basis in the given ring. The monomial ordering must be global.
Note:
- The only permissible differences between the given ring and the current ring
are the monomial ordering and a permutation of the variables,
resp. parameters.
Example:
See
fglmquot;
option;
qring;
ring;
std;
stdfglm;
vdim.
|