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.
"synopsis" may belong to another edition of this title.
"... 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
"About this title" may belong to another edition of this title.
Seller: Antiquariat Bernhardt, Kassel, Germany
Broschiert Broschiert. Condition: Gut. XIII, 244 Seiten, Zust: Gutes Exemplar. Vorsatzblatt gewellt, Buchecke am Buchrücken hinten bestoßen. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 492. Seller Inventory # 493617
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783211832417_new
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9783211832417
Seller: moluna, Greven, Germany
Condition: 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. Seller Inventory # 4489030
Quantity: Over 20 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 264. Seller Inventory # 26327336
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783211832417
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 264 Illus. Seller Inventory # 7553399
Quantity: 4 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 1st edition. 244 pages. 9.50x6.50x0.50 inches. In Stock. Seller Inventory # x-3211832416
Quantity: 2 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 264. Seller Inventory # 18327330
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 264 pp. Englisch. Seller Inventory # 9783211832417