Algebraic Systems and Computational Complexity Theory (Hardcover)

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.

General

Imprint:	Kluwer Academic Publishers
Country of origin:	United States
Series:	Mathematics and its Applications, v. 262
Release date:	November 1994
First published:	November 1994
Authors:	Z. Wang • Etc • S. Xu • T. Gao
Dimensions:	230mm (L)
Format:	Hardcover
Pages:	256
ISBN-13:	978-0-7923-2533-8
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Science & Mathematics > Mathematics > Algebra > General
LSN:	0-7923-2533-8
Barcode:	9780792325338

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!