Some examples for solving systems of algebraic equations by calculating Gröbner bases (Q1082037)

The paper presents a number of experiments with the algorithm of B. Buchberger for calculating Gröbner bases in the form described by \textit{F. Winkler}, \textit{B. Buchberger}, \textit{F. Lichtenberger} and \textit{H. Rolletschek} [ACM Trans. Math. Software 11, 66-78 (1985; Zbl 0575.68047)]. Fifteen sample systems of algebraic equations are considered involving different coefficient domains and problem types. This gives an illustration of the range and applicability as well as of the current limitations of the method. In particular, the results show that proper choices of the variable ordering and term ordering have a critical influence on the computation time and memory utilization. Some comments about ''optimal'' variable orderings and the selection of valid solutions of the systems are presented.