Algebraic Systems and Computational Complexity Theory

Algebraic Systems and Computational Complexity Theory

By (author)  , By (author)  , By (author)  , By (author) 

List price: US$109.00

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

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.
show more

Product details

  • Hardback | 256 pages
  • 154.94 x 246.38 x 17.78mm | 566.99g
  • United States
  • English
  • references, index
  • 0792325338
  • 9780792325338

Table of contents

;1; Kuhn's Algorithm for Algebraic Equations. ;2; Efficiency of Kuhn's Algorithm. ;3; Newton's Method and Approximate Zeros. ;4; A Comparison of Kuhn's Algorithm and Newton's Method. ;5; Incremental Algorithms and their Cost Theory. ;6; Homotopy Algorithms. ;7; Probabilistic Discussion on Zeros of Polynomial Mappings. ;9; Piecewise Linear Algorithms.
show more