Get Free Shipping on orders over $89
Algebraic Systems and Computational Complexity Theory : Mathematics and its Applications - Z. Wang

Algebraic Systems and Computational Complexity Theory

By: Z. Wang, T. Gao, S. Xu

Hardcover | 1 November 1994

At a Glance

Hardcover


$159.01

or 4 interest-free payments of $39.75 with

 or 

Ships in 5 to 7 business days

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.

More in Numerical Analysis

Introductory Numerical Analysis - Griffin Cook
Introduction to Finite Element Analysis Using MATLAB® and Abaqus - Amar Khennane
Numerical Methods for Modeling Metasurface with GSTC - Guoxiong  Cai
Impact Dynamics : A Numerical Approach - Sunil K. Sinha