Computing top eigenpairs of Hermitizable matrix  

作　　者：Mu-Fa CHEN Zhi-Gang JIA Hong-Kui PANG 

机构地区：[1]Research Institute of Mathematical Science,Jiangsu Normal University,Xuzhou 221116,China [2]School of Mathematical Sciences,Beijing Normal University,Beijing 100875,China [3]Laboratory of Mathematics and Complex Systems(Beijing Normal University),Ministry of Education,Beijing 100875,China [4]School of Mathematics and Statistics,Jiangsu Normal University,Xuzhou 221116,China

出　　处：《Frontiers of Mathematics in China》2021年第2期345-379,共35页中国高等学校学术文摘·数学（英文）

基　　金：This work was supported in part by the National Natural Science Foundation of China(Grant Nos.12090011,11771046,11771188,11771189);the National Key R&D Program of China(No.2020YFA0712900);the Natural Science Foundation of Jiangsu Province(Grant No.BK20171162);the project from the Ministry of Education in China,and the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.

摘　　要：The top eigenpairs at the title mean the maximal, the submaximal, or a few of the subsequent eigenpairs of an Hermitizable matrix. Restricting on top ones is to handle with the matrices having large scale, for which only little is known up to now. This is different from some mature algorithms, that are clearly limited only to medium-sized matrix for calculating full spectrum. It is hoped that a combination of this paper with the earlier works, to be seen soon, may provide some effective algorithms for computing the spectrum in practice, especially for matrix mechanics.

关 键 词：Hermitizable Householder transformation birth-death matrix isospectral matrices top eigenpairs ALGORITHM 

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