Abstract
When we apply the fixed point computing method to mappings which are affine in some variables, we show that, to generate a sequence which converges to a fixed point, the mesh size need not be decreased in these coordinates. This paper modifies the triangulationJ 3 with continuous refinement of mesh size to a triangulation\(\bar J_3\) such that the mesh size of\(\bar J_3\) in some given coordinates is constant and the mesh size in the other coordinates shrinks to zero.
This is a preview of subscription content, log in via an institution to check access.
References
B.C. Eaves, “Homotopies for computation of fixed points”,Mathematical Programming 3 (1972) 1–22.
B.C. Eaves and R. Saigal, “Homotopies for computation of fixed points on unbounded regions”,Mathematical Programming 3 (1972) 225–237.
O.L. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969).
M.J. Todd, “Union jack triangulations”, in S. Karamardian, ed.,Fixed points: algorithms and applications (Academic Press, New York, 1977) pp. 315–336.
M.J. Todd, “On triangulations for computing fixed points”,Mathematical Programming 10 (1976) 322–346.
M.J. Todd,The computation of fixed points and applications (Springer, New York, 1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kojima, M. A modification of todd's triangulationJ 3 . Mathematical Programming 15, 223–227 (1978). https://doi.org/10.1007/BF01609022
Issue Date:
DOI: https://doi.org/10.1007/BF01609022