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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Antiquariat Bernhardt, Kassel, Deutschland
Broschiert Broschiert. Zustand: 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. Artikel-Nr. 493617
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9783211832417_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 1st edition. 244 pages. 9.50x6.50x0.50 inches. In Stock. Artikel-Nr. x-3211832416
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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. Artikel-Nr. 9783211832417
Anzahl: 1 verfügbar