Algebraic Systems and Computational Complexity Theory

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

ISBN 10: 0792325338 / ISBN 13: 9780792325338

Published by Kluwer Academic Publishers, US, 1994

About this Item

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.

Seller Inventory # LU-9780792325338

Bibliographic Details

• Title: Algebraic Systems and Computational Complexity Theory
• Publisher: Kluwer Academic Publishers, US
• Publication Date: 1994
• Language: English
• ISBN 10: 0792325338
• ISBN 13: 9780792325338
• Binding: Hardback
• Condition: New
• Dimensions: 15.6W x 1.6H x 23.39D centimeters 15.6 centimeters width by 1.6 centimeters height by 23.39 centimeters depth
• Weight: 540 grams

About this title

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.