Improved Inclusion-Exclusion Eigenvalue Localization Sets for Matrices and Matrix Polynomials
Abstract
Recent developments have shown that eigenvalue localization regions can often be significantly sharpened by identifying and excluding subsets that are guaranteed to contain no eigenvalues, leading to the concept of inclusion-exclusion localization sets. In this paper, we introduce a new family of inclusion-exclusion eigenvalue localization sets based on the S-strict diagonal dominance framework and the corresponding CKV localization regions. For an arbitrary nonempty subset S of the index set, we construct novel exclusion regions and derive the associated S-SDD inclusion-exclusion localization sets. We prove that every eigenvalue of a complex matrix belongs to the proposed regions and define a refined localization set obtained by intersecting the corresponding inclusion-exclusion regions over all nonempty subsets S. The proposed framework unifies and extends several existing results. In particular, we show that the classical Gershgorin inclusion-exclusion localization set and the Dashnic-Zusmanovich inclusion-exclusion localization set arise naturally as special cases of our construction. Consequently, the new localization set provides, in general, a sharper eigenvalue inclusion region than both of these previously known localization regions. The theory is further extended to matrix polynomials, yielding corresponding inclusion-exclusion localization results for polynomial eigenvalue problems. Several numerical examples illustrate the effectiveness of the proposed approach and demonstrate the improvement achieved over existing localization sets.
Related
- Universal classical and quantum fluctuations in the large deviations of current of noisy quantum systems: Quantum symmetric simple exclusion and inclusion processes
- New Pareto Z-eigenvalue localization theorems for tensors with applications
- Eigenvalue and Eigenvector Approximation for Random Matrices Using Low-Degree Polynomials
- Improved Bounds for the Bilu-Linial Conjecture via Spectral Recovery from Mixed Determinantal Polynomials
- Interacting Quantum Symmetric Exclusion Process
BibTeX
@misc{cvetkovic2026improved,
title = {{Improved Inclusion-Exclusion Eigenvalue Localization Sets for Matrices and Matrix Polynomials}},
author = {Ljiljana Cvetkovic and Christina Michailidou and Irena Prodanovic},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.06538},
eprint = {2609.06538},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.06538},
}
RIS
TY - UNPB
TI - Improved Inclusion-Exclusion Eigenvalue Localization Sets for Matrices and Matrix Polynomials
AU - Ljiljana Cvetkovic
AU - Christina Michailidou
AU - Irena Prodanovic
PY - 2026
DA - 2026/09/06
PB - arXiv
DO - 10.48550/arxiv.2609.06538
UR - https://arxiv.org/abs/2609.06538
AB - Recent developments have shown that eigenvalue localization regions can often be significantly sharpened by identifying and excluding subsets that are guaranteed to contain no eigenvalues, leading to the concept of inclusion-exclusion localization sets. In this paper, we introduce a new family of inclusion-exclusion eigenvalue localization sets based on the S-strict diagonal dominance framework and the corresponding CKV localization regions. For an arbitrary nonempty subset S of the index set, we construct novel exclusion regions and derive the associated S-SDD inclusion-exclusion localization sets. We prove that every eigenvalue of a complex matrix belongs to the proposed regions and define a refined localization set obtained by intersecting the corresponding inclusion-exclusion regions over all nonempty subsets S. The proposed framework unifies and extends several existing results. In particular, we show that the classical Gershgorin inclusion-exclusion localization set and the Dashnic-Zusmanovich inclusion-exclusion localization set arise naturally as special cases of our construction. Consequently, the new localization set provides, in general, a sharper eigenvalue inclusion region than both of these previously known localization regions. The theory is further extended to matrix polynomials, yielding corresponding inclusion-exclusion localization results for polynomial eigenvalue problems. Several numerical examples illustrate the effectiveness of the proposed approach and demonstrate the improvement achieved over existing localization sets.
ER -