pith. machine review for the scientific record. sign in

arxiv: 1507.03834 · v3 · pith:ZKL5L4SHnew · submitted 2015-07-14 · 💻 cs.SC

Open Weak CAD and its Applications

classification 💻 cs.SC
keywords openweakalgorithmproblemscadscopositivepolynomialsprojection
0
0 comments X
read the original abstract

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\neq0$ 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 efficiently by using the algorithm. Furthermore, applying the algorithm to copositive problems, we find an explicit expression of the polynomials producing open weak CADs under some conditions, which significantly improves the efficiency of solving copositive problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.