Related papers: Numerical radii of accretive matrices
In distributed optimization or Nash-equilibrium seeking over directed graphs, it is crucial to find a matrix norm under which the disagreement of individual agents' states contracts. In existing results, the matrix norm is usually defined…
We analyze the numerical range of high-dimensional random matrices, obtaining limit results and corresponding quantitative estimates in the non-limit case. For a large class of random matrices their numerical range is shown to converge to a…
Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…
In this paper, several significant upper bounds for the numerical radius and $a$-numerical radius of an element in a $\mathcal{C}^*$-algebra are obtained using Orlicz functions. Many well-known results are obtained from our findings,…
The paper explores further the computation of the quaternionic numerical range of a complex matrix. We prove a modified version of a conjecture by So and Tompson. Specifically, we show that the shape of the quaternionic numerical range for…
This study presents new upper bounds for the numerical radii of operator matrices, with a focus on $n \times n$ and $2 \times 2$ block matrices acting on Hilbert space direct sums. By employing techniques such as the H\"older-McCarthy…
In the field of radial basis functions mathematicians have been endeavouring to find infinitely differentiable and compactly supported radial functions. This kind of functions is extremely important. One of the reasons is that its error…
We give tight upper bounds on the numerical range of square matrices in terms of their Frobenius (Euclidian) norm and a combinatorial parameter similar to the clique number of graphs. Our results imply a concise form of the fundamental…
Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…
In this paper, we show several bounds for the numerical radius of a Hilbert space operator in terms of the Euclidean operator norm. The obtained forms will enable us to find interesting refinements of celebrated results in the literature.…
In this work, a pre-Gr\"{u}ss inequality for positive Hilbert space operators is proved. So that, some numerical radius inequalities are proved. On the other hand, based on a non-commutative Binomial formula, a non-commutative upper bound…
In this article, we establish an improvement of the Cauchy-Schwarz inequality. Let $x, y \in \mathcal{H},$ and let $f: (0,1) \rightarrow \mathbb{R}^+$ be a well-defined function, where $\mathbb{R}^+$ denote the set of all positive real…
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…
The vast use of computers on scientific numerical computation makes the awareness of the limited precision that these machines are able to provide us an essential matter. A limited and insufficient precision allied to the truncation and…
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 a recent work of the authors, we showed some general inequalities governing numerical radius inequalities using convex functions. In this article, we present results that complement the aforementioned inequalities. In particular, the new…
In this paper, we generalize the notion of the $C$-numerical range of a matrix to operators in arbitrary tracial von Neumann algebras. For each self-adjoint operator $C$, the $C$-numerical range of such an operator is defined; it is a…
This paper establishes new upper bounds for the $A$-numerical radius of operator matrices in semi-Hilbertian spaces by leveraging the $A$-Buzano inequality and developing refined techniques for operator matrices. We present several sharp…
In this paper, the $q$-numerical radius of operators in semi-Hilbertian spaces is studied. New characterizations are established, and sharp upper and lower bounds for the $q$-numerical radius are derived. Moreover, several inequalities…
Several new verifiable conditions are established for block matrices with scalar diagonal blocks to have the numerical range equal the convex hull of at most k ellipses where k by k is the size of the smaller diagonal block. For k = 2,…