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)
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (17)
Twisted factorization of a banded matrix ⋮ Computation of exact inertia and inclusions of eigenvalues (singular values) of tridiagonal (bidiagonal) matrices ⋮ Fernando's solution to Wilkinson's problem: An application of double factorization ⋮ On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix ⋮ Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations ⋮ Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values. ⋮ Ramanujan theta functions and birth and death processes ⋮ A fast SVD for multilevel block Hankel matrices with minimal memory storage ⋮ Birth and Death (BDP) Process Models with Applications ⋮ The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem ⋮ Current inverse iteration software can fail ⋮ Fluid queues driven by birth and death processes with quadratic rates ⋮ The orthogonal Rayleigh quotient iteration (ORQI) method ⋮ An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD ⋮ Inner deflation for symmetric tridiagonal matrices ⋮ The numerical solution of a birth-death process arising in multimedia synchronization ⋮ A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
This page was built for publication: On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
