Spectral Sets: Numerical Range and Beyond
Abstract
We extend the proof in [M.~Crouzeix and C.~Palencia, The numerical range is a (1 + 2)-spectral set, SIAM Jour.~Matrix Anal.~Appl., 38 (2017), pp.~649-655] to show that other regions in the complex plane are K-spectral sets. In particular, we show that various annular regions are (1 + 2 )-spectral sets and that a more general convex region with a circular hole or cutout is a (3 + 2 3 )-spectral set. We demonstrate how these results can be used to give bounds on the convergence rate of the GMRES algorithm for solving linear systems and on that of rational Krylov subspace methods for approximating f(A)b, where A is a square matrix, b is a given vector, and f is a function that can be uniformly approximated on such a region by rational functions with poles outside the region.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.