Algorithms in Real Algebraic Geometry

Saugata Basu

ISBN 10: 3540330984 / ISBN 13: 9783540330981

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2006, 2006

About this Item

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 676 pp. Englisch.

Seller Inventory # 9783540330981

Bibliographic Details

• Title: Algorithms in Real Algebraic Geometry
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2006
• Publication Date: 2006
• Language: English
• ISBN 10: 3540330984
• ISBN 13: 9783540330981
• Binding: Buch
• Edition: 2nd Edition
• Condition: Neu
• Dimensions: 241W x 160H x 42D millimeters 241 millimeters width by 160 millimeters height by 42 millimeters depth
• Weight: 1168 grams

About this title

Synopsis

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.

From the Back Cover

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 first-ever graduate textbook on the algorithmic aspects of real algebraic geometry, the main ideas and techniques presented form a coherent and rich body of knowledge, linked to many areas of mathematics and computing.

Mathematicians already aware of real algebraic geometry will find relevant information about the algorithmic aspects, and 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 revised second edition contains several recent results, notably 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. An index of notation has also been added.