Algebraic Systems and Computational Complexity Theory (Mathematics and Its Applications) |  | Authors: Z. Wang, S. Xu, T. Gao
Publisher: Springer
Category: Book
List Price: $189.00
Buy New: $79.74
You Save: $109.26 (58%)
New (2) Used (2) from $63.04
Sales Rank: 7032657
Media: Hardcover
Edition: 1
Pages: 256
Number Of Items: 1
Shipping Weight (lbs): 1.3
Dimensions (in): 10 x 6.8 x 0.8
ISBN: 0792325338
Dewey Decimal Number: 514.24
EAN: 9780792325338
Publication Date: November 30, 1994
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: Newer 2006 second printing edition, Science Press Beijing Publishers, in stock and ready to ship!!!!
| |
| Editorial Reviews:
Product Description
Significant progress has been made during the last fifteen years in the solution of nonlinear systems, particularly in computing fixed points, solving systems of nonlinear equations and applications to equilibrium models. This volume presents a self-contained account of recent work on simplicial and continuation methods applied to the solution of algebraic equations. The contents are divided into eight chapters. Chapters 1 and 2 deal with Kuhn's algorithm; Chapter 3 considers Newton's method, and a comparison between Kuhn's algorithm and Newton's method is presented in Chapter 4. The following four chapters discuss respectively, incremental algorithms and their cost theory, homotopy algorithms, zeros of polynomial mapping, and piecewise linear algorithms. For researchers and graduates interested in algebraic equations and computational complexity theory.
|
|
|
