Open weak CAD and its applications
From MaRDI portal
Publication:1711996
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 for a given polynomial . 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.
Recommendations
- Constructing fewer open cells by GCD computation in CAD projection
- Projection and Quantifier Elimination Using Non-uniform Cylindrical Algebraic Decomposition
- Open non-uniform cylindrical algebraic decompositions
- Cylindrical algebraic decomposition using local projections
- Constructing a single open cell in a cylindrical algebraic decomposition
Cites work
- A variational approach to copositive matrices
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Applying Quantifier Elimination to Stability Analysis of Difference Schemes
- Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities
- Constructing fewer open cells by GCD computation in CAD projection
- Criteria for copositive matrices using simplices and barycentric coordinates
- Cylindrical algebraic decomposition in the RegularChains library
- Cylindrical algebraic decomposition using validated numerics
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1263359 (Why is no real title available?)
- scientific article; zbMATH DE number 1157648 (Why is no real title available?)
- scientific article; zbMATH DE number 1157658 (Why is no real title available?)
- scientific article; zbMATH DE number 1157663 (Why is no real title available?)
- scientific article; zbMATH DE number 1794361 (Why is no real title available?)
- scientific article; zbMATH DE number 2151204 (Why is no real title available?)
- Improved projection for cylindrical algebraic decomposition
- Multivariate discriminant and iterated resultant
- On copositive matrices
- On the combinatorial and algebraic complexity of quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Partial cylindrical algebraic decomposition for quantifier elimination
- Proving inequalities and solving global optimization problems via simplified CAD projection
- Solving systems of strict polynomial inequalities
- Some NP-complete problems in quadratic and nonlinear programming
- Testing sign conditions on a multivariate polynomial and applications
- Variant quantifier elimination
Cited in
(4)- Global optimization of polynomials over real algebraic sets
- Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
- Multivariate discriminant and iterated resultant
- Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure
This page was built for publication: Open weak CAD and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1711996)
