D.7.3.1 triangL
...............
Procedure from library triang.lib (see triang_lib).

Usage:
triangL(G); G=ideal

Assume:
G is the reduced lexicographical Groebner bases of the
zero-dimensional ideal (G), sorted by increasing leading terms.

Return:
a list of finitely many triangular systems, such that
the union of their varieties equals the variety of (G).

Note:
Algorithm of Lazard (see: Lazard, D.: Solving zero-dimensional
algebraic systems, J. Symb. Comp. 13, 117 - 132, 1992).

Example:
LIB "triang.lib";
ring rC5 = 0,(e,d,c,b,a),lp;
triangL(stdfglm(cyclic(5)));

<font size="-1">
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; User manual for <a href="http://www.singular.uni-kl.de/"><i>Singular</i></a> version 2-0-4, October 2002,
generated by <a href="http://www.gnu.org/software/texinfo/"><i>texi2html</i></a>.
</font>

</body>
</html>
