Investigations Into the Efficiency of the Fixed Point Algorithms
暂无分享,去创建一个
In this paper, we study the effect of different labelings and triangulations on the efficiency of the fixed point algorithms. In particular, we show that the convergence and accuracy are functions of the particular labeling employed. In addition two triangulations are studied and theoretically speculated to be different. Empirical results on implementing these two triangulations in a fixed point algorithm, confirm this difference.
[1] B. Curtis Eaves,et al. Homotopies for computation of fixed points on unbounded regions , 1972, Math. Program..
[2] Harold W. Kuhn,et al. Some Combinatorial Lemmas in Topology , 1960, IBM J. Res. Dev..