Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting

Cylindrical algebraic decomposition (CAD) is an important tool, both for quantifier elimination over the reals and a range of other applications. Traditionally, a CAD is built through a process of projection and lifting to move the problem within Euclidean spaces of changing dimension. Recently, an alternative approach which first decomposes complex space using triangular decomposition before refining to real space has been introduced and implemented within the RegularChains Library of Maple. We here describe a freely available package ProjectionCAD which utilises the routines within the RegularChains Library to build CADs by projection and lifting. We detail how the projection and lifting algorithms were modified to allow this, discuss the motivation and survey the functionality of the package.

[1]  Marc Moreno Maza,et al.  On the Theories of Triangular Sets , 1999, J. Symb. Comput..

[2]  Matthew England.  An implementation of CAD in Maple utilising problem formulation, equational constraints and truth-table invariance , 2013, ArXiv.

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

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

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

[6]  Matthew England,et al.  Understanding Branch Cuts of Expressions , 2013, MKM/Calculemus/DML.

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

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

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

[10]  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.

[11]  Matthew England.  An implementation of CAD in Maple utilising McCallum projection , 2013, ArXiv.

[12]  M. M. Maza.  On Triangular Decompositions of Algebraic Varieties , 2000 .

[13]  Matthew England,et al.  Truth table invariant cylindrical algebraic decomposition , 2014, J. Symb. Comput..

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

[15]  Changbo Chen,et al.  An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions , 2012, ASCM.

[16]  Christopher W. Brown.  The McCallum Projection, Lifting, and Order-Invariance , 2005 .

[17]  Marc Moreno Maza,et al.  Computations modulo regular chains , 2009, ISSAC '09.

[18]  Matthew England,et al.  Dataset supporting the paper: Truth table invariant cylindrical algebraic decomposition , 2015 .

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

[20]  Changbo Chen,et al.  User interface design for geometrical decomposition algorithms in Maple , 2009 .

[21]  David R. Musser,et al.  Multivariate Polynomial Factorization , 1975, JACM.

[22]  Dongming Wang,et al.  Computing Triangular Systems and Regular Systems , 2000, J. Symb. Comput..

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

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

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

[26]  Changbo Chen,et al.  Real Root Isolation of Regular Chains , 2009, ASCM.