Logo - springer
Slogan - springer

Mathematics - Algebra | Elimination Methods

Elimination Methods

Wang, D.

Softcover reprint of the original 1st ed. 2001, XIII, 244 pp. 12 figs.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-7091-6202-6

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-211-83241-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

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.

Content Level » Research

Keywords » algebra - algebraic geometry - algorithms - ants - automated theorem proving - computer algebra - derivation - mathematical computation - proving

Related subjects » Algebra - Geometry & Topology - Theoretical Computer Science

Table of contents 

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.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algebra.