Outline

Singular

Contributors

History

Algorithms

Libraries

Comparisons

Examples

Singular-2-0

Availability

Standard basis Algorithms

General standard basis algorithm for any monomial ordering. Includes:

• well-orderings: Buchberger algorithm
• tangent-cone (local) orderings: Mora algorithm

Variants of standard basis algorithm:

• Traverso's Hilbert-driven Groebner basis algorithm
• weighted-ecart-method
• high-corner-method
• Factorizing Buchberger algorithm
• FGLM for change of monomial ordering

Singular is one of the fastest systems for Groebner bases computations