论文信息 - Infinite retrogression in the Eaves—Saigal algorithm

Infinite retrogression in the Eaves—Saigal algorithm

For certain functionsf fromRn toRn, the Eaves—Saigal algorithm computes a path inRn × (0, 1] which converges to a zero off. In this case, it is shown that even whenf is of classC∞ and has a unique zero, the converging path may retrogress infinitely many times.

Peter S. Brooks | P. Brooks

[1] M. Todd. Union Jack Triangulations , 1977 .

[2] B. Eaves. Computing Kakutani Fixed Points , 1971 .

[3] B. Curtis Eaves,et al. Homotopies for computation of fixed points on unbounded regions , 1972, Math. Program..

[4] J. Munkres,et al. Calculus on Manifolds , 1965 .

[5] B. Curtis Eaves,et al. Homotopies for computation of fixed points , 1972, Math. Program..

[6] J. Munkres,et al. Elementary Differential Topology. , 1967 .

[7] E. Artin,et al. Introduction to algebraic topology , 1969 .

[8] Masakazu Kojima,et al. Studies on Piecewise-Linear Approximations of Piecewise-C1 Mappings in Fixed Points and Complementarity Theory , 1978, Math. Oper. Res..