Development of powerful algorithm for maximal eigenpair

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 im...

Full description

Saved in:
Bibliographic Details
Published inFrontiers of Mathematics Vol. 14; no. 3; pp. 493 - 519
Main Authors Chen, Mu-Fa, Li, Yue-Shuang
Format Journal Article
LanguageEnglish
Published Beijing Higher Education Press 01.06.2019
Springer Nature B.V
Subjects
Algorithms
Computation
Mathematics
Mathematics and Statistics
Survey Article
93E15
Hermitizable tridiagonal matrix
Powerful algorithm
65F15
60J27
sub-maximal eigenpair
maximal eigenpair
15A18
Online AccessGet full text
ISSN1673-3452
2731-8648
1673-3576
2731-8656
DOI10.1007/s11464-019-0769-5

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1673-3452
2731-8648
1673-3576
2731-8656
DOI:10.1007/s11464-019-0769-5