Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition

We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used. Rather, the distribution is inherent to the cylindrical structure and determined mostly by the number of variables. This insight is then combined with an algorithm that produces only full-dimensional cells to give an accurate method of predicting the number of cells in a complete CAD. Since constructing only full-dimensional cells is relatively inexpensive (involving no costly algebraic number calculations) this leads to heuristics for helping with various questions of problem formulation for CAD, such as choosing an optimal variable ordering. Our experiments demonstrate that this approach can be highly effective.

[1]  Matthew England,et al.  A "Piano Movers" Problem Reformulated , 2013, 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[2]  Scott McCallum.  Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition , 1993, Comput. J..

[3]  Matthew England,et al.  Cylindrical Algebraic Sub-Decompositions , 2014, Math. Comput. Sci..

[4]  Andreas Seidl,et al.  Efficient projection orders for CAD , 2004, ISSAC '04.

[5]  G. E. Collins,et al.  Quantifier Elimination by Cylindrical Algebraic Decomposition — Twenty Years of Progress , 1998 .

[6]  D Aspinall,et al.  Optimising Problem Formulation for Cylindrical Algebraic Decomposition , 2013 .

[7]  Matthew England,et al.  Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting , 2014, ICMS.

[8]  James H. Davenport.  A :20piano movers' ' , 1986, SIGS.

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

[10]  Changbo Chen,et al.  Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition , 2014, CICM.

[11]  M. Morari,et al.  Nonlinear parametric optimization using cylindrical algebraic decomposition , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  Bruno Buchberger,et al.  Speeding-up Quantifier Elimination by Gr?bner Bases , 1991 .

[13]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[14]  Matthew England,et al.  Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition , 2014, ICMS.

[15]  Matthew England,et al.  Cylindrical algebraic decompositions for boolean combinations , 2013, ISSAC '13.

[16]  Matthew England,et al.  Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc , 2012, 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

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

[18]  Lawrence C. Paulson,et al.  MetiTarski: Past and Future , 2012, ITP.

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

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

[21]  James H. Davenport,et al.  The complexity of quantifier elimination and cylindrical algebraic decomposition , 2007, ISSAC '07.

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

[23]  James H. Davenport,et al.  A repository for CAD examples , 2013, ACCA.

[24]  Matthew England,et al.  Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition , 2014, CICM.

[25]  Scott McCallum,et al.  An Improved Projection Operation for Cylindrical Algebraic Decomposition , 1985, European Conference on Computer Algebra.

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

[27]  Changbo Chen,et al.  Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains , 2014, CASC.

[28]  Hirokazu Anai,et al.  An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination , 2009, SNC '09.

[29]  George E. Collins,et al.  Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..

[30]  J. Davenport.  A "Piano Movers" Problem. , 1986 .

[31]  Christopher W. Brown,et al.  Algorithmic methods for investigating equilibria in epidemic modeling , 2006, J. Symb. Comput..