Abstract
Let xn=(x1,…,xn) and f∈R[xn,k]. The problem of finding all k0 such that f(xn,k0)≥0 on Rn is considered in this paper, which obviously takes as a special case the problem of computing the global infimum or proving the semi-definiteness of a polynomial. For solving the problems, we propose a simplified Brown–McCallum's CAD projection operator, Nproj, of which the projection scale is always no larger than that of Brown–McCallum's. For many problems, the projection scale is much smaller than that of Brown–McCallum's. As a result, the lifting phase is also simplified. Some new algorithms based on Nproj for solving those problems are designed and proved to be correct. Comparison to some existing tools on some examples is reported to illustrate the effectiveness of our new algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
