0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Algebra

Buy Now

Elimination Methods (Paperback, Softcover reprint of the original 1st ed. 2001) Loot Price: R2,972
Discovery Miles 29 720
Elimination Methods (Paperback, Softcover reprint of the original 1st ed. 2001): D. Wang

Elimination Methods (Paperback, Softcover reprint of the original 1st ed. 2001)

D. Wang

Series: Texts & Monographs in Symbolic Computation

 (sign in to rate)
Loot Price R2,972 Discovery Miles 29 720 | Repayment Terms: R279 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Donate to Gift Of The Givers

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."

General

Imprint: Springer-Verlag
Country of origin: Austria
Series: Texts & Monographs in Symbolic Computation
Release date: November 2000
First published: 2001
Authors: D. Wang
Dimensions: 244 x 170 x 14mm (L x W x T)
Format: Paperback
Pages: 244
Edition: Softcover reprint of the original 1st ed. 2001
ISBN-13: 978-3-211-83241-7
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Science & Mathematics > Mathematics > Algebra > General
Books > Science & Mathematics > Mathematics > Geometry > General
Books > Science & Mathematics > Mathematics > Topology > General
LSN: 3-211-83241-6
Barcode: 9783211832417

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners