Computing the maximal eigenpairs of large size tridiagonal matrices with O (1) number of iterations

DOI10.4208/NMTMA.2018.S11zbMATH Open1438.65067OpenAlexW2916928253WikidataQ128348046 ScholiaQ128348046MaRDI QIDQ5197260FDOQ5197260

Authors: Tao Tang, Jiang Yang 

Publication date: 20 September 2019

Published in: Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/nmtma.2018.s11

Recommendations

• Development of powerful algorithm for maximal eigenpair
• Trilogy on computing maximal eigenpair
• Global algorithms for maximal eigenpair
• Efficient computation of tridiagonal matrices largest eigenvalue
• An Inverse Extreme Eigenpair Problem and Its Parallel Iterative Solution for Symmetric Tridiagonal Matrices

zbMATH Keywords

complexityscalingmaximal eigenpairlarge size tridiagonal matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (6)

• Hermitizable, isospectral complex matrices or differential operators
• The charming leading eigenpair
• An Inverse Extreme Eigenpair Problem and Its Parallel Iterative Solution for Symmetric Tridiagonal Matrices
• Efficient computation of tridiagonal matrices largest eigenvalue
• Development of powerful algorithm for maximal eigenpair
• Trilogy on computing maximal eigenpair

This page was built for publication: Computing the maximal eigenpairs of large size tridiagonal matrices with \(\mathcal{O} (1)\) number of iterations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197260)