Fixed Points

Algorithms and Applications

1st Edition - January 1, 1977

Editor: Stepan Karamardian

eBook ISBN:

9 7 8 - 1 - 4 8 3 2 - 6 1 1 3 - 3

Fixed Points: Algorithms and Applications covers the proceedings of the First International Conference on Computing Fixed Points with Applications, held in the Department of… Read more

Purchase Options

LIMITED OFFER

Save 50% on book bundles

Immediately download your ebook while waiting for your print delivery. No promo code is needed.

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.