An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions

In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real space. The incrementality comes from the first part of the algorithm, where a complex cylindrical tree is constructed by refining a previous complex cylindrical tree with a polynomial constraint. We have implemented our algorithm in Maple. The experimentation shows that the proposed algorithm outperforms existing ones for many examples taken from the literature

Efficient Algorithms for the k

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a weakened notion of a polynomial GCD modulo a regular chain, which permits to greatly simplify and optimize the subalgorithms. Extracting common work from similar expensive computations is also a key feature of our algorithms. In our experimental results the implementation of our new algorithms, realized with the RegularChains library in Maple, outperforms solvers with similar specifications by several orders of magnitude on sufficiently difficult problems. Categories and Subject Descriptor

Solving Polynomial Systems via Triangular Decomposition

Finding the solutions of a polynomial system is a fundamental problem with numerous applications in both the academic and industrial world. In this thesis, we target on computing symbolically both the real and the complex solutions of nonlinear polynomial systems with or without parameters. To this end, we improve existing algorithms for computing triangular decompositions. Based on that, we develop various new tools for solving polynomial systems and illustrate their effectiveness by applications. We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a weakened notion of a polynomial GCD modulo a regular chain, which permits to greatly simplify and optimize the sub-algorithms. Extracting common work from similar expensive computations is also a key feature of our algorithms. We adapt the concepts of regular chain and triangular decomposition, originally designed for studying the complex solutions of polynomial systems, to describing the solutions of semi-algebraic systems. We show that any such system can be decomposed into finitely many regular semi-algebraic systems. We propose two specifications (full and lazy) of such a decomposition and present corresponding algorithms. Under some assumptions, the lazy decomposition can be computed in singly exponential time w.r.t. the number of variables. We introduce the concept of {\em comprehensive triangular decomposition} for solving parametric polynomial systems. It partitions the parametric space into disjoint cells such that the complex or real solutions of a polynomial system depend continuously on the parameters in each cell. In the real case, we rely on cylindrical algebraic decomposition (CAD) to decompose a cell into connected components. CAD itself is one of the most important tools for computing with semi-algebraic sets. We present a brand new algorithm for computing it based on triangular decomposition