Elimination Methods

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.

שנה

2001

שפה

English

סדרה

Texts and Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes-Kepl

הוצאה

Springer Vienna

מהדורות

1

עמודים

244

ISBN

9783709162026

מקור הנתונים: Wikidata