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

DOI10.4208/NMTMA.2018.S11MaRDI QIDQ5197260zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

complexitylarge size tridiagonal matrixmaximal eigenpairscaling

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Efficient computation of tridiagonal matrices largest eigenvalue
• Trilogy on computing maximal eigenpair
• Hermitizable, isospectral complex matrices or differential operators
• Development of powerful algorithm for maximal eigenpair
• The charming leading eigenpair
• An Inverse Extreme Eigenpair Problem and Its Parallel Iterative Solution for Symmetric Tridiagonal Matrices
• Finding the Maximal Eigenpair for a Large, Dense, Symmetric Matrix based on Mufa Chen's Algorithm

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)