D.7.2 solve_lib

Library:

solve.lib

Purpose:

Complex Solving of Polynomial Systems

Author:

Moritz Wenk, email: wenk@mathematik.uni-kl.de
Wilfred Pohl, email: pohl@mathematik.uni-kl.de

Procedures:

D.7.2.1 laguerre_solve		find all roots of univariate polynomial p
D.7.2.2 solve		all roots of 0-dim. ideal i using triangular sets
D.7.2.3 ures_solve		find all roots of 0-dimensional ideal i with resultants
D.7.2.4 mp_res_mat		multipolynomial resultant matrix of ideal i
D.7.2.5 interpolate		interpolate poly from evaluation points i and results j
D.7.2.6 fglm_solve		find roots of 0-dim. ideal using FGLM and lex_solve
D.7.2.7 lex_solve		find roots of reduced lexicographic standard basis
D.7.2.8 simplexOut		prints solution of simplex in nice format
D.7.2.9 triangLf_solve		find roots using triangular sys. (factorizing Lazard)
D.7.2.10 triangM_solve		find roots of given triangular system (Moeller)
D.7.2.11 triangL_solve		find roots using triangular system (Lazard)
D.7.2.12 triang_solve		find roots of given triangular system