Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximum of the resolvent over matrices with given spectrum

Published 28 Jan 2015 in math.NA, math.FA, and math.SP | (1501.07007v2)

Abstract: In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||{} \cdot||T{-1}||{}$ and the norm of the resolvent $||(\zeta-T){-1}||_{}$ of a given $n\times 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||{} \leq1$ and minimal absolute eigenvalue $r=\min{i=1,...,n}|\lambda_{i}|>0$ is the Kronecker bound $\frac{1}{r{n}}$. This result is subsequently generalized by computing the corresponding supremum of $||(\zeta-T){-1}||_{}$ for any $|\zeta| \leq1$. 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 $H_2$ to a finite-dimensional invariant subspace.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.