Related papers: Characterization of half-radial matrices
Solutions to optimization problems involving the numerical radius often belong to a special class: the set of matrices having field of values a disk centered at the origin. After illustrating this phenomenon with some examples, we…
For a square matrix, the range of its Rayleigh quotients is known as the numerical range, which is a compact and convex set by the Toeplitz-Hausdorff theorem. The largest value and the smallest boundary value (in magnitude) of this convex…
For a given bounded positive (semidefinite) linear operator $A$ on a complex Hilbert space $\big(\mathcal{H}, \langle \cdot\mid \cdot\rangle \big)$, we consider the semi-Hilbertian space $\big(\mathcal{H}, \langle \cdot\mid \cdot\rangle_A…
We develop upper and lower bounds for the numerical radius of $2\times 2$ off-diagonal operator matrices, which generalize and improve on the existing ones. We also show that if $A$ is a bounded linear operator on a complex Hilbert space…
Denote by $w(T)$ the numerical radius of a matrix $T$. An elementary proof is given to the fact that $w(AB) \leq w(A)w(B)$ for a pair of commuting matrices of order two, and characterization is given for the matrix pairs that attain the…
Let $\mathbb{A}=\left( \begin{array}{cc} A & 0 \\ 0 & A \\ \end{array} \right)$ be the $2\times2$ diagonal operator matrix determined by a positive bounded operator $A$. For semi-Hilbertian operators $X$ and $Y$, we first show that…
We provide numerical bounds on the Crouzeix ratiofor KLS matrices $A$ which have a line segment on the boundary of the numerical range. The Crouzeix ratio is the supremum over all polynomials $p$ of the spectral norm of $p(A)$ dividedby the…
We present sharp lower bounds for the A-numerical radius of semi-Hilbertian space operators. We also present an upper bound. Further we compute new upper bounds for the $B$-numerical radius of $2 \times 2$ operator matrices where $B =…
The numerical radius of a matrix is a scalar quantity that has many applications in the study of matrix analysis. Due to the difficulty in computing the numerical radius, inequalities bounding it have received a considerable attention in…
We prove explicit bounds on the radius of a ball centered at the origin which is guaranteed to contain all bounded connected components of a semi-algebraic set $S \subset \mathbbm{R}^k$ defined by a quantifier-free formula involving $s$…
The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible application strength this measure is still far from being…
The lower spectral radius of a set of $d \times d$ matrices is defined to be the minimum possible exponential growth rate of long products of matrices drawn from that set. When considered as a function of a finite set of matrices of fixed…
We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…
Optimal matrices for problems involving the matrix numerical radius often have fields of values that are disks, a phenomenon associated with partial smoothness. Such matrices are highly structured: we experiment in particular with the…
Suppose $A=[a_{ij}]\in \mathcal{M}_n(\mathbb{C})$ is a complex $n \times n$ matrix and $B\in \mathcal{B}(\mathcal{H})$ is a bounded linear operator on a complex Hilbert space $\mathcal{H}$. We show that $w(A\otimes B)\leq w(C),$ where…
A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…
It is well known that a spherically symmetric compact star whose energy density decreases monotonically possesses an upper bound on its mass-to-radius ratio, $2M/R\leq 8/9$. However, field configurations typically will not be compact. Here…
We obtain several upper and lower bounds for the numerical radius of sectorial matrices. We also develop several numerical radius inequalities of the sum, product and commutator of sectorial matrices. The inequalities obtained here are…
A graph is called radially maximal if it is not complete and the addition of any new edge decreases its radius. In 1976 Harary and Thomassen proved that the radius $r$ and diameter $d$ of any radially maximal graph satisfy $r\le d\le 2r-2.$…
Let $A$ be a bounded linear operator on a complex Hilbert space and $\Re(A)$ ( $\Im(A)$ ) denote the real part (imaginary part) of A. Among other refinements of the lower bounds for the numerical radius of $A$, we prove that…