|
D.8.2.11 triangL_solve
Procedure from library solve.lib (see solve_lib).
- Usage:
- triangL_solve(i [, p] ); i=ideal, p=integer,
p>0: gives precision of complex numbers in digits (default: p=30).
- Assume:
- the ground field has char 0; i is a zero-dimensional ideal.
- 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 i are stored.
- Note:
- The procedure uses a triangular system (Lazard's Algorithm) computed
from a standard basis of input ideal i to determine recursively all
complex roots with Laguerre's algorithm.
Example:
|