Algorithms in Real Algebraic GeometrySpringer Science & Business Media, 21. apr. 2007 - 662 sider The algorithmic problems of real algebraic geometry such as real root counting, deciding the existence of solutions of systems of polynomial equations and inequalities, finding global maxima or deciding whether two points belong in the same connected component of a semi-algebraic set appear frequently in many areas of science and engineering. In this textbook the main ideas and techniques presented form a coherent and rich body of knowledge. Mathematicians will find relevant information about the algorithmic aspects. Researchers in computer science and engineering will find the required mathematical background. Being self-contained the book is accessible to graduate students and even, for invaluable parts of it, to undergraduate students. This second edition contains several recent results, on discriminants of symmetric matrices, real root isolation, global optimization, quantitative results on semi-algebraic sets and the first single exponential algorithm computing their first Betti number. |
Fra bogen
Resultater 1-5 af 55
... empty or equal to C. It is natural to consider the smallest family of sets which contain the algebraic sets and is ... non-quantified variables, and bound variables, i.e. quantified variables. More precisely, let D be a subring of C. We ...
... non constant polynomial with coefficients in C has a root in C, which is ... empty. In this section, C is an algebraically closed field, D a subring of C ... non-zero polynomial P=apXp++a1X+a0∈D[X] with ap 0. 14 1 Algebraically Closed ...
... non-empty. U Notation 2.26. [Derivatives] Let P be a univariate polynomial of degree p in R[X]. We denote by Der(P) the list P, P', ..., P(p). U Proposition 2.27. [Basic Thom's Lemma] Let P be a univariate polynomial of degree p and let ...
... not ∃x∈R Py(x)=0 is true. Defining Zy ={x∈R F Py (x)=0}, (see Notation 1.18) ... empty or not is the same (is uniform) for all y in any given part. Because ... non-quantified variables, and bound variables, i.e. quantified variables ...
... non-empty realization at the zeroes of a univariate polynomial. When P and Q have no common roots, we can find the number of roots of P at each possible sign of Q in terms of the Tarski-queries of 1 and Q for P. We denote Z I Zer(P,R) I ...
Indhold
1 | |
11 | |
29 | |
SemiAlgebraic Sets | 83 |
4 | 100 |
Decomposition of SemiAlgebraic Sets | 159 |
6 | 195 |
Quantitative Semialgebraic Geometry | 237 |
Interval | 330 |
Existential Theory of the Reals | 505 |
Quantifier Elimination | 533 |
Computing Roadmaps and Connected Components of Alge | 563 |
Computing Roadmaps and Connected Components of Semi | 593 |
References | 635 |
132 | 641 |
Index of Notation 645 | 644 |
Andre udgaver - Se alle
Algorithms in Real Algebraic Geometry Saugata Basu,Richard Pollack,Marie-Françoise Roy Begrænset visning - 2003 |
Algorithms in Real Algebraic Geometry Saugata Basu,Richard Pollack,Marie-Françoise Roy Begrænset visning - 2006 |
Algorithms in Real Algebraic Geometry Saugata Basu,Richard Pollack,Marie-Françoise Coste-Roy Begrænset visning - 2013 |