Real quantifier elimination is doubly exponential
Journal of Symbolic Computation
Solving systems of strict polynomial inequalities
Journal of Symbolic Computation
Improved projection for cylindrical algebraic decomposition
Journal of Symbolic Computation
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Solving parametric polynomial systems
Journal of Symbolic Computation
On delineability of varieties in CAD-based quantifier elimination with two equational constraints
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Triangular decomposition of semi-algebraic systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
ACM Communications in Computer Algebra
Algorithms for computing triangular decompositions of polynomial systems
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Comprehensive triangular decomposition
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Computing the real solutions of polynomial systems with the RegularChains library in Maple
ACM Communications in Computer Algebra
Triangular decomposition of semi-algebraic systems
Journal of Symbolic Computation
Computing with semi-algebraic sets: Relaxation techniques and effective boundaries
Journal of Symbolic Computation
Hi-index | 0.00 |
This article is a continuation of our earlier work [3], which introduced triangular decompositions of semi-algebraic systems and algorithms for computing them. Our new contributions include theoretical results based on which we obtain practical improvements for these decomposition algorithms. We exhibit new results on the theory of border polynomials of parametric semi-algebraic systems: in particular a geometric characterization of its "true boundary" (Definition 2). In order to optimize these algorithms, we also propose a technique, that we call relaxation, which can simplify the decomposition process and reduce the number of redundant components in the output. Moreover, we present procedures for basic set-theoretical operations on semi-algebraic sets represented by triangular decomposition. Experimentation confirms the effectiveness of our techniques.