Development of powerful algorithm for maximal eigenpair
为最大的 eigenpair 的强大的算法的开发作者机构: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年第14卷第3期
页 面:493-519页
核心收录:
学科分类:07[理学]
基 金:supported in part the National Natural Science Foundation of China (Grant No. 11771046) the Project from the Ministry of Education in China the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions
主 题:Powerful algorithm maximal eigenpair sub-maximal eigenpair Hermitizable tridiagonal matrix
摘 要:Based on a series of recent papers, a powerful algorithm is reformulated for computing the maximal eigenpair of self-adjoint complex tridiagonal matrices. In parallel, the same problem in a particular case for computing the sub-maximal eigenpair is also introduced. The key ideas for each critical improvement are explained. To illustrate the present algorithm and compare it with the related algorithms, more than 10 examples are included.