On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
From MaRDI portal
Publication:4377488
DOI10.1137/S0895479895294484zbMath0897.65028MaRDI QIDQ4377488
No author found.
Publication date: 9 February 1998
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Fluid queues driven by birth and death processes with quadratic rates, Birth and Death (BDP) Process Models with Applications, The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem, Computation of exact inertia and inclusions of eigenvalues (singular values) of tridiagonal (bidiagonal) matrices, Current inverse iteration software can fail, Fernando's solution to Wilkinson's problem: An application of double factorization, Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values., The numerical solution of a birth-death process arising in multimedia synchronization, The orthogonal Rayleigh quotient iteration (ORQI) method, An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD, Inner deflation for symmetric tridiagonal matrices
