|[ << ]||[ < ]||[ Up ]||[ > ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
In the vesion before 2003,
facilities for computing Groebner bases are
To call these functions,
it is necessary to set several parameters correctly and it is convenient
to use a set of interface functions provided in the library file
The facilities will be ready to use after you load the package by
load(). The package ‘gr’ is placed in the standard library
directory of Asir.
In the current vesion, new functions such as
nd_f4 are available
and these function can compute Groebner bases more efficiently than old functions
There are many functions and options defined in the package ‘gr’. Usually not so many of them are used. Top level functions for Groebner basis computation are the following three functions.
In the following description, plist, vlist, order
and p stand for a list of polynomials, a list of variables
(indeterminates), a type of term ordering and a prime less than
Function that computes Groebner bases over the rationals. The algorithm is Buchberger algorithm with useless pair elimination criteria by Gebauer-Moeller, sugar strategy and trace-lifting by Traverso. For ordinary computation, this function is used.
After homogenizing the input polynomials a candidate of the \gr basis is computed by trace-lifting. Then the candidate is dehomogenized and checked whether it is indeed a Groebner basis of the input. Sugar strategy often causes intermediate coefficient swells. It is empirically known that the combination of homogenization and supresses the swells for such cases.
Function that computes Groebner bases over GF(p). The same
gr() is used.
In the current version, the functions corresponding to these three interfaces are provided
|[ << ]||[ < ]||[ Up ]||[ > ]||[ >> ]|
This document was generated on December 1, 2023 using texi2html 5.0.