Related papers: On different definitions of numerical range
A presentation of numerical range for rectangular matrices is undertaken in this paper, introducing two different definitions and elaborating basic properties. Then we are extended to the treatment of rank-k numerical range.
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
Kippenhahn discovered that the numerical range of a complex square matrix is the convex hull of a plane real algebraic curve. Here, we present an example of a convex set, which has a similar algebraic description as the numerical range,…
In this paper we introduce an enclosure of the numerical range of a class of rational operator functions. In contrast to the numerical range the presented enclosure can be computed exactly in the infinite dimensional case as well as in the…
In this note we introduce the concept of the numerical range of a bounded linear operator with respect to a family of projections. We give a precise definition and elaborate on its connection to the classical numerical range as well as to…
The boundary of a numerical range of a finite matrix is always a nice curve (algebraic, closed and simple), but the equation it satisfies is often very complicated. We will show that, furthermore, there is no hope of describing these curves…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
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…
Kippenhahn's Theorem asserts that the numerical range of a matrix is the convex hull of a certain algebraic curve. Here, we show that the joint numerical range of finitely many Hermitian matrices is similarly the convex hull of a…
Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…
We study the harmonic mean of non-zero complex-valued random variables (complex harmonic mean) and establish several geometric estimates and bounds. In contrast to the classical positive-valued case, complex harmonic means may lie outside…
We study containment regions of the numerical range of the product of operators $A$ and $B$ such that $W(A)$ and $W(B)$ are line segments. It is shown that the containment region is equal to the convex hull of elliptical disks determined by…
A novel algorithm for the computation of the quadratic numerical range is presented and exemplified yielding much better results in less time compared to the random vector sampling method. Furthermore, a bound on the probability for the…
Analysis and processing of data is a vital part of our modern society and requires vast amounts of computational resources. To reduce the computational burden, compressing and approximating data has become a central topic. We consider the…
Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
A sufficient condition for $\bar{\partial}$ to have closed range is given for pseudoconvex, possibly unbounded domains in $\mathbb{C}^n$.
The intrinsic volumes are measures of the content of a convex body. This paper uses probabilistic and information-theoretic methods to study the sequence of intrinsic volumes of a convex body. The main result states that the intrinsic…
We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the…