A restart algorithm without an artificial level for computing fixed points on unbounded regions
- 1 January 1979
- book chapter
- Published by Springer Nature in Lecture Notes in Mathematics
- p. 247-256
- https://doi.org/10.1007/bfb0064322
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Improving the convergence of fixed-point algorithmsPublished by Springer Nature ,1978
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary PivotingMathematics of Operations Research, 1977
- Union Jack TriangulationsPublished by Elsevier ,1977
- A Computational Comparison of Fixed Point Algorithms Which Use Complementary PivotingPublished by Elsevier ,1977
- Investigations Into the Efficiency of the Fixed Point AlgorithmsPublished by Elsevier ,1977
- On triangulations for computing fixed pointsMathematical Programming, 1976
- Sandwich method for finding fixed pointsJournal of Optimization Theory and Applications, 1975
- The Approximation of Fixed Points of a Continuous MappingSIAM Journal on Applied Mathematics, 1967