Cylindrical Algebraic Decomposition using validated numerics

Abstract We present a version of the Cylindrical Algebraic Decomposition (CAD) algorithm which uses interval sample points in the lifting phase, whenever the results can be validated. This gives substantial time savings by avoiding computations with exact algebraic numbers. We use bounds based on Rouche’s theorem combined with information collected during the projection phase and during construction of the current cell to validate the singularity structure of roots. We compare empirically our implementation of this variant of CAD with implementations of CAD using exact algebraic sample points (our and QEPCAD) and with our implementation of CAD using interval sample points with validation based solely on interval data.

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

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

[3]  Hoon Hong,et al.  Testing Stability by Quantifier Elimination , 1997, J. Symb. Comput..

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

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

[6]  H. Hong.  An efficient method for analyzing the topology of plane real algebraic curves , 1996 .

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

[8]  A. Strzebonski.  Solving Algebraic Inequalities , 2000 .

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

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

[11]  Wei Yang,et al.  Robust Multi-Objective Feedback Design by Quantifier Elimination , 1997, J. Symb. Comput..

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

[13]  George E. Collins,et al.  Interval Arithmetic in Cylindrical Algebraic Decomposition , 2002, J. Symb. Comput..

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

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

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

[17]  Christopher W. Brown.  An Overview of QEPCAD B: a Tool for Real Quantifier Elimination and Formula Simplification (特集 Quantifier Elimination) , 2003 .

[18]  Adam Strzebonski.  A Real Polynomial Decision Algorithm Using Arbitrary-Precision Floating Point Arithmetic , 1998, SCAN.

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

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

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

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