Algebraic Systems and Computational Complexity Theory (Mathematics and Its Applications, v. 262)

by Z. Wang, etc., S. Xu, and T. Gao

0 ratings • 0 reviews • 0 shelved
Book cover for Algebraic Systems and Computational Complexity Theory

Bookhype may earn a small commission from qualifying purchases. Full disclosure.

Significant progress has been made during the last 15 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. This text is designed for use by researchers and graduates interested in algebraic equations and computational complexity theory.
  • ISBN10 0792325338
  • ISBN13 9780792325338
  • Publish Date 30 November 1994
  • Publish Status Active
  • Publish Country US
  • Publisher Springer
  • Imprint Kluwer Academic Publishers
  • Format Hardcover
  • Pages 256
  • Language English