Algebraic Systems and Computational Complexity Theory

Tse-K'o Wang

ISBN 10: 0792325338 / ISBN 13: 9780792325338

Published by SPRINGER NATURE Nov 1994, 1994

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 260 pp. Englisch.

Seller Inventory # 9780792325338

Bibliographic Details

• Title: Algebraic Systems and Computational Complexity Theory
• Publisher: SPRINGER NATURE Nov 1994
• Publication Date: 1994
• Language: English
• ISBN 10: 0792325338
• ISBN 13: 9780792325338
• Binding: Buch
• Condition: Neu
• Dimensions: 234W x 156H x 16D millimeters 234 millimeters width by 156 millimeters height by 16 millimeters 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.