Related papers: Quaternionic numerical range of complex matrices
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…
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…
In this article, we are going to search for $n\times n$ matrices $A$ and $B$ such that their generalized numerical range $$W_A(B)=\{tr(AU^*BU) \ :\ U^*U=UU^*=I\}$$ is convex. More specifically, we consider $A=\hat{A}\oplus I_k$ and…
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,…
We define a new numerical range of an n\timesn complex matrix in terms of correlation matrices and develop some of its properties. We also define a related numerical range that arises from Alain Connes' famous embedding problem.
A complete description of 4-by-4 matrices $\begin{bmatrix}\alpha I & C \\D & \beta I\end{bmatrix}$, with scalar 2-by-2 diagonal blocks, for which the numerical range is the convex hull of two non-concentric ellipses is given. This result is…
We consider higher-rank versions of the standard numerical range for matrices. A central motivation for this investigation comes from quantum error correction. We develop the basic structure theory for the higher-rank numerical ranges, and…
We find in our quaternionic version of the electroweak theory an apparently hopeless problem: In going from complex to quaternions, the calculation of the real-valued parameters of the CKM matrix drastically changes. We aim to explain this…
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…
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…
This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…
Criterion for a companion matrix to have a certain number of flat portions on the boundary of its numerical range is given. The criterion is specialized to the cases of 3-by-3 and 4-by-4 matrices. In the latter case, it is proved that a…
We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…
The numerical radius of the general $2\times2$ complex matrix is calculated.
We present an explicit formula for the expected value of a product of several independent symplectically invariant matrices in which the trace and real part function may be applied, possibly to different subexpressions. This takes the form…
This is a complete classification of the complex forms of quaternionic symmetric spaces
The connection between the commutativity of a family of $n\times n$ matrices and the generalized joint numerical ranges is studied. For instance, it is shown that ${\cal F}$ is a family of mutually commuting normal matrices if and only if…
The range of a trigonometric polynomial with complex coefficients can be interpreted as the image of the unit circle under a Laurent polynomial. We show that this range is contained in a real algebraic subset of the complex plane. Although…
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),…