Cylindrical algebraic decomposition using local projections

We present an algorithm which computes a cylindrical algebraic decomposition of a semialgebraic set using projection sets computed for each cell separately. Such local projection sets can be significantly smaller than the global projection set used by the Cylindrical Algebraic Decomposition (CAD) algorithm. This leads to reduction in the number of cells the algorithm needs to construct. A restricted version of the algorithm was introduced in Strzebonski (2014). The full version presented here can be applied to quantified formulas and makes use of equational constraints. We give an empirical comparison of our algorithm and the classical CAD algorithm.

[1]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[2]  Adam W. Strzebonski,et al.  Cylindrical algebraic decomposition using local projections , 2014, J. Symb. Comput..

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

[4]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[5]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

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

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

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

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

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

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

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

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

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

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

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

[17]  David J. Wilson.  Real Geometry and Connectedness via Triangular Description: CAD Example Bank , 2012 .

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

[19]  Christopher W. Brown.  Improved Projection for Cylindrical Algebraic Decomposition , 2001, J. Symb. Comput..

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

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

[22]  Adam W. Strzebonski,et al.  Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas , 2012, ISSAC.

[23]  B. F. Caviness,et al.  Quantifier Elimination and Cylindrical Algebraic Decomposition , 2004, Texts and Monographs in Symbolic Computation.

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

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

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

[27]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

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

[29]  Dejan Jovanović,et al.  Solving Non-linear Arithmetic , 2012, IJCAR.

[30]  S. Łojasiewicz.  Ensembles semi-analytiques , 1965 .

[31]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[32]  Christopher W. Brown.  Constructing a single open cell in a cylindrical algebraic decomposition , 2013, ISSAC '13.