Year: 2018
Numerical Mathematics: Theory, Methods and Applications, Vol. 11 (2018), Iss. 4 : pp. 877–894
Abstract
In a series of papers, Chen [4–6] developed some efficient algorithms for computing the maximal eigenpairs for tridiagonal matrices. The key idea is to explicitly construct effective initials for the maximal eigenpairs and also to employ a self-closed iterative algorithm. In this paper, we extend Chen's algorithm to deal with large scale tridiagonal matrices with super-/sub-diagonal elements. By using appropriate scalings and by optimizing numerical complexity, we make the computational cost for each iteration to be O(N). Moreover, to obtain accurate approximations for the maximal eigenpairs, the total number of iterations is found to be independent of the matrix size, i.e., O(1) number of iterations. Consequently, the total cost for computing the maximal eigenpairs is O(N). The effectiveness of the proposed algorithm is demonstrated by numerical experiments.
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/nmtma.2018.s11
Numerical Mathematics: Theory, Methods and Applications, Vol. 11 (2018), Iss. 4 : pp. 877–894
Published online: 2018-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 18
-
Hermitizable, isospectral complex matrices or differential operators
Chen, Mu-Fa
Frontiers of Mathematics in China, Vol. 13 (2018), Iss. 6 P.1267
https://doi.org/10.1007/s11464-018-0716-x [Citations: 6] -
A Novel Divisional Bisection Method for the Symmetric Tridiagonal Eigenvalue Problem
Chu, Wei | Zhao, Yao | Yuan, HuaMathematics, Vol. 10 (2022), Iss. 15 P.2782
https://doi.org/10.3390/math10152782 [Citations: 1] -
Development of powerful algorithm for maximal eigenpair
Chen, Mu-Fa | Li, Yue-ShuangFrontiers of Mathematics in China, Vol. 14 (2019), Iss. 3 P.493
https://doi.org/10.1007/s11464-019-0769-5 [Citations: 4]