D.7.1 presolve_lib

Library:

presolve.lib

Purpose:

Pre-Solving of Polynomial Equations

Author:

Gert-Martin Greuel, email: greuel@mathematik.uni-kl.de,

Procedures:

D.7.1.1 degreepart		elements of id of total degree >= d1 and <= d2
D.7.1.2 elimlinearpart		linear part eliminated from id
D.7.1.3 elimpart		partial elimination of vars [among first n vars]
D.7.1.4 elimpartanyr		factors of p partially eliminated from i in any ring
D.7.1.5 fastelim		fast elimination of factors of p from i [options]
D.7.1.6 findvars		ideal of variables occurring in id [more information]
D.7.1.7 hilbvec		intvec of Hilbert-series of id [in char c and ord o]
D.7.1.8 linearpart		elements of id of total degree <=1
D.7.1.9 tolessvars		maps id to new basering having only vars occurring in id
D.7.1.10 solvelinearpart		reduced std-basis of linear part of id
D.7.1.11 sortandmap		map to new basering with vars sorted w.r.t. complexity
D.7.1.12 sortvars		sort vars w.r.t. complexity in id [different blocks]
D.7.1.13 shortid		generators of id having <= n terms
D.7.1.14 valvars		valuation of vars w.r.t. to their complexity in id
D.7.1.15 idealSimplify		eliminates variables which are linear in id
D.7.1.16 idealSplit		intersection of the ideals has the same radical as id