|
|
|
Development of powerful algorithm for maximal eigenpair |
Mu-Fa CHEN, Yue-Shuang LI( ) |
| School of Mathematical Sciences, Beijing Normal University, Laboratory of Mathematics and Complex Systems (Beijing Normal University), Ministry of Education, Beijing 100875, China |
|
|
|
|
Abstract 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.
|
| Keywords
Powerful algorithm
maximal eigenpair
sub-maximal eigenpair
Hermitizable tridiagonal matrix
|
|
Corresponding Author(s):
Yue-Shuang LI
|
|
Issue Date: 10 July 2019
|
|
| 1 |
M F Chen. Eigenvalues, Inequalities, and Ergodic Theory. London: Springer, 2005
|
| 2 |
M F Chen. Speed of stability for birth{death processes. Front Math China, 2010, 5(3): 379–515
https://doi.org/10.1007/s11464-010-0068-7
|
| 3 |
M F Chen. Criteria for discrete spectrum of 1D operators. Commun Math Stat, 2014, 2: 279–309
https://doi.org/10.1007/s40304-014-0041-y
|
| 4 |
M F Chen. Effcient initials for computing the maximal eigenpair. Front Math China, 2016, 11(6): 1379–1418
https://doi.org/10.1007/s11464-016-0573-4
|
| 5 |
M F Chen. The charming leading eigenpair. Adv Math (China), 2017, 46(4): 281–297
|
| 6 |
M F Chen. Global algorithms for maximal eigenpair. Front Math China, 2017, 12(5): 1023–1043
https://doi.org/10.1007/s11464-017-0658-8
|
| 7 |
M F Chen. Trilogy on computing maximal eigenpair. In: Yue W, Li Q L, Jin S, Ma Z, eds. Queueing Theory and Network Applications (QTNA 2017). Lecture Notes in Comput Sci, Vol 10591. Cham: Springer, 2017, 312–329
https://doi.org/10.1007/978-3-319-68520-5_19
|
| 8 |
M F Chen. Hermitizable, isospectral complex matrices or differential operators. Front Math China, 2018, 13(6): 1267–1311
https://doi.org/10.1007/s11464-018-0716-x
|
| 9 |
M F Chen, X Zhang. Isospectral operators. Commun Math Stat, 2014, 2: 17–32
https://doi.org/10.1007/s40304-014-0028-8
|
| 10 |
B A Cipra. The best of the 20th century: Editors name top 10 algorithms. SIAM News, 2000, 33(4): 1–2
|
| 11 |
A V Frolov, V V Voevodin, A Teplov. Thomas algorithm, pointwise version.
|
| 12 |
From Wikipedia.Tridiagonal matrix algorithm.
|
| 13 |
G H, Golub H A van der Vorst. Eigenvalue computation in the 20th century. J Comput Appl Math, 2000, 123(1{2): 35–65
https://doi.org/10.1016/S0377-0427(00)00413-1
|
| 14 |
A S Householder. Unitary triangularization of a nonsymmetric matrix. J Assoc Comput Mach, 1958, 5: 339–342
https://doi.org/10.1145/320941.320947
|
| 15 |
C Moler. Llewellyn Thomas.
|
| 16 |
O Shukuzawa, T Suzuki, I Yokota. Real tridiagonalization of Hermitian matrices by modified Householder transformation. Proc Japan Acad Ser A, 1996, 72: 102–103
https://doi.org/10.3792/pjaa.72.102
|
| 17 |
G W Stewart. The decompositional approach to matrix computation. IEEE Comput Sci Eng, 2000, 2(1): 50–59
https://doi.org/10.1109/5992.814658
|
| 18 |
T Tang, J Yang. Computing the maximal eigenpairs of large size tridiagonal matrices with O(1) number of iterations. Numer Math Theory Methods Appl, 2018, 11(4): 877–894
https://doi.org/10.4208/nmtma.2018.s11
|
| 19 |
H A van der Vorst, G H Golub. 150 Years old and still alive: eigenproblems. In: Duff I S, Watson G A, eds. The State of the Art in Numerical Analysis. Oxford: Oxford Univ Press, 1997, 93–119
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
