Computable eigenvalue bounds for rank-k perturbations
From MaRDI portal
The authors investigate lower bounds for the eigenvalues of low rank Hermitian perturbations of Hermitian matrices and for the singular values of low rank perturbations of general matrices. They show that, for the smallest eigenvalue, some earlier results of Weyl and of \textit{I. C. F. Ipsen} and \textit{B. Nadler} [SIAM J. Matrix Anal. Appl. 31, 40--53 (2009; Zbl 1189.15022)] are the first two of a sequence of increasingly tight bounds. Generally the \(q\)th element of the sequence is an eigenvalue of a \(q\times q\) matrix.
Recommendations
- A note on bounds to the variation of eigenvalues in symmetric matrix perturbation of rank one
- Refined perturbation bounds for eigenvalues of Hermitian and non-Hermitian matrices
- Lower and upper bounds for the number of distinct eigenvalues of a perturbed regular matrix pencil
- scientific article; zbMATH DE number 1215246
- scientific article; zbMATH DE number 640485
Cites work
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Matrices with prescribed Ritz values
- QR-Like Algorithms for Symmetric Arrow Matrices
- Rank-one modification of the symmetric eigenproblem
- Refined perturbation bounds for eigenvalues of Hermitian and non-Hermitian matrices
- Some Modified Matrix Eigenvalue Problems
- Updating the partial singular value decomposition in latent semantic indexing
- Updating the singular value decomposition
- Using Linear Algebra for Intelligent Information Retrieval
Cited in
(12)- Expanders that beat the eigenvalue bound: Explicit construction and applications
- Circulant preconditioners for functions of Hermitian Toeplitz matrices
- An efficient method for computing the inverse of arrowhead matrices
- A note on bounds to the variation of eigenvalues in symmetric matrix perturbation of rank one
- A note on eigenvalues of fixed rank perturbations of diagonal matrices
- The bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitian eigenvalue problem
- Preconditioning and Iterative Solution of All-at-Once Systems for Evolutionary Partial Differential Equations
- A Preconditioned MINRES Method for Optimal Control of Wave Equations and its Asymptotic Spectral Distribution Theory
- A block Toeplitz preconditioner for all-at-once systems from linear wave equations
- A sine transform based preconditioned MINRES method for all-at-once systems from constant and variable-coefficient evolutionary PDEs
- Block \(\omega\)-circulant preconditioners for parabolic optimal control problems
- Block -circulant preconditioners for parabolic equations
This page was built for publication: Computable eigenvalue bounds for rank-\(k\) perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968983)