Algebraic Systems of Equations and Computational Complexity Theory: v. 262 (Mathematics and its Applications) - Tapa dura

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

 
9780792325338: Algebraic Systems of Equations and Computational Complexity Theory: v. 262 (Mathematics and its Applications)

Sinopsis

Preface; H.W. Kuhn. 1. Kuhn’s Algorithm for Algebraic Equations. 2. Efficiency of Kuhn’s Algorithm. 3. Newton Method and Approximate Zeros. 4. A Comparison of Kuhn’s Algorithm and Newton Method. 5. Incremental Algorithms and their Cost Theory. 6. Homotopy Algorithms. 7. Probabilistic Discussion on Zeros of Polynomial Mappings. 9. Piecewise Linear Algorithms. References. Index.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9787030039446: Algebraic systems of equations and computational complexity theory (Mathematics and its application)

Edición Destacada

ISBN 10:  7030039440 ISBN 13:  9787030039446
Tapa dura