Top
Back: triangL_solve
Forward: triang_lib
FastBack: presolve_lib
FastForward: triang_lib
Up: solve_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.8.2.12 triang_solve

Procedure from library solve.lib (see solve_lib).

Usage:
triang_solve(l,p [,d] ); l=list, p,d=integers
l is a list of finitely many triangular systems, such that the union of their varieties equals the variety of the initial ideal.
p>0: gives precision of complex numbers in digits,
d>0: gives precision (1<d<p) for near-zero-determination,
(default: d=1/2*p).

Assume:
the ground field has char 0;
l was computed using the algorithm of Lazard or the algorithm of Moeller (see triang.lib).

Return:
ring R with the same number of variables, but with complex coefficients (and precision p). R comes with a list rlist of numbers, in which the complex roots of l are stored.

Example:
 

Top Back: triangL_solve Forward: triang_lib FastBack: presolve_lib FastForward: triang_lib Up: solve_lib Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-1-6, Dec 2012, generated by texi2html.