The concept of open weak CAD is introduced. Every open CAD is an open weak CAD. On the contrary, an open weak CAD is not necessarily an open CAD. An algorithm for computing projection polynomials of open weak CADs is proposed. The key idea is to compute the intersection of projection factor sets produced by different projection orders. The resulting open weak CAD often has smaller number of sample points than open CADs. The algorithm can be used for computing sample points for all open connected components of f not equal 0 for a given polynomial f. It can also be used for many other applications, such as testing semi-definiteness of polynomials and copositive problems. In fact, we solved several difficult semi-definiteness problems effici...
AbstractWe give a new class of algorithms for computing sparsest shifts of a given polynomial. Our a...
We study the computational aspects of weak saddles, an ordinal set-valued solution concept proposed ...
The improved projection operation for cylindrical algebraic decomposition (CAD) described in [10] re...
A new projection operator of cylindrical algebraic decompo-sition (CAD) is proposed. The new operato...
Let xn = (x1,..., xn) and f ∈ R[xn, k]. The problem of finding all k0 such that f(xn, k0) ≥ 0 on Rn...
Let x(n) = (x(1),..., x(n)) and f is an element of R[x(n), k]. The problem of finding all k(0) such ...
Colloque sur invitation. internationale.International audienceDeciding if a semi-algebraic set is em...
AbstractThis paper presents some applications of the theory of weakly nondegenerate conditions obtai...
International audienceWe consider the problem of finding for a given N-tuple of polynomials (real or...
International audienceThe purpose of this note is to give an effective criterion for a cubic polynom...
We investigate the family of intersection graphs of low density objects in low dimensional Eu-clidea...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
A new geometric algorithm with order reduction for robust Strictly Positive Real (SPR) synthesis is ...
This thesis is an exposition of ideas and methods that help un- derstanding the problem of minimizin...
International audienceAlthough Cylindrical Algebraic Decomposition (CAD) is widely used to study the...
AbstractWe give a new class of algorithms for computing sparsest shifts of a given polynomial. Our a...
We study the computational aspects of weak saddles, an ordinal set-valued solution concept proposed ...
The improved projection operation for cylindrical algebraic decomposition (CAD) described in [10] re...
A new projection operator of cylindrical algebraic decompo-sition (CAD) is proposed. The new operato...
Let xn = (x1,..., xn) and f ∈ R[xn, k]. The problem of finding all k0 such that f(xn, k0) ≥ 0 on Rn...
Let x(n) = (x(1),..., x(n)) and f is an element of R[x(n), k]. The problem of finding all k(0) such ...
Colloque sur invitation. internationale.International audienceDeciding if a semi-algebraic set is em...
AbstractThis paper presents some applications of the theory of weakly nondegenerate conditions obtai...
International audienceWe consider the problem of finding for a given N-tuple of polynomials (real or...
International audienceThe purpose of this note is to give an effective criterion for a cubic polynom...
We investigate the family of intersection graphs of low density objects in low dimensional Eu-clidea...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
A new geometric algorithm with order reduction for robust Strictly Positive Real (SPR) synthesis is ...
This thesis is an exposition of ideas and methods that help un- derstanding the problem of minimizin...
International audienceAlthough Cylindrical Algebraic Decomposition (CAD) is widely used to study the...
AbstractWe give a new class of algorithms for computing sparsest shifts of a given polynomial. Our a...
We study the computational aspects of weak saddles, an ordinal set-valued solution concept proposed ...
The improved projection operation for cylindrical algebraic decomposition (CAD) described in [10] re...