Abstract :
We present an elimination method for polynomial systems, in the form of three main algorithms. For any given system [ , ] of two sets of multivariate polynomials, one of the algorithms computes a sequence of triangular forms 1,…, e and polynomial sets 1,…, e such that Zero( / ) = ei=1 Zero( i/ i), where Zero( / ) denotes the set of common zeros of the polynomials in which are not zeros of any polynomial in , and similarly for Zero( i/ i). The two other algorithms compute the same zero decomposition but with nicer properties such as Zero( i/ i) ≠ &slash; for each i. One of them, for which the computed triangular systems [ i, i] possess the projection property, provides a quantifier elimination procedure for algebraically closed fields. For the other, the computed triangular forms iare irreducible. The relationship between our method and some existing elimination methods is explained. Experimental data for a set of test examples by a draft implementation of the method are provided, and show that the efficiency of our method is comparable with that of some well-known methods. A few encouraging examples are given in detail for illustration.
