On Pseudospectral Concentration for Rank-1 Sampling
Kuo Gai, Bin Shi

TL;DR
This paper develops a probabilistic framework for pseudospectral concentration of complex matrices under rank-1 random perturbations, revealing dimension-dependent scaling laws for normal, nilpotent, and Toeplitz matrices.
Contribution
It introduces a new concentration theory for pseudospectra under rank-1 sampling, extending to various matrix classes using probabilistic inequalities and polynomial representations.
Findings
Separation radius scales as 1/√dimension for normal matrices
Singular concentration bounds hold for nilpotent Jordan blocks
Extension of concentration results to upper triangular Toeplitz matrices
Abstract
Pseudospectral analysis serves as a powerful tool in matrix computation and the study of both linear and nonlinear dynamical systems. Among various numerical strategies, random sampling, especially in the form of rank- perturbations, offers a practical and computationally efficient approach. Moreover, due to invariance under unitary similarity, any complex matrix can be reduced to its upper triangular form, thereby simplifying the analysis. In this study. we develop a quantitative concentration theory for the pseudospectra of complex matrices under rank- random sampling perturbations, establishing a rigorous probabilistic framework for spectral characterization. First, for normal matrices, we derive a regular concentration inequality and demonstrate that the separation radius scales with the dimension as . Next, for the equivalence class of nilpotent…
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
TopicsRandom Matrices and Applications · Matrix Theory and Algorithms · Advanced Optimization Algorithms Research
