Related papers: Kippenhahn's construction revisited
Kippenhahn discovered a real algebraic plane curve whose convex hull is the numerical range of a matrix. The correctness of this theorem was called into question when Chien and Nakazato found an example where the spatial analogue fails.…
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…
The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex…
The elliptical range theorem asserts that the field of values (or numerical range) of a two-by-two matrix with complex entries is an elliptical disk, the foci of which are the eigenvalues of the given matrix. Many proofs of this result are…
The higher rank numerical ranges of generic matrices are described in terms of the components of their Kippenhahn curves. Cases of tridiagonal (in particular, reciprocal) 2-periodic matrices are treated in more detail.
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…
We present a novel technical method for analyzing the hidden convex structure embedded in the joint range of a quadratic mapping defined on a Hilbert space. Our approach stands out by relying exclusively on elementary mathematical…
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…
Tridiagonal matrices with constant main diagonal and reciprocal pairs of off-diagonal entries are considered. Conditions for such matrices with sizes up to 6-by-6 to have elliptical numerical ranges are obtained.
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…
This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
The higher rank numerical range is a concept that generalizes the classical numerical range, and it has application in quantum error correction. We investigate these sets for $2$-by-$2$ block matrices with associated Kippenhahn curves…
Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…
In this paper we prove a conjecture stated by the first two authors establishing the closure of the numerical range of a certain class of $n+1$-periodic tridiagonal operators as the convex hull of the numerical ranges of two tridiagonal…
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,…
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…
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),…
We present a characterization, in terms of projective biduality, for the hypersurfaces appearing in the boundary of the convex hull of a compact real algebraic variety.