Papers › K-Spectral Sets
K-Spectral Sets
Anne Greenbaum, Natalie Wellen
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We use results in [M. Crouzeix and A. Greenbaum,Spectral sets: numerical range and beyond, SIAM Jour. Matrix Anal. Appl., 40 (2019), pp. 1087-1101] to derive a variety of K-spectral sets and show how they can be used in some applications. We compare the K-values derived here to those that can be derived from a straightforward application of the Cauchy integral formula, by replacing the norm of the integral by the integral of the resolvent norm. While, in some cases, the new upper bounds on the optimal K-value are much tighter than those from the Cauchy integral formula, we show that in many cases of interest, the two values are of the same order of magnitude, with the bounds from the Cauchy integral formula actually being slightly smaller. We give a partial explanation of this in terms of the numerical range of the resolvent at points near an ill-conditioned eigenvalue.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections