English

Sharp inequalities for the numerical radius of block operator matrices

Functional Analysis 2018-11-01 v1

Abstract

In this paper, we present several sharp upper bounds for the numerical radii of the diagonal and off-diagonal parts of the 2×22\times2 block operator matrix [ABCD]\begin{bmatrix}A&B\\ C&D\end{bmatrix}. Among extensions of some results of Kittaneh et al., it is shown that if T=[A00D]T=\begin{bmatrix}A&0\\ 0&D\end{bmatrix}, and ff and gg are non-negative continuous functions on [0,)[0,\infty) such that f(t)g(t)=t(t0)f(t)g(t)=t\,\,(t\geq 0), then for all nonnegative nondecreasing convex functions hh on [0,)[0,\infty) , we obtain that \begin{align*}h\left(w^r(T)\right)\leq \max\left(\left\|\frac{1}{p}h\left(f^{pr}(\left|A\right|)\right)+ \frac{1}{q}h\left(g^{qr}(\left|A^*\right|)\right)\right\|, \left\|\frac{1}{p}h\left(f^{pr}(\left|D\right|)\right)+ \frac{1}{q}h\left(g^{qr}(\left|D^*\right|)\right)\right\|\right), \end{align*} where p,q>1p, q>1 with 1p+1q=1\frac{1}{p}+\frac{1}{q}=1 and rmin(p,q)2r\min(p,q)\geq 2.

Keywords

Cite

@article{arxiv.1810.13093,
  title  = {Sharp inequalities for the numerical radius of block operator matrices},
  author = {M. Ghaderi Aghideh and M. S. Moslehian and J. Rooin},
  journal= {arXiv preprint arXiv:1810.13093},
  year   = {2018}
}

Comments

18 pages, to appear in Analysis Mathematica

R2 v1 2026-06-23T04:58:36.545Z