Refined bounds on the number of distinct eigenvalues of a matrix after low-rank update
From MaRDI portal
Publication:5145545
DOI10.1080/03081087.2018.1520801OpenAlexW2890326063WikidataQ114641389 ScholiaQ114641389MaRDI QIDQ5145545
Publication date: 21 January 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.08369
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (2)
Lower and upper bounds for the number of distinct eigenvalues of a perturbed regular matrix pencil ⋮ A theorem on the number of distinct eigenvalues
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem
- Rank-one modification of the symmetric eigenproblem
- An improved upper bound for the number of distinct eigenvalues of a matrix after perturbation
- The Number of Distinct Eigenvalues of a Matrix After Perturbation
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Low Rank Perturbation of Jordan Structure
- Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update
- Low rank update of singular values
- Some Modified Matrix Eigenvalue Problems
This page was built for publication: Refined bounds on the number of distinct eigenvalues of a matrix after low-rank update