Summary
A systematic search program is given for an approximate fixed point of a continuous mapping of either the unitn-cube into itself or a “preferred”n-simplex (on the unitn-cube) into itself. The coding is in FORTRAN IV.
Zusammenfassung
Es wird ein systematisches Suchprogramm angegeben für einen Fixpunkt einer stetigen Abbildung, die entweder denn-dimensionalen Einheitswürfel oder einen speziell gewähltenn-simplex in sich überführt. Das Programm ist in FORTRAN IV geschrieben.
Similar content being viewed by others
References
Allgower, E. L., C. L. Keller, andT. E. Reeves: A Program for the Numerical Approximation of a Fixed Point of an Arbitrary Continuous Mapping of then-cube orn-simplex into Itself. ARL Technical Report, Wright-Patterson AFB, Ohio (in preparation).
Kuhn, H. W.: Some Combinatorial Lemmas in Topology. IBM Journal1960, 518–524.
Kuhn, H. W.: Approximate Search for Fixed Points, in Computing Methods in Optimization Problems 2, 199–211. New York: Academic Press. 1969.
Scarf, H.: The Approximation of Fixed Points of a Continuous Mapping. SIAM J. Appl. Math.15, 1328 (1967).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Allgower, E.L., Keller, C.L. A search routine for a Sperner simplex. Computing 8, 157–165 (1971). https://doi.org/10.1007/BF02234051
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02234051