Maximum of the resolvent over matrices with given spectrum

Abstract

In numerical analysis it is often necessary to estimate the condition number CN(T)=||T|| ·||T-1|| and the norm of the resolvent ||(ζ-T)-1|| of a given n× n matrix T. 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 CN(T) over all matrices with ||T|| ≤1 and minimal absolute eigenvalue r=i=1,...,n|λi|>0 is the Kronecker bound 1rn. This result is subsequently generalized by computing the corresponding supremum of ||(ζ-T)-1|| for any |ζ| ≤1. 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 so-called model matrices, i.e. matrix representations of the compressed backward shift operator on the Hardy space H2 to a finite-dimensional invariant subspace.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…