摘要
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.
基金
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.
