On Gröbner Bases Computation on a Supercomputer Using REDUCE.

Herbert Melenk, Hans Michael Möller, Winfried Neun · 1988

Grobner bases are the main tool for solving systems of algebraic equations and some other problems in connection with polynomial ideals using Computer Algebra Systems. The procedure for the computation of Grobner bases in REDUCE 3.3 has been modified in order to solve more complicated algebraic systems of equations by some general improvements and by some tools based on the specific resources of the CRAY X-MP. We present this modification and illustrate it by examples.

Read the paper · More papers on PaperTik