On Pseudospectral Concentration for Rank-1 Sampling

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Gai, Kuo, Shi, Bin
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916739573350400
author Gai, Kuo
Shi, Bin
author_facet Gai, Kuo
Shi, Bin
contents 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-$1$ 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-$1$ 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 $δ_d \sim 1/\sqrt{d}$. Next, for the equivalence class of nilpotent Jordan blocks, we exploit classical probabilistic tools, specifically, the Hanson-Wright concentration inequality and the Carbery-Wright anti-concentration inequality, to obtain singular concentration bounds, and demonstrate that the separation radius exhibits the same dimension-dependent scaling. This yields a singular pseudospectral concentration framework. Finally, observing that upper triangular Toeplitz matrices can be represented via the symbolic polynomials of nilpotent Jordan blocks, we employ partial fraction decomposition of rational functions to extend the singular framework to the equivalence class of upper triangular Toeplitz matrices.
format Preprint
id arxiv_https___arxiv_org_abs_2505_10896
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On Pseudospectral Concentration for Rank-1 Sampling
Gai, Kuo
Shi, Bin
Spectral Theory
Numerical Analysis
Probability
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-$1$ 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-$1$ 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 $δ_d \sim 1/\sqrt{d}$. Next, for the equivalence class of nilpotent Jordan blocks, we exploit classical probabilistic tools, specifically, the Hanson-Wright concentration inequality and the Carbery-Wright anti-concentration inequality, to obtain singular concentration bounds, and demonstrate that the separation radius exhibits the same dimension-dependent scaling. This yields a singular pseudospectral concentration framework. Finally, observing that upper triangular Toeplitz matrices can be represented via the symbolic polynomials of nilpotent Jordan blocks, we employ partial fraction decomposition of rational functions to extend the singular framework to the equivalence class of upper triangular Toeplitz matrices.
title On Pseudospectral Concentration for Rank-1 Sampling
topic Spectral Theory
Numerical Analysis
Probability
url https://arxiv.org/abs/2505.10896