pith. sign in

arxiv: 1410.0339 · v1 · pith:WKS52TM5new · submitted 2014-10-01 · 🧮 math.FA

Upper and Lower Bounds for Numerical Radii of Block Shifts

classification 🧮 math.FA
keywords arrayddotsbegincccccdotinequalitiesmatrixnumerical
0
0 comments X
read the original abstract

For any $n$-by-$n$ matrix $A$ of the form \[[\begin{array}{cccc} 0 & A_1 & & \\ & 0 & \ddots & \\ & & \ddots & A_{k-1} \\ & & & 0\end{array}],\] we consider two $k$-by-$k$ matrices \[A'=[\begin{array}{cccc} 0 & \|A_1\| & & \\ & 0 & \ddots & \\ & & \ddots & \|A_{k-1}\| \\ & & & 0\end{array}] \ {and} \ A''=[\begin{array}{cccc} 0 & m(A_1) & & \\ & 0 & \ddots & \\ & & \ddots & m(A_{k-1}) \\ & & & 0\end{array}],\] where $\|\cdot\|$ and $m(\cdot)$ denote the operator norm and minimum modulus of a matrix, respectively. It is shown that the numerical radii $w(\cdot)$ of $A$, $A'$ and $A''$ are related by the inequalities $w(A'')\le w(A)\le w(A')$. We also determine exactly when either of the inequalities becomes an equality.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.