Top
Back: triang_lib
Forward: triangLfak
FastBack: solve_lib
FastForward: ntsolve_lib
Up: triang_lib
Top: Singular 2-0-4 Manual
Contents: Table of Contents
Index: Index
About: About this document

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)));


Top Back: triang_lib Forward: triangLfak FastBack: solve_lib FastForward: ntsolve_lib Up: triang_lib Top: Singular 2-0-4 Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 2-0-4, May 2003, generated by texi2html.