Computing the Maximal Eigenpairs of Large Size Tridiagonal Matrices with O(1) Number of Iterations

DOI10.4208/nmtma.2018.s11zbMath1438.65067OpenAlexW2916928253WikidataQ128348046 ScholiaQ128348046MaRDI QIDQ5197260

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

complexityscalingmaximal eigenpairlarge size tridiagonal matrix

Mathematics Subject Classification ID

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

Related Items (2)

Hermitizable, isospectral complex matrices or differential operators ⋮ Development of powerful algorithm for maximal eigenpair

This page was built for publication: Computing the Maximal Eigenpairs of Large Size Tridiagonal Matrices with O(1) Number of Iterations