Journal of Symbolic Computation
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
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
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
On using bi-equational constraints in CAD construction
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Lifting techniques for triangular decompositions
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Real solution isolation using interval arithmetic
Computers & Mathematics with Applications
Complete numerical isolation of real zeros in zero-dimensional triangular systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computing cylindrical algebraic decomposition via triangular decomposition
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computations modulo regular chains
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Algebraic Complexity Theory
Comprehensive triangular decomposition
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Computing with semi-algebraic sets represented by triangular decomposition
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Semi-algebraic description of the equilibria of dynamical systems
CASC'11 Proceedings of the 13th 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
Algorithms for computing triangular decomposition of polynomial systems
Journal of Symbolic Computation
Fast simplifications for Tarski formulas based on monomial inequalities
Journal of Symbolic Computation
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 |
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue: semi-algebraic systems. We show that any such system can be decomposed into finitely many regular semi-algebraic systems. We propose two specifications of such a decomposition and present corresponding algorithms. Under some assumptions, one type of decomposition can be computed in singly exponential time w.r.t. the number of variables. We implement our algorithms and the experimental results illustrate their effectiveness.