An improvement of fixed point algorithms by using a good triangulation
- 1 December 1980
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 18 (1), 274-285
- https://doi.org/10.1007/bf01588323
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A new subdivision for computing fixed points with a homotopy algorithmMathematical Programming, 1980
- A restart algorithm for computing fixed points without an extra dimensionMathematical Programming, 1979
- Investigations Into the Efficiency of the Fixed Point AlgorithmsPublished by Elsevier ,1977
- On triangulations for computing fixed pointsMathematical Programming, 1976
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational ResultsSIAM Journal on Numerical Analysis, 1976
- Sandwich method for finding fixed pointsJournal of Optimization Theory and Applications, 1975
- Homotopies for computation of fixed points on unbounded regionsMathematical Programming, 1972
- Homotopies for computation of fixed pointsMathematical Programming, 1972
- The Approximation of Fixed Points of a Continuous MappingSIAM Journal on Applied Mathematics, 1967
- Some Combinatorial Lemmas in TopologyIBM Journal of Research and Development, 1960