Related papers: Matrix pencils with the numerical range equal to t…
We study the asymptotic distribution of level crossings for random matrix pencils A_n+\lambda B_n in several ensembles, including complex and real i.i.d. matrices and Gaussian/Hermitian settings. We derive a representation of the normalized…
Consider a multivariable state space system and associated transfer function G({\lambda}). The aim of this paper is to define and analyze two vector spaces of matrix pencils associated with the matrix G({\lambda}) and show that almost all…
Bundles of matrix polynomials are sets of matrix polynomials with the same size and grade and the same eigenstructure up to the specific values of the eigenvalues. It is known that the closure of the bundle of a pencil $L$ (namely, a matrix…
Developed in 1999 by Akemann, Anderson, and Weaver, the spectral scale of an $n\times n$ matrix $A$, is a convex, compact subset of $\mathbb{R}^3$ that reveals important spectral information about $A$ \cite{AAW}. In this paper we present…
The multiparameter matrix pencil problem (MPP) is a generalization of the one-parameter MPP: given a set of $m\times n$ complex matrices $A_0,\ldots, A_r$, with $m\ge n+r-1$, it is required to find all complex scalars…
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,…
We study the relation between the intrinsic and the spatial numerical ranges with the recently introduced "approximated" spatial numerical range. As main result, we show that the intrinsic numerical range always coincides with the convex…
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…
The seminal work by Mackey et al. in 2006 (reference [21] of the article) introduced vector spaces of matrix pencils, with the property that almost all the pencils in the spaces are strong linearizations of a given square regular matrix…
Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…
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 show that the set of $n \times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some, explicitly described, complete eigenstructures. As a…
In this paper, we analyze problems involving matrix variables for which we use a noncommutative algebra setting. To be more specific, we use a class of functions (called NC analytic functions) defined by power series in noncommuting…
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…
Our main result states that whenever we have a non-Euclidean norm $\|\cdot\|$ on a two-dimensional vector space $X$, there exists some $x\neq 0$ such that for every $\lambda\neq 1, \lambda>0$, there exist $y, z\in X$ verifying that…
Let $A$ and $B$ be complex unital Banach algebras, and let $\varphi, \psi: A \to B$ be surjective mappings. If $A$ is semisimple with an essential socle and $\varphi$ and $\psi$ preserves the invertibility of linear pencils in both…
We study pencils of plane cubics with only one base point and general member smooth, giving a complete classification. Under the additional hypothesis that all members are irreducible, we prove that there exists a unique non-isotrivial…
In this paper we study various difference equations related to Jacobi-type pencils. By a Jacobi-type pencil one means the following pencil: $J_5 - \lambda J_3$, where $J_3$ is a Jacobi matrix and $J_5$ is a semi-infinite real symmetric…
Semidefinite programming optimises a linear objective function over a spectrahedron, and is one of the major advances of mathematical optimisation. Spectrahedra are described by linear pencils, which are linear matrix polynomials with…
The higher rank numerical range is closely connected to the construction of quantum error correction code for a noisy quantum channel. It is known that if a normal matrix $A \in M_n$ has eigenvalues $a_1, \..., a_n$, then its higher rank…