A new subdivision for computing fixed points with a homotopy algorithm
- 1 December 1980
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 19 (1), 78-91
- https://doi.org/10.1007/bf01581629
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An improvement of fixed point algorithms by using a good triangulationMathematical Programming, 1980
- A restart algorithm for computing fixed points without an extra dimensionMathematical Programming, 1979
- A restart algorithm without an artificial level for computing fixed points on unbounded regionsLecture Notes in Mathematics, 1979
- Efficient Acceleration Techniques for Fixed Point AlgorithmsSIAM Journal on Numerical Analysis, 1978
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary PivotingMathematics of Operations Research, 1977
- The Computation of Fixed Points and ApplicationsPublished by Springer Nature ,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
- Some Combinatorial Lemmas in TopologyIBM Journal of Research and Development, 1960