Efficient initials for computing maximal eigenpair  

作　　者：Mu-Fa CHEN 

机构地区：[1]School of Mathematical Sciences, Beijing Normal University, Laboratory of Mathematics and Complex Systems (Beijing Normal University), Ministry of Education, Beijing 100875, China

出　　处：《Frontiers of Mathematics in China》2016年第6期1379-1418,共40页中国高等学校学术文摘·数学（英文）

基　　金：Acknowledgements The main results of the paper have been reported at Anhui Normal University, Jiangsu Normal University, the International Workshop on SDEs and Numerical Methods at Shanghai Normal University, Workshop on Markov Processes and Their Applications at Hunan University of Arts and Science, and Workshop of Probability Theory with Applications at University of Macao. The author acknowledges Professors Dong-Jin Zhu, Wan-Ding Ding, Ying-Chao Xie, Xue-Rong Mao, Xiang-Qun Yang, Xu-Yan Xiang, Jie Xiong, Li-Hu Xu, and their teams for very warm hospitality and financial support. The author also thanks Ms. Yue-Shuang Li for her assistance in computing large matrices. This work was supported in part by the National Natural Science Foundation of China （Grant No. 11131003）, the ＂985＂ project from the Ministry of Education in China, and the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.

摘　　要：This paper introduces some efficient initials for a well-known algorithm （an inverse iteration） for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algorithm but are also unexpectedly efficient. The initials presented here are based on our analytic estimates of the maximal eigenvalue and a mimic of its eigenvector for many years of accumulation in the study of stochastic stability speed. In parallel, the same problem for computing the next to the maximal eigenpair is also studied.This paper introduces some efficient initials for a well-known algorithm （an inverse iteration） for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algorithm but are also unexpectedly efficient. The initials presented here are based on our analytic estimates of the maximal eigenvalue and a mimic of its eigenvector for many years of accumulation in the study of stochastic stability speed. In parallel, the same problem for computing the next to the maximal eigenpair is also studied.

关 键 词：Perron-Frobenius theorem power iteration Rayleigh quotient iteration efficient initial tridiagonal matrix Q-MATRIX 

分 类 号：T[一般工业技术]