相关论文: Numerical range and positive block matrices

We prove some eigenvalue inequalities for positive semidefinite matrices partitioned into four blocks. The inradius of the numerical range of the off-diagonal block contributes to these estimates. Some related norm inequalities are given…

We bring in some new notions associated with $2\times 2$ block positive semidefinite matrices. These notions concern the inequalities between the singular values of the off diagonal blocks and the eigenvalues of the arithmetic mean or…

This article has two interpenetrating motifs. One is an exposition of some major ideas and techniques behind the use of block matrices, and especially their positivity properties. This is done by focussing on one major problem:…

Estimation of top singular values is one of the widely used techniques and one of the intensively researched problems in Numerical Linear Algebra and Data Science. We consider here two general questions related to this problem: How top…

We show how positive unital linear maps can be used to obtain lower bounds for the maximum distance between the eigenvalues of two normal matrices. Some related bounds for the spread and condition number of Hermitian matrices are also…

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 analyze the joint numerical range $W$ of three hermitian matrices of order four. In the generic case, this three-dimensional convex set has a smooth boundary. We analyze non-generic structures. Fifteen possible classes regarding the…

Every sufficiently big matrix with small spectral norm has a nearby low-rank matrix if the distance is measured in the maximum norm (Udell & Townsend, SIAM J Math Data Sci, 2019). We use the Hanson--Wright inequality to improve the estimate…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

Distance matrices are matrices whose elements are the relative distances between points located on a certain manifold. In all cases considered here all their eigenvalues except one are non-positive. When the points are uncorrelated and…

In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…

We give upper and lower bounds for the spectral radius of a nonnegative matrix by using its average 2-row sums, and characterize the equality cases if the matrix is irreducible. We also apply these bounds to various nonnegative matrices…

We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…

Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…

Which convex subsets of the complex plane are the numerical range W(A of some matrix A? This paper gives a precise characterization of these sets. In addition to this we show that for any A there exists a symmetric matrix B of the same size…

For a positive semidefinite matrix $H= \begin{bmatrix} A&X\\ X^{*}&B \end{bmatrix} $, we consider the norm inequality $ ||H||\leq ||A+B|| $. We show that this inequality holds under certain conditions. Some related topics are also…

We estimate the size of the spectral gap at zero for some Hermitian block matrices. Included are quasi-definite matrices, quasi-semidefinite matrices (the closure of the set of the quasi-definite matrices) and some related block matrices…

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 &…

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

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…