当前位置: X-MOL 学术Anal. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Sharp Inequalities for the Numerical Radii of Block Operator Matrices
Analysis Mathematica ( IF 0.7 ) Pub Date : 2019-12-01 , DOI: 10.1007/s10476-019-0002-5
M. Ghaderi Aghideh , M. S. Moslehian , J. Rooin

In this paper, we present several sharp upper bounds for the numerical radii of the diagonal and off-diagonal parts of the $2\times2$ block operator matrix $\begin{bmatrix}A&B\\ C&D\end{bmatrix}$. Among extensions of some results of Kittaneh et al., it is shown that if $T=\begin{bmatrix}A&0\\ 0&D\end{bmatrix}$, and $f$ and $g$ are non-negative continuous functions on $[0,\infty)$ such that $f(t)g(t)=t\,\,(t\geq 0)$, then for all nonnegative nondecreasing convex functions $h$ on $[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>1$ with $\frac{1}{p}+\frac{1}{q}=1$ and $r\min(p,q)\geq 2$.

中文翻译:

块算子矩阵的数值半径的尖锐不等式

在本文中,我们提出了 $2\times2$ 块算子矩阵 $\begin{bmatrix}A&B\\C&D\end{bmatrix}$ 的对角线和非对角线部分的数值半径的几个尖锐的上限。在 Kittaneh 等人的一些结果的扩展中,表明如果 $T=\begin{bmatrix}A&0\\ 0&D\end{bmatrix}$,并且 $f$ 和 $g$ 是非负连续函数$[0,\infty)$ 使得 $f(t)g(t)=t\,\,(t\geq 0)$,然后对于 $[0,\infty 上的所有非负非递减凸函数 $h$ )$ ,我们得到 \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*} 其中 $p, q>
更新日期:2019-12-01
down
wechat
bug