Computing equilibria and fixed points. The solution of nonlinear inequalities (Q4935258)

This book is an extensive introduction to simplicial algorithms for the computation of fixed points, equilibria, and stationary points of maps in finite dimensional Euclidean space. The book emphasizes the so called simplicial algorithms which are based on the adjacency of simplices on a triangulation and labeling schemes of its vertices to help find approximations to the points in question. The details of such algorithms fill most of the book but it also includes some ``non-standard'' material: (1) A basic discussion of the algebraic theory of Groebner bases, the Buchberger algorithm, and the Hilbert Nullstellensatz. This is the content of Chapter 12. (2) The book contains a discussion of a technique to decide whether a given simplex contains or not a point with integer coordinates (see Chapter 6) which is based on work by \textit{H. E. Scarf} [Econometrica 49, 1-32 (1981; Zbl 0446.90006)] and \textit{C. Dang} and \textit{N. van Maaren} [Comput. Optim. Appl. 14, No. 1, 133-155 (1999)]. (3) It contains a large discussion of intersection theory that studies conditions under which a collection of sets covering a polyhedron has a non-empty intersection (see Chapter 13). The rest of the book is organized as follows: Chapter 1 contains an introduction to the notation and the classical fixed points theorems. Chapter 2 discusses applications of fixed point theorems. Chapters 3, 4, 5 discuss algorithms by Scarf, Merril, Kuhn-MacKinnon, Eaves Eaves-Saigal and van der Laan-Talman. Chapter 7 discusses the calculation of stationary points (again from the perspective of simplicial techniques). Chapter 8 introduces a fixed point theorem that states conditions for the existence of a continuum of fixed points and it is proved with an algorithm. Chapter 9 discusses the computations inside arbitrary polytopes (versus the classical cases of simplices and \(\mathbb{R}^n\)). Chapter 10 deals with computation of antipodal fixed points of continuous functions on a symmetric cubical set which provides a constructive proof of Borsuk-Ulam's fixed point theorem. Chapter 11 contains a discussion of how to use Kuhn's algorithm for the computation of all roots of a univariate polynomial with complex coefficients (this is later connected with Gröbner basis theory).