Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas

Cylindrical algebraic formulas are an explicit representation of semialgebraic sets as finite unions of cylindrically arranged disjoint cells bounded by graphs of algebraic functions. We present a version of the Cylindrical Algebraic Decomposition (CAD) algorithm customized for solving systems of polynomial equations and inequalities over semialgebraic sets given in this representation. The algorithm can also be used to solve conjunctions of polynomial conditions in an incremental manner. We show application examples and give an empirical comparison of incremental and direct CAD computation.

[1]  Hoon Hong,et al.  Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination , 1992, ISSAC '92.

[2]  D. Lazard.  An Improved Projection for Cylindrical Algebraic Decomposition , 1994 .

[3]  Adam W. Strzebonski.  Computing in the Field of Complex Algebraic Numbers , 1997, J. Symb. Comput..

[4]  Adam W. Strzebonski,et al.  Solving Systems of Strict Polynomial Inequalities , 2000, J. Symb. Comput..

[5]  Scott McCallum.  On propagation of equational constraints in CAD-based quantifier elimination , 2001, ISSAC '01.

[6]  Christopher W. Brown.  QEPCAD B: a program for computing with semi-algebraic sets using CADs , 2003, SIGS.

[7]  Adam W. Strzebonski,et al.  Cylindrical Algebraic Decomposition using validated numerics , 2006, J. Symb. Comput..

[8]  H. Hong.  An improvement of the projection operator in cylindrical algebraic decomposition , 1990, ISSAC '90.

[9]  Scott McCallum,et al.  An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-Dimensional Space , 1988, J. Symb. Comput..

[10]  George E. Collins,et al.  Partial Cylindrical Algebraic Decomposition for Quantifier Elimination , 1991, J. Symb. Comput..

[11]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[12]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[13]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..

[14]  Mohab Safey El Din,et al.  Variant quantifier elimination , 2012, J. Symb. Comput..

[15]  Changbo Chen,et al.  Computing cylindrical algebraic decomposition via triangular decomposition , 2009, ISSAC '09.

[16]  Rüdiger Loos,et al.  Applying Linear Quantifier Elimination , 1993, Comput. J..

[17]  Mats Jirstrand,et al.  Nonlinear Control System Design by Quantifier Elimination , 1997, J. Symb. Comput..

[18]  Adam W. Strzebonski.  Computation with semialgebraic sets represented by cylindrical algebraic formulas , 2010, ISSAC.

[19]  Scott McCallum,et al.  On projection in CAD-based quantifier elimination with equational constraint , 1999, ISSAC '99.

[20]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[21]  Volker Weispfenning,et al.  Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond , 1997, Applicable Algebra in Engineering, Communication and Computing.

[22]  Thomas Sturm,et al.  Real Quantifier Elimination in Practice , 1997, Algorithmic Algebra and Number Theory.

[23]  Christopher W. Brown,et al.  Solution formula construction for truth invariant cad's , 1999 .