Upper and Lower Bounds for Numerical Radii of Block Shifts

preprint2014arXivOpen access

Abstract

For any nn-by-nn matrix AA of the form [0A10⋱⋱Ak−10],[\begin{array}{cccc} 0 & A_1 & & \\ & 0 & \ddots & \\ & & \ddots & A_{k-1} \\ & & & 0\end{array}], we consider two kk-by-kk matrices A′=[0∥A1∥0⋱⋱∥Ak−1∥0] and A′′=[0m(A1)0⋱⋱m(Ak−1)0],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(⋅)m(\cdot) denote the operator norm and minimum modulus of a matrix, respectively. It is shown that the numerical radii w(⋅)w(\cdot) of AA, A′A' and A′′A'' are related by the inequalities w(A′′)≤w(A)≤w(A′)w(A'')\le w(A)\le w(A'). We also determine exactly when either of the inequalities becomes an equality.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.