𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving Systems of Strict Polynomial Inequalities

✍ Scribed by Adam Strzeboński

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
311 KB
Volume
29
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

We present an algorithm for finding an explicit description of solution sets of systems of strict polynomial inequalities, correct up to lower dimensional algebraic sets. Such a description is sufficient for many practical purposes, such as volume integration, graphical representation of solution sets, or global optimization over open sets given by polynomial inequality constraints. Our algorithm is based on the cylindrical algebraic decomposition algorithm. It uses a simplified projection operator, and constructs only rational sample points.

📜 SIMILAR VOLUMES

Solving Degenerate Sparse Polynomial Sys
Solving Degenerate Sparse Polynomial Systems Faster
✍ J.Maurice Rojas 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 565 KB

Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in every irreducible component of the zero set Z of F . Our techniques allow us to sharpen and lower prior complexity bounds for this

Multivariate Polynomial System Solving U
Multivariate Polynomial System Solving Using Intersections of Eigenspaces
✍ H. Michael Möller; Ralf Tenberg 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 336 KB

The solutions of a polynomial system can be computed using eigenvalues and eigenvectors of certain endomorphisms. There are two different approaches, one by using the (right) eigenvectors of the representation matrices, one by using the (right) eigenvectors of their transposed ones, i.e. their left