COVID-19 Update: We are currently shipping orders daily. However, due to transit disruptions in some geographies, deliveries may be delayed. To provide all customers with timely access to content, we are offering 50% off Science and Technology Print & eBook bundle options. Terms & conditions.
Fixed Points - 1st Edition - ISBN: 9780123980502, 9781483261133

Fixed Points

1st Edition

Algorithms and Applications

Editor: Stepan Karamardian
eBook ISBN: 9781483261133
Imprint: Academic Press
Published Date: 1st January 1977
Page Count: 506
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST

Institutional Subscription

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free 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.

Table of Contents




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:

About the Editor

Stepan Karamardian

Ratings and Reviews