This book provides a systematic and uniform presentation of elimination methods and the underlying theories, along the central line of decomposing arbitrary systems of polynomials into triangular systems of various kinds. Highlighting methods based on triangular sets, the book also covers the theory and techniques of resultants and Gröbner bases. The methods and their efficiency are illustrated by fully worked out examples and their applications to selected problems such as from polynomial ideal theory, automated theorem proving in geometry and the qualitative study of differential equations. The reader will find the formally described algorithms ready for immediate implementation and applicable to many other problems. Suitable as a graduate text, this book offers an indispensable reference for everyone interested in mathematical computation, computer algebra (software), and systems of algebraic equations.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
"... the algorithms are presented in a ‘crescendo’ sequence, that is, the versions are improved step by step with the introduction of new techniques and concepts, which allows the readers to follow the construction of the ideas; furthermore, this style makes it a very good textbook ... it is a very good text to have on hand for anyone interested in the theories and techniques of elimination methods.” American Mathematical Society "... This book, therefore, is not only topical, but is also the first book that contains all major currently available algorithmic approaches on elimination theory in one conceptional frame ... The book is well suited both as a textbook and as a research reference for the state of the art in algorithmic elimination theory. Theorems and proofs are presented in such a way that the correctness of the algorithms based on them can easily be verified. Well-chosen examples make it easy to understand the concepts and the methods. The main contents of this book - altough not all details - should enter standard curricula on algebra." Association for Computing Machinery
Polynomial arithmetic and zeros.- 1.1 Polynomials.- 1.2 Greatest common divisor, pseudo-division, and polynomial remainder sequences.- 1.3 Resultants and subresultants.- 1.4 Field extension and factorization.- 1.5 Zeros and ideals.- 1.6 Hilbert’s Nullstellensatz.- Zero decomposition of polynomial systems.- 2.1 Triangular systems.- 2.2 Characteristic-set-based algorithm.- 2.3 Seidenberg’s algorithm refined.- 2.4 Subresultant-based algorithm.- Projection and simple systems.- 3.1 Projection.- 3.2 Zero decomposition with projection.- 3.3 Decomposition into simple systems.- 3.4 Properties of simple systems.- Irreducible zero decomposition.- 4.1 Irreducibility of triangular sets.- 4.2 Decomposition into irreducible triangular systems.- 4.3 Properties of irreducible triangular systems.- 4.4 Irreducible simple systems.- Various elimination algorithms.- 5.1 Regular systems.- 5.2 Canonical triangular sets.- 5.3 Gröbner bases.- 5.4 Resultant elimination.- Computational algebraic geometry and polynomial-ideal theory.- 6.1 Dimension.- 6.2 Decomposition of algebraic varieties.- 6.3 Ideal and radical ideal membership.- 6.4 Primary decomposition of ideals.- Applications.- 7.1 Solving polynomial systems.- 7.2 Automated geometry theorem proving.- 7.3 Automatic derivation of unknown relations.- 7.4 Other geometric applications.- 7.5 Algebraic factorization.- 7.6 Center conditions for certain differential systems.- Bibliographic notes.- References.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Ammareal, Morangis, Francia
Softcover. Condizione: Bon. Ancien livre de bibliothèque. Edition 2000. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Edition 2000. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-577-938
Quantità: 1 disponibili
Da: Antiquariat Bernhardt, Kassel, Germania
Broschiert. Condizione: Gut. Zust: Gutes Exemplar. Vorsatzblatt gewellt, Buchecke am Buchrücken hinten bestoßen. XIII, 244 Seiten, Englisch 492g. Codice articolo 493617
Quantità: 1 disponibili
Da: Best Price, Torrance, CA, U.S.A.
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9783211832417
Quantità: 4 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783211832417_new
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The development of polynomial-elimination techniques from classical theory to modern algorithms has undergone a tortuous and rugged path. This can be observed L. van der Waerden's elimination of the 'elimination theory' chapter from from B. his classic Modern Algebra in later editions, A. Weil's hope to eliminate 'from algebraic geometry the last traces of elimination theory,' and S. Abhyankar's sug gestion to 'eliminate the eliminators of elimination theory. ' The renaissance and recognition of polynomial elimination owe much to the advent and advance of mod ern computing technology, based on which effective algorithms are implemented and applied to diverse problems in science and engineering. In the last decade, both theorists and practitioners have more and more realized the significance and power of elimination methods and their underlying theories. Active and extensive research has contributed a great deal of new developments on algorithms and soft ware tools to the subject, that have been widely acknowledged. Their applications have taken place from pure and applied mathematics to geometric modeling and robotics, and to artificial neural networks. This book provides a systematic and uniform treatment of elimination algo rithms that compute various zero decompositions for systems of multivariate poly nomials. The central concepts are triangular sets and systems of different kinds, in terms of which the decompositions are represented. The prerequisites for the concepts and algorithms are results from basic algebra and some knowledge of algorithmic mathematics. 264 pp. Englisch. Codice articolo 9783211832417
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The development of polynomial-elimination techniques from classical theory to modern algorithms has undergone a tortuous and rugged path. This can be observed L. van der Waerden s elimination of the elimination theory chapter from from B. his classic Mode. Codice articolo 4489030
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 264. Codice articolo 26327336
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 264 Illus. Codice articolo 7553399
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 264. Codice articolo 18327330
Quantità: 4 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Elimination Methods | D. Wang | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2000 | Springer | EAN 9783211832417 | Verantwortliche Person für die EU: Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu. Codice articolo 106650742
Quantità: 5 disponibili