On close eigenvalues of tridiagonal matrices
From MaRDI portal
Studying the relations between close eigenvalues of a tridiagonal matrix and eigenvalues of its complementary diagonal blocks, the author gets quantitative results that explain how a tridiagonal matrix with relatively large off-diagonal entries can have close eigenvalues. The exposition covers both symmetric and unsymmetric matrices and yields better insight into the Lanczos algorithm.
Recommendations
Cited in
(13)- Coalescing points for eigenvalues of banded matrices depending on parameters with application to banded random matrix functions
- Spectra of certain large tridiagonal matrices
- On the distance to the closest matrix with triple zero eigenvalue
- Invariant subspaces for tightly clustered eigenvalues of tridiagonals
- Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix
- Eigenvalue problems for a class of infinite complex symmetric tridiagonal matrices with related three-term recurrence relation
- Eigenpairs of a family of tridiagonal matrices: three decades later
- scientific article; zbMATH DE number 4023493 (Why is no real title available?)
- The spectrum of a glued matrix
- Spectral problem for quasi-uniform nearest-neighbor chains
- On localization of the eigenvalues of matrices "close" to triangular ones
- On the eigenvalue-separation properties of real tridiagonal matrices
- Eigenvalue perturbation bounds for Hermitian block tridiagonal matrices
This page was built for publication: On close eigenvalues of tridiagonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893504)