Click on a thumbnail to go to Google Books.
The computation of fixed points and applications
No current Talk conversations about this book.
References to this work on external resources.
Wikipedia in English
Amazon.com Product Description (ISBN 0387076859, Unknown Binding)Fixed-point algorithms have diverse applications in economics, optimization, game theory and the numerical solution of boundary-value problems. Since Scarf's pioneering work [56,57] on obtaining approximate fixed points of continuous mappings, a great deal of research has been done in extending the applicability and improving the efficiency of fixed-point methods. Much of this work is available only in research papers, although Scarf's book  gives a remarkably clear exposition of the power of fixed-point methods. However, the algorithms described by Scarf have been super~eded by the more sophisticated restart and homotopy techniques of Merrill [~8,~9] and Eaves and Saigal [1~,16]. To understand the more efficient algorithms one must become familiar with the notions of triangulation and simplicial approxi- tion, whereas Scarf stresses the concept of primitive set. These notes are intended to introduce to a wider audience the most recent fixed-point methods and their applications. Our approach is therefore via triangu- tions. For this reason, Scarf is cited less in this manuscript than his contri- tions would otherwise warrant. We have also confined our treatment of applications to the computation of economic equilibria and the solution of optimization problems. Hansen and Koopmans  apply fixed-point methods to the computation of an invariant optimal capital stock in an economic growth model. Applications to game theory are discussed in Scarf [56,58], Shapley , and Garcia, Lemke and Luethi . Allgower  and Jeppson  use fixed-point algorithms to find many solutions to boundary-value problems.
(retrieved from Amazon Fri, 19 Feb 2016 10:19:20 -0500)
No library descriptions found.
RatingAverage: No ratings.
Is this you?
Become a LibraryThing Author.