Normal matrices
Gorka Armentia, Juan-Miguel Gracia, Francisco-Enrique Velasco

TL;DR
This paper characterizes normal matrices by examining the spectral norm distances from a matrix to matrices with specific eigenvalues, establishing a criterion based on equality of these distances for multiple points.
Contribution
It introduces a new characterization of normal matrices using spectral norm distances to matrices with given eigenvalues based on spectral properties.
Findings
Equality of spectral norm distances for many points implies normality.
Provides a spectral norm-based criterion for normal matrices.
Connects eigenvalue proximity with matrix normality.
Abstract
Let be a square complex matrix and a complex number. The distance, with respect to the spectral norm, from to the set of matrices which have as an eigenvalue is less than or equal to the distance from to the spectrum of . If these two distances are equal for a sufficiently large finite set of numbers which are not in the spectrum of , then the matrix is normal.
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 · Advanced Topics in Algebra · Graph theory and applications
