Improved global algorithms for maximal eigenpair  

作　　者：Mu-Fa CHEN Yue-Shuang 

机构地区：[1]LI 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》2019年第6期1077-1116,共40页中国高等学校学术文摘·数学（英文）

基　　金：This work was supported in part by the National Natural Science Foundation of China(Grant No.11771046);the 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 is a continuation of our previous paper[Front.Math.China,2017,12(5):10231043]where global algorithms for computing the maximal cigcnpair were introduced in a rather general setup.The efficiency of the global algorithms is improved in this paper in terms of a good use of power iteration and two quasi-symmetric techniques.Finally,the new algorithms are applied to Hua’s economic optimization model.

关 键 词：Maximal eigenpair global algorithm power iteration shifted inverse iteration quasi-symmetrization 

分 类 号：O17[理学—数学]