Development of powerful algorithm for maximal eigenpair

DOI10.1007/s11464-019-0769-5zbMath1476.65051OpenAlexW2948012077WikidataQ127769431 ScholiaQ127769431MaRDI QIDQ2316939

Yue-Shuang Li, Chen Mu-Fa

Publication date: 7 August 2019

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-019-0769-5

zbMATH Keywords

maximal eigenpairhermitizable tridiagonal matrixpowerful algorithmsub-maximal eigenpair

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Stochastic stability in control theory (93E15)

Related Items

Improved global algorithms for maximal eigenpair, Computing partial quaternion eigenpairs with quaternion shift, Computing top eigenpairs of Hermitizable matrix

Cites Work

• Unnamed Item
• Efficient initials for computing maximal eigenpair
• Isospectral operators
• Speed of stability for birth-death processes
• Eigenvalue computation in the 20th century
• Global algorithms for maximal eigenpair
• Trilogy on computing maximal eigenpair
• Hermitizable, isospectral complex matrices or differential operators
• Real tridiagonalization of Hermitian matrices by modified Householder transformation
• Criteria for discrete spectrum of 1D operators
• The Charming Leading Eigenpair
• Eigenvalues, Inequalities, and Ergodic Theory
• Computing the Maximal Eigenpairs of Large Size Tridiagonal Matrices with O(1) Number of Iterations
• Unitary Triangularization of a Nonsymmetric Matrix