GroebnerBasis
 Usage
Notes
 Further Examples
Groebner bases are a generalization of row reduction.
In[1]:=
|
Out[1]=
|
In[2]:=
|
Out[2]=
|
The time and memory required to calculate a Groebner basis depend very much on the variable ordering, monomial ordering, and on which (if any) variables are regarded as constants.
For example, it is typical for degree reverse lexicographic monomial ordering to be faster and to give simpler output than pure lexicographic ordering, other things being the same.
We define a function to show the timing for six variations, as well as the number of polynomials, the number of terms in each polynomial, the total degree of each polynomial, and the largest coefficient in each polynomial.
In[3]:=
|
Here is a set of polynomials. We do six Groebner bases on this set.
In[4]:=
|
In[5]:=
|
Out[5]//TableForm=
|
In[6]:=
|
Out[6]//TableForm=
|
In[7]:=
|
Out[7]//TableForm=
|
In[8]:=
|
Out[8]//TableForm=
|
In[9]:=
|
Out[9]//TableForm=
|
In[10]:=
|
Out[10]//TableForm=
|
In[11]:=
|
|
