Algorithms in Real Algebraic Geometry

Forsideomslag
Springer 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

Hvad folk siger - Skriv en anmeldelse

Vi har ikke fundet nogen anmeldelser de normale steder.

Indhold

Introduction
1
Algebraically Closed Fields
11
Real Closed Fields
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

Complexity of Basic Algorithms
281
9
323
5
648
Copyright

Andre udgaver - Se alle

Almindelige termer og sŠtninger

Bibliografiske oplysninger