Refined bounds on the number of distinct eigenvalues of a matrix after low-rank update
From MaRDI portal
Publication:5145545
Cites work
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- An improved upper bound for the number of distinct eigenvalues of a matrix after perturbation
- Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem
- Low Rank Perturbation of Jordan Structure
- Low rank update of singular values
- Rank-one modification of the symmetric eigenproblem
- Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update
- Some Modified Matrix Eigenvalue Problems
- The number of distinct eigenvalues of a matrix after perturbation
Cited in
(3)
This page was built for publication: Refined bounds on the number of distinct eigenvalues of a matrix after low-rank update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145545)