Algebraic systems of equations and computational complexity theory
Author(s)
Bibliographic Information
Algebraic systems of equations and computational complexity theory
（Mathematics and its applications, . China series）
Science , Kluwer Academic, c1994
- : Beijing
Available at / 23 libraries
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. [237]-240
Includes index
Description and Table of Contents
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.
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.
by "Nielsen BookData"