When is the Resolvent Like a Rank One Matrix?
Anne Greenbaum, Faranges Kyanfar, Abbas Salemi

TL;DR
This paper investigates when the resolvent of a matrix closely resembles a rank one matrix, relating this to pseudospectra, eigenvalue neighborhoods, and singular vectors, with theoretical and numerical insights.
Contribution
It establishes a connection between the resolvent's rank-one approximation set and the pseudospectrum, providing new results for Jordan blocks, Toeplitz matrices, and eigenvalue neighborhoods.
Findings
The set where the resolvent approximates a rank one matrix relates to the pseudospectrum.
Disks around eigenvalues are contained in this set, offering new spectral insights.
Numerical experiments show the set of singular vector inner products can be nearly as large as the resolvent approximation set.
Abstract
For a square matrix , the resolvent of at a point is defined as . We consider the set of points where the relative difference in 2-norm between the resolvent and the nearest rank one matrix is less than a given number . We establish a relationship between this set and the -pseudospectrum of , and we derive specific results about this set for Jordan blocks and for a class of large Toeplitz matrices. We also derive disks about the eigenvalues of that are contained in this set, and this leads to some new results on disks about the eigenvalues that are contained in the -pseudospectrum of . In addition, we consider the set of points where the absolute value of the inner product of the left and right singular vectors corresponding to the largest singular value of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Spectral Theory in Mathematical Physics · Holomorphic and Operator Theory
