Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
Fixed Points: Algorithms and Applications covers the proceedings of the First International Conference on Computing Fixed Points with Applications, held in the Department of Mathematical Sciences at Clemson University, Clemson, South Carolina on June 26-28, 1974. This book is composed of 21 chapters and starts with reviews of finding roots of polynomials by pivoting procedures and the relations between convergence and labeling in approximation algorithm. The next chapters deal with the principles of complementary pivot theory and the Markovian decision chains; the method of continuation for Brouwer fixed point calculation; a fixed point approach to stability in cooperative games; and computation of fixed points in a nonconvex region. Other chapters discuss a computational comparison of fixed point algorithms, the fundamentals of union jack triangulations, and some aspects of Mann’s iterative method for approximating fixed points. The final chapters consider the application of fixed point algorithms to the analysis of tax policies and the pricing for congestion in telephone networks. This book will prove useful to mathematicians, computer scientists, and advance mathematics students.
Finding Roots of Polynomials by Pivoting
A New Simplicial Approximation Algorithm with Restarts: Relations Between Convergence and Labelings
Complementary Pivot Theory and Markovian Decision Chains
Application of a Fixed Point Search Algorithm to Nonlinear Boundary Value Problems Having Several Solutions
Generating Stationary Points for a Class of Mathematical Programming Problems by Fixed Point Algorithms
A Method of Continuation for Calculating a Brouwer Fixed Point
Continuation Methods for Simplicial Mappings
A Fixed Point Approach to Stability in Cooperative Games
Error Bounds for Approximate Fixed Points
Computation of Fixed Points in a Nonconvex Region
Investigations into the Efficiency of the Fixed Point Algorithms
Almost-Complementary Paths in the Generalized Complementarity Problem
A Computational Comparison of Fixed Point Algorithms which Use Complementary Pivoting
Computational Experience with Large-Scale Linear Complementarity Problems
Union Jack Triangulations
Fixed Point Iterations Using Infinite Matrices, III
Some Aspects of Mann's Iterative Method for Approximating Fixed Points
Solving Economic General Equilibrium Models by the Sandwich Method
Applying Fixed Point Algorithms to the Analysis of Tax Policies
Fiscal Harmonization in the EEC; Some Preliminary Findings of Fixed Point Calculations
Pricing for Congestion in Telephone Networks: A Numerical Example
- No. of pages:
- © Academic Press 1977
- 1st January 1977
- Academic Press
- eBook ISBN:
Elsevier.com visitor survey
We are always looking for ways to improve customer experience on Elsevier.com.
We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit.
If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website.
Thanks in advance for your time.