Procedure from library
triang.lib (see triang_lib).
- triangMH(G[,i]); G=ideal, i=integer
- G is the reduced lexicographical Groebner basis of the
zero-dimensional ideal (G), sorted by increasing leading terms.
- a list of finitely many triangular systems, such that
the disjoint union of their varieties equals the variety of (G).
If i = 2, then each polynomial of the triangular systems is factorized.
- Algorithm of Moeller and Hillebrand (see: Moeller, H.M.:
On decomposing systems of polynomial equations with finitely many
solutions, Appl. Algebra Eng. Commun. Comput. 4, 217 - 230, 1993 and
Hillebrand, D.: Triangulierung nulldimensionaler Ideale -
Implementierung und Vergleich zweier Algorithmen, master thesis,
Universitaet Dortmund, Fachbereich Mathematik, Prof. Dr. H.M. Moeller,
ring rC5 = 0,(e,d,c,b,a),lp;