改进的2^n—射线算法与Brouwer不动点定理的证明
A revised 2~n-ray algorithm and a proof of the Brouwer fixed point theorem
摘要
本文给出一个改进的2~n-射线算法和 Brouwer 不动点定理一个新的构造性证明,并给出了新算法的一些数值试验结果。
A revised 2'-ray algorithm and a new constructive proof of an equivalent form of
Brouwer fixed point theorem are proposed,and some numerical test results of the new
algorithm are given.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
1991年第4期103-111,共9页
Journal of Xidian University
关键词
不动点定理
2^n-射线算法
Brouwer
2~n-ray algorithm
Brouwer fixed point theorem
triangulation
vector labelling
参考文献5
-
1T. M. Doup,A. J. J. Talman. A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices[J] 1987,Mathematical Programming(3):319～355
-
2G. Laan,L. P. Seelen. Efficiency and implementation of simplicial zero point algorithms[J] 1984,Mathematical Programming(2):196～217
-
3G. Laan,A. J. J. Talman. A class of simplicial restart fixed point algorithms without an extra dimension[J] 1981,Mathematical Programming(1):33～48
-
4Alden H. Wright. The octahedral algorithm, a new simplicial fixed point algorithm[J] 1981,Mathematical Programming(1):47～69
-
5B. Curtis Eaves,Romesh Saigal. Homotopies for computation of fixed points on unbounded regions[J] 1972,Mathematical Programming(1):225～237
