Cylindrical algebraic decomposition I: the basic algorithm
SIAM Journal on Computing
An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
Journal of Symbolic Computation
An improvement of the projection operator in cylindrical algebraic decomposition
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
ISSAC '92 Papers from the international symposium on Symbolic and algebraic 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
Simple CAD construction and its applications
Journal of Symbolic Computation
Improved projection for cylindrical algebraic decomposition
Journal of Symbolic Computation
Interval arithmetic in cylindrical algebraic decomposition
Journal of Symbolic Computation
An algorithm for isolating the real solutions of semi-algebraic systems
Journal of Symbolic Computation
Efficient projection orders for CAD
ISSAC '04 Proceedings of the 2004 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
The complexity of quantifier elimination and cylindrical algebraic decomposition
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Complete numerical isolation of real zeros in zero-dimensional triangular systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast arithmetic for triangular sets: from theory to practice
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computations modulo regular chains
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Notes on triangular sets and triangulation-decomposition algorithms I: polynomial systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Comprehensive triangular decomposition
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Computation with semialgebraic sets represented by cylindrical algebraic formulas
Proceedings of the 2010 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
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
Speeding up cylindrical algebraic decomposition by gröbner bases
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Triangular decomposition of semi-algebraic systems
Journal of Symbolic Computation
ACM Communications in Computer Algebra
Computing with semi-algebraic sets: Relaxation techniques and effective boundaries
Journal of Symbolic Computation
Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Cylindrical algebraic decompositions for boolean combinations
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Termination conditions for positivity proving procedures
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Finding points on real solution components and applications to differential polynomial systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Optimising problem formulation for cylindrical algebraic decomposition
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an arbitrary finite set F ⊂ [y1,...,yn] we apply comprehensive triangular decomposition in order to obtain an F-invariant cylindrical decomposition of the n-dimensional complex space, from which we extract an F-invariant cylindrical algebraic decomposition of the n-dimensional real space. We report on an implementation of this new approach for constructing cylindrical algebraic decompositions.