Algorithms used by Groebner[Basis] - Maple Help

Online Help

All Products    Maple    MapleSim

Home : Support : Online Help : Mathematics : Algebra : Polynomials : Groebner : Groebner/Basis_algorithms

Algorithms used by Groebner[Basis]

Calling Sequence

Basis(J, tord, method=meth)




a list or set of polynomials or a PolynomialIdeal



a MonomialOrder, a ShortMonomialOrder, or a name



one of the methods described below



The Groebner[Basis] command currently relies on a combination of five different algorithms to compute Groebner bases for various monomial orders and domains.  This help page documents these algorithms and their relative performance characteristics to help you decide what algorithm to use should the default choice prove unsatisfactory.  The algorithm is specified using an optional argument method=meth.


method=fgb runs FGb, which is a compiled implementation of the F4 algorithm written by J.C. Faugere. FGb supports rational number and integer mod p coefficients, where p < 2^(kernelopts(wordsize)/2), which is 65536 on a 32-bit machine.  FGb supports tdeg orders and lexdeg orders with two blocks of variables.  It does not support parameters (that is, coefficients in a rational function field) or the output=extended option.


method=maplef4 runs a Maple implementation of the F4 algorithm.  This implementation supports all monomial orders and coefficient fields as well as computations in non-commutative Ore algebras.  It is an exact implementation, meaning that it does not use modular methods, so it is preferable to run FGb if possible.  The output=extended option is currently not supported.


method=buchberger runs the traditional Maple implementation of the Buchberger algorithm. This algorithm supports all domains, monomial orders and options such as output=extended. It is generally outperformed by F4 in most situations, but one notable exception is when a polynomial has been added to a Groebner basis and the basis is being recomputed. The implementation is based on Gebauer and Moller and uses the normal selection strategy.


method=fglm runs the Groebner basis conversion algorithm of Faugere, Gianni, Lazard, and Mora. This algorithm supports all commutative domains, but requires the ideal to be zero-dimensional. See the Groebner[FGLM] help page for more details.  When this method is specified, Groebner[Basis] will choose one of the known Groebner bases (or compute one if none are known) and run Groebner[FGLM].


method=walk runs the Groebner Walk conversion algorithm of Collart, Kalkbrener, and Mall, which supports all commutative domains and monomial orders.   See the Groebner[Walk] help page for more details.  When this method is specified, Groebner[Basis] will choose one of the known Groebner bases (or compute one if none are known) and run Groebner[Walk].  The Groebner walk is typically slower than FGLM for zero-dimensional ideals.


In addition to the algorithms above, you can specify an overall strategy using the method=... option and Groebner[Basis] will choose whatever algorithms are appropriate.  The strategies are as follows:


method=direct runs the fastest general purpose direct method.  This is currently FGb or Maple's F4 if FGb cannot be used. As better algorithms are implemented, this strategy will be updated to reflect the state-of-the-art method. Thus, calling Groebner[Basis] with method=direct is a way to ensure that your code always uses the fastest direct algorithm; even on future Maple releases.


method=convert runs the fastest applicable conversion method, which is either FGLM or the Groebner Walk, depending on the monomial order and whether the ideal is zero-dimensional. This strategy is recommended for monomial orders that eliminate variables.  For 'plex', 'lexdeg' and 'prod' orders, the strategy is to run FGLM if possible.  For all other orders and for non-zero-dimensional ideals, the Groebner Walk is used.


method=default runs the default strategy, which is subject to change in the future. Currently this is method=direct for 'tdeg', 'wdeg', 'grlex' and 'matrix' orders and non-commutative problems, and method=convert for 'plex', 'lexdeg' and 'prod' orders in the commutative case.


Setting infolevel[GroebnerBasis] to a value between 1 and 5 directs all of the algorithms to print information about their progress and performance.








-> FGb
 total time:         0.023 sec




-> F4 algorithm
 total time:         0.004 sec




-> FGLM algorithm
 total monomials  :   23
 total time   (sec)   .4e-2







-> Groebner Walk
 total time:         0.000 sec




-> FGb
 total time:         0.004 sec




-> F4 algorithm
 total time:         0.017 sec




-> Groebner Walk
 total time:         0.033 sec



Non-commutative examples (see Basis_details for more information)















-> F4 algorithm
 domain: SkewAlgebra   coeffs: rat_fcn
 basis: 1 of 3, syzygies: 3 of 3, degree: 4
 0 x 0 with 3 rhs
 basis: 2 of 5, syzygies: 1 of 3, degree: 4
 2 x 2 with 1 rhs
 basis: 3 of 6, syzygies: 2 of 2, degree: 5
 4 x 4 with 2 rhs
 basis: 5 of 8, syzygies: 4 of 4, degree: 6
 12 x 12 with 4 rhs
 basis: 8 of 11, syzygies: 11 of 12, degree: 7
 39 x 39 with 11 rhs
 basis: 10 of 13, syzygies: 10 of 10, degree: 8
 75 x 75 with 10 rhs
 basis: 12 of 15, syzygies: 7 of 7, degree: 9
 94 x 94 with 7 rhs
 symbolic prc        0.154 sec
 inter reduce        0.003 sec
 update pairs        0.000 sec
 reduce basis        0.010 sec
 total time:         0.167 sec




See Also

Basis, Basis_details, LeadingMonomial, MonomialOrder



Buchberger, B. "Grobner Bases: An algorithmic method in polynomial ideal theory." In Multidimensional systems theory, pp. 184-232, Reidel, 1985.


Collart, S.; Kalkbrener, M.; and Mall, D. "Converting Bases with the Grobner Walk."  J. Symbolic Comput., Vol. 3, No. 4, (1997): 465-469.


Faugere, J. "A New Efficient Algorithm for Computing Grobner Bases (F4)." Journal of Pure and Applied Algebra, Vol. 139, No. 1-3, (1999): 61-88.


Faugere, J.; Gianni, P.; Lazard, D.; and Mora, T. "Efficient computation of zero-dimensional Grobner bases by change of ordering." J. Symbolic Comput., Vol. 16, (1993): 329-344.


Gebauer, R., and Moller, H. "On an installation of Buchberger's algorithm." J. Symbolic Comput., Vol. 6, (1988): 275-286.


Pearce, R., and Monagan, M. "A Sparse Algorithm for Polynomial Division with Application to F4." in preparation, 2006.

Download Help Document

Was this information helpful?

Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam