or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics) [Hardcover]

Saugata Basu (Author), Richard Pollack (Author), Marie-Françoise Coste-Roy (Author)

Price: $89.95 & this item ships for FREE with Super Saver Shipping. Details
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Monday, January 30? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for Students. Learn more

Formats

Amazon Price New from Used from
Hardcover $89.95  
Hardcover, August 21, 2006 $89.95  
Paperback $71.97  
Multimedia CD --  

Book Description

3540330984 978-3540330981 August 21, 2006 2nd
This is the first graduate textbook on the algorithmic aspects of real algebraic geometry. 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 and other relevant topics.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)


Editorial Reviews

Review

From the reviews: "The monograph gives a self-contained detailed exposition of the algorithmic real algebraic geometry. ... In general, the monograph is well written and will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields." Eugenii I. Shustin, Zbl. MATH 1031.14028 "... The book under review gives a self-contained account of some of the more recent and important algorithms arising in RAG [real algebraic geometry]. ... This material has mostly appeared in other sources; however, it is very nice to have it all in one book. ...the book is wonderful reference for algorithms in RAG, for the expert and non-expert alike." V.Powers, Mathematical Reviews Clippings from Issue 2004g From the reviews of the second edition: "‘Real root counting problem’ is one of the main problems under consideration in Algorithms in Real Algebraic Geometry … . the authors have posted an interactive version of the book on each of their websites. The book attempts to be self-contained and … the authors succeed … . Basu, Pollack, and Roy have written a detailed book with quite a few examples and … bibliographic references. … The websites also contain implementations of several of the algorithms … which this reviewer found particularly illuminating." (Darren Glass, MathDL, January, 2007) "Algorithms in Real Algebraic Geometry … provides a self-contained treatment of some of the important classical and modern results in semi-algebraic geometry, many authored by some subset of the trio Basu, Pollack, and Roy. … The authors have clearly done a tremendous service by providing a self-contained and surprisingly complete source for the foundations of algorithmic real algebraic geometry. They have also organized their material in a way that can be reasonably taught to graduate students." (J. Maurice Rojas, Foundations of computational Mathematics, Issue 8, 2008)

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.

Product Details


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



Inside This Book (learn more)
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
realizable sign conditions, signed remainder sequence, cylindrical decomposition algorithm, uniform roadmap, subresultant sequence, basic constructible set, braically connected, univariate representations output, sign determination algorithm, general real closed field, graded lexicographical, isolating list, forgetting the last coordinate, subresultant polynomials, subresultant coefficients, data for adjacencies, strict sign conditions, binary complexity, connecting algorithm, stratifying family, real root isolation, braic set, euclidean remainder sequence, roadmap algorithm, restricted elimination
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Triangular Sign Determination, Hilbert's Nullstellensatz, Bibliographical Notes, Bounded Algebraic Sampling, Parametrized Limit of Bounded Points, Bounded Algebraic Roadmap, Parametrized Special Multiplication Table, Removal of Infinitesimals, Triangular Comparison of Roots, Triangular Intermediate Points, Block Structured Signs, Limit of Real Bounded Points, Continuing Example, Multivariate Hermite, Parametrized Bounded Connecting, Parametrized Comparison of Roots, Real Recursive Sign, Univariate Tarski-query, Bounded Roadmap, Multivariate Tarski-query, Recursive Sample Points, Basic Connected Components, Linking Points, Parametrized Projection, Recursive Comparison of Roots
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject