Delivery included to the United States

Algebraic Systems and Computational Complexity Theory

Algebraic Systems and Computational Complexity Theory

Hardback (30 Nov 1994)

Save $15.80

  • RRP $113.33
  • $97.53
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

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.

Book information

ISBN: 9780792325338
Publisher: Science
Imprint: Springer
Pub date:
DEWEY: 514.24
DEWEY edition: 20
Language: English
Number of pages: 243
Weight: 575g
Height: 230mm
Width: 171mm
Spine width: 19mm