Skip to main content
Log in

Homeomorphisms of triangulations with applications to computing fixed points

  • Published:
Mathematical Programming Submit manuscript

Abstract

In the past decade various complementary pivoting algorithms have been developed to search for fixed points of certain functions and point to set maps. All these methods generate a sequence of simplexes which are ‘shrinking’ to a point. This paper proposes a new method for shrinking the simplexes. It is shown that under certain conditions, the function whose fixed point is sought may be used to control this shrinking process. A computational method for implementing these ideas is also suggested and several examples are solved using this approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S.S. Cairns,Introductory topology (The Ronald Press Company, 1961).

  2. B.C. Eaves, “Homotopies for computation of fixed points”,Mathematical Programming 3 (1972) 1–22.

    Google Scholar 

  3. B.C. Eaves, “A short course in solving equations with PL homotopies”,SIAM-AMS Proceedings 9 (1976) 73–143.

    Google Scholar 

  4. B.C. Eaves and R. Saigal, “Homotopies for computation of fixed points on unbounded regions”,Mathematical Programming 3 (1972) 225–237.

    Google Scholar 

  5. T. Hansen and H. Scarf, “On the applications of a recent combinatorial algorithm”, Cowles Foundation Discussion Paper No. 272, Yale University (1969).

  6. H.W. Kuhn, “Simplicial approximations of fixed points”,Proceedings of the National Academy of Science 61 (1968) 1238–1242.

    Google Scholar 

  7. O.H. Merril, “Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings”, Ph.D. Thesis, University of Michigan (Ann Arbor, 1972).

    Google Scholar 

  8. H. Scarf, “The approximation of fixed points of a continuous mapping”,SIAM Journal of Applied Mathematics 15 (1967) 1238–1343.

    Google Scholar 

  9. M.J. Todd, “On triangulations for computing fixed points”,Mathematical Programming 10 (1976) 322–346.

    Google Scholar 

  10. M.J. Todd, “Union Jack triangulations”, in: S. Karamardian, ed.,Fixed Points: algorithms and applications (Academic Press, New York, 1977).

    Google Scholar 

  11. W.I. Zangwill, “An eccentric barycentric fixed point algorithm”,Mathematics of Operations Research 2 (1977) 343–359.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

An abstract appears in the November, 1978 issue of Notices of the American Mathematical Society.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Solow, D. Homeomorphisms of triangulations with applications to computing fixed points. Mathematical Programming 20, 213–224 (1981). https://doi.org/10.1007/BF01589346

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01589346

Key words

Navigation