Maximum of the resolvent over matrices with given spectrum
Oleg Szehr, Rachid Zarouf

TL;DR
This paper derives new spectral bounds for the condition number and resolvent norm of matrices with given spectra, identifying explicit extremal matrices and generalizing classical bounds in numerical analysis.
Contribution
It introduces new spectral estimates for the condition number and resolvent norm, explicitly characterizes extremal matrices, and generalizes known bounds for matrices with specified spectra.
Findings
Supremum of the condition number over matrices with norm ≤ 1 and minimal eigenvalue r is 1/r^n.
Supremum of the resolvent norm for |ζ| ≤ 1 is attained by a triangular Toeplitz matrix.
Explicit extremal matrices are identified as structured model matrices related to the Hardy space.
Abstract
In numerical analysis it is often necessary to estimate the condition number and the norm of the resolvent of a given matrix . We derive new spectral estimates for these quantities and compute explicit matrices that achieve our bounds. We recover the well-known fact that the supremum of over all matrices with and minimal absolute eigenvalue is the Kronecker bound . This result is subsequently generalized by computing the corresponding supremum of for any . We find that the supremum is attained by a triangular Toeplitz matrix. This provides a simple class of structured matrices on which condition numbers and resolvent norm bounds can be studied numerically. The occuring Toeplitz matrices are…
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.
