Christopher W. Brown
ABSTRACT
This paper introduces an improved method for constructing cylindrical algebraic decompositions (CADs) for formulas with two polynomial equations as implied constraints. The fundamental idea is that neither of the varieties of the two polynomials is actually represented by the CAD the method produces, only the variety defined by their common zeros is represented. This allows for a substantially smaller projection factor set, and for a CAD with many fewer cells.In the current theory of CADs, the fundamental object is to decompose n-space into regions in which a polynomial equation is either identically true or identically false. With many polynomials, one seeks a decomposition into regions in which each polynomial equation is identically true or false independently. The results presented here are intended to be the first step in establishing a theory of CADs in which systems of equations are fundamental objects, so that given a system we seek a decomposition into regions in which the system is identically true or false --- which means each equation is no longer considered independently. Quantifier elimination problems of this form (systems of equations with side conditions) are quite common, and this approach has the potential to bring large problems of this type into the scope of what can be solved in practice. The special case of formulas containing two polynomial equations as constraints is an important one, but this work is also intended to be extended in the future to the more general case.
- S. S. Abhyankar. Algebraic Geometry for Scientists and Engineers. American Math. Society, 1990.Google Scholar
Cross Ref
- D. S. Arnon. Topologically reliable display of algebraic curves. In Proceedings of SIGGRAPH, pages 219--227, 1983. Google ScholarDigital Library
- D. S. Arnon, G. E. Collins, and S. McCallum. Cylindrical algebraic decomposition I: The basic algorithm. SIAM Journal on Computing, 13(4):865--877, 1984. Google ScholarDigital Library
- James C. Beaumont, Russell J. Bradford, James H. Davenport, and Nalina Phisanbut. A poly-algorithmic approach to simplifying elementary functions. In Proc. International Symposium on Symbolic and Algebraic Computation, pages 27--34, 2004. Google ScholarDigital Library
- C. W. Brown. Improved projection for cylindrical algebraic decomposition. Journal of Symbolic Computation, 32(5):447--465, November 2001. Google ScholarDigital Library
- C. W. Brown. Simple CAD construction and its applications. Journal of Symbolic Computation, 31(5):521--547, May 2001. Google ScholarDigital Library
- Christopher W. Brown. QEPCAD B : a program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bulletin, 37(4):97--108, 2003. Google ScholarDigital Library
- B.F. Caviness and J. R. Johnson, editors. Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer-Verlag, 1998.Google ScholarCross Ref
- G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Lecture Notes In Computer Science, volume Vol. 33, pages 134--183. Springer-Verlag, Berlin, 1975. Reprinted in Caviness_Johnson:98. Google ScholarDigital Library
- G. E. Collins. Quantifier elimination by cylindrical algebraic decomposition - 20 years of progress. In B. Caviness and J. Johnson, editors, Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation. Springer-Verlag, 1998.Google Scholar
- G. E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3):299--328, Sep 1991. Google ScholarDigital Library
- H. Hong. Quantifier elimination for formulas constrained by quadratic equations via slope resultants. Computer J., 36(5):440--449, 1993.Google ScholarCross Ref
- M. Marden. Geometry of Polynomials, 2nd edition. American Math. Society, 1966.Google Scholar
- S. McCallum. An improved projection operation for cylindrical algebraic decomposition of three-dimensional space. Journal of Symbolic Computation, 5(1,2):141--161, 1988. Google ScholarDigital Library
- S. McCallum. An improved projection operator for cylindrical algebraic decomposition. In B. Caviness and J. Johnson, editors, Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation. Springer-Verlag, Vienna, 1998.Google Scholar
- S. McCallum. Factors of iterated resultants and discriminants. Journal of Symbolic Computation, 27:367--385, 1999. Google ScholarDigital Library
- S. McCallum. On projection in CAD -based quantifier elimination with equational constraint. In Sam Dooley, editor, Proc. International Symposium on Symbolic and Algebraic Computation, pages 145--149, 1999. Google ScholarDigital Library
- S. McCallum. On propagation of equational constraints in CAD -based quantifier elimination. In Bernard Mourrain, editor, Proc. International Symposium on Symbolic and Algebraic Computation, pages 223--230, 2001. Google ScholarDigital Library
- H. Whitney. Complex Analytic Varieties. Addison-Wesley, 1972.Google Scholar
Index Terms
- On using bi-equational constraints in CAD construction
Recommendations
A generic position based method for real root isolation of zero-dimensional polynomial systems
We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zero-dimensional polynomial systems. The method mainly involves resultant ...
Arithmetic Continuation of Regular Roots of Formal ParametricPolynomial Systems
Special issue on computational optimization—a tribute to Olvi Mangasarian, part IGiven a regular system of polynomial equations with power series coefficients, an initial root is continued as a power series. With the ground domain as an arbitrary field, arithmetic alone is used for the root continuation over this field, and computation ...
Comments