The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...
New to eBooks.com?Learn more
- Bestsellers - This Week
- Foreign Language Study
- Bestsellers - Last 6 months
- Graphic Books
- Health & Fitness
- Political Science
- Biography & Autobiography
- Psychology & Psychiatry
- Body Mind & Spirit
- House & Home
- Business & Economics
- Children's & Young Adult Fiction
- Juvenile Nonfiction
- Language Arts & Disciplines
- Crafts & Hobbies
- Science Fiction
- Current Events
- Literary Collections
- Literary Criticism
- Literary Fiction
- Social Science
- The Environment
- Sports & Recreation
- Family & Relationships
- Study Aids
- Folklore & Mythology
- Food and Wine
- Performing Arts
- True Crime
- Foreign Language Books
Most popular at the top
- Springer New York 2007; US$ 64.95
Intended for graduate courses or for independent study, this book presents the basic theory of fields. The first part begins with a discussion of polynomials over a ring, the division algorithm, irreducibility, field extensions, and embeddings. The second part is devoted to Galois theory. The third part of the book treats the theory of binomials.... more...
- Springer New York 2008; US$ 59.95
The new edition of this text on classical Galois Theory approaches the theory from the linear algebra point of view, following Artin. It also presents a number of applications of the theory and an expanded chapter on transcendental extensions. more...
- Springer New York 2011; US$ 49.95
Inequalities based on Sobolev Representations deals exclusively with tight integral inequalities of Chebyshev-Grüss and Ostrowski types, and of integral means. Applications illustrate inequalities that engage in ordinary and weak partial derivatives of the involved functions. more...
- CRC Press 2011; US$ 49.95
Lectures on N X (p) deals with the question on how N X (p), the number of solutions of mod p congruences, varies with p when the family (X) of polynomial equations is fixed. While such a general question cannot have a complete answer, it offers a good occasion for reviewing various techniques in l-adic cohomology and group representations, presented... more...
- Elsevier Science 2007; US$ 195.00
This book (along with volume 2 covers most of the traditional methods for polynomial root-finding such as Newton?s, as well as numerous variations on them invented in the last few decades. Perhaps more importantly it covers recent developments such as Vincent?s method, simultaneous iterations, and matrix methods. There is an extensive chapter on evaluation... more...
- Elsevier Science 2013; US$ 172.00
Numerical Methods for Roots of Polynomials - Part II along with Part I (9780444527295) covers most of the traditional methods for polynomial root-finding such as interpolation and methods due to Graeffe, Laguerre, and Jenkins and Traub. It includes many other methods and topics as well and has a chapter devoted to certain modern virtually optimal... more...
- World Scientific Publishing Company 2005; US$ 96.00
Written by the founders of the new and expanding field of numerical algebraic geometry, this is the first book that uses an algebraic-geometric approach to the numerical solution of polynomial systems and also the first one to treat numerical methods for finding positive dimensional solution sets. The text covers the full theory from methods developed... more...
- Birkhäuser Boston 2007; US$ 139.00
This comprehensive monograph details polynomially convex sets. It discusses important applications and motivates the reader with numerous examples and counterexamples, which serve to illustrate the general theory and to delineate its boundaries. more...
- Scuola Normale Superiore 2012; US$ 24.95
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. The first part of this book reviews the main results that have been proposed so far in the literature. As usual with polynomial computations, the polynomial GCD problem can be expressed in matrix form:... more...