Related papers: Numerical Radius of Non-Hermitian Random Matrices
New inequalities for the numerical radius of bounded linear operators defined on a complex Hilbert space $\mathcal{H}$ are given. In particular, it is established that if $T$ is a bounded linear operator on a Hilbert space $\mathcal{H}$…
We consider m independent random rectangular matrices whose entries are independent and identically distributed standard complex Gaussian random variables. Assume the product of the m rectangular matrices is an n by n square matrix. The…
In this article, we obtain several new weighted bounds for the numerical radius of a Hilbert space operator. The significance of the obtained results is the way they generalize many existing results in the literature; where certain values…
We study operators acting on a tensor product Hilbert space and investigate their product numerical range, product numerical radius and separable numerical range. Concrete bounds for the product numerical range for Hermitian operators are…
The main two algorithms for computing the numerical radius are the level-set method of Mengi and Overton and the cutting-plane method of Uhlig. Via new analyses, we explain why the cutting-plane approach is sometimes much faster or much…
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…
A family of random matrix ensembles interpolating between the GUE and the Ginibre ensemble of $n\times n$ matrices with iid centered complex Gaussian entries is considered. The asymptotic spectral distribution in these models is uniform in…
In this article, firstly, some simple and smoothness properties of the weighted numerical radius and the weighted Crawford number functions are investigated. Then, some generalization formulas for lower and upper bounds of the weighted…
We study the asymptotic distribution of the eigenvalues of random Hermitian periodic band matrices, focusing on the spectral edges. The eigenvalues close to the edges converge in distribution to the Airy point process if (and only if) the…
We consider the problem of computing the closest stable/unstable non-negative matrix to a given real matrix. This problem is important in the study of linear dynamical systems, numerical methods, etc. The distance between matrices is…
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…
To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…
For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…
We generalise the Elliptical Range Theorem to characterise the numerical range of matrices belonging to a subspace of the space of \(3 \times 3\) matrices. Using Specht's Theorem, which characterizes when two matrices are unitarily…
An elliptic random matrix $X$ is a square matrix whose $(i,j)$-entry $X_{ij}$ is independent of the rest of the entries except possibly $X_{ji}$. Elliptic random matrices generalize Wigner matrices and non-Hermitian random matrices with…
We obtain a sufficient condition for the convexity of quaternionic numerical range for complex matrices in terms of its complex numerical range. It is also shown that the Bild coincides with complex numerical range for real matrices. From…
The numerical range in the quaternionic setting is, in general, a non convex subset of the quaternions. The essential numerical range is a refinement of the numerical range that only keeps the elements that have, in a certain sense,…
In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B.…
The rotational constant parametrizes the relative spacing between a molecule's rotational energy levels. It depends on the molecule's classical moments of inertia, which, in all studies, are expressed by treating the constituent nuclei as…
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…