Related papers: The eigenvector variety of a matrix pencil
The diagonalization of matrices may be the top priority in the application of modern physics. In this paper, we numerically demonstrate that, for real symmetric random matrices with non-positive off-diagonal elements, a universal scaling…
Given two positive integers $n$ and $k$ and a parameter $t\in (0,1)$, we choose at random a vector subspace $V_{n}\subset \mathbb{C}^{k}\otimes\mathbb{C}^{n}$ of dimension $N\sim tnk$. We show that the set of $k$-tuples of singular values…
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 nonnegative inverse eigenvalue problem (NIEP) asks which lists of $n$ complex numbers (counting multiplicity) occur as the eigenvalues of some $n$-by-$n$ entry-wise nonnegative matrix. The NIEP has a long history and is a known hard…
The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the…
We explore the relation between the positive dimensional irreducible components of the characteristic varieties of rank one local systems on a smooth surface and the associated (rational or irrational) pencils. Our study, which may viewed…
The eigenvalues of a matrix polynomial can be determined classically by solving a generalized eigenproblem for a linearized matrix pencil, for instance by writing the matrix polynomial in companion form. We introduce a general scaling…
Translated into the language of representations of quivers, a challenge in matrix pencil theory is to find sufficient and necessary conditions for a Kronecker representation to be a subfactor of another Kronecker representation in terms of…
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…
In Parts I and II of this series of papers, three new methods for the computation of eigenvalues of singular pencils were developed: rank-completing perturbations, rank-projections, and augmentation. It was observed that a straightforward…
We prove that, given two matrix pencils $L$ and $M$, if $M$ belongs to the closure of the orbit of $L$ under strict equivalence, then the dimension of the orbit of $M$ is smaller than or equal to the dimension of the orbit of $L$, and the…
Nonlinear eigenvalue problems with eigenvector nonlinearities (NEPv) are algebraic eigenvalue problems whose matrix depends on the eigenvector. Applications range from computational quantum mechanics to machine learning. Due to its…
This paper deals with holomorphic self-maps of the complex projective plane and the algebraic relations among the eigenvalues of the derivatives at the fixed points. These eigenvalues are constrained by certain index theorems such as the…
Eigenvectors associated with non-degenerate eigenvalues are shown to correspond to columns of the adjugate of the characteristic matrix. Degenerate eigenvalues are associated with eigenvectors that correspond to reduced complement tensors…
A real vector space combined with an inverse for vectors is sufficient to define a vector continued fraction whose parameters consist of vector shifts and changes of scale. The choice of sign for different components of the vector inverse…
We introduce a new random matrix model called distance covariance matrix in this paper, whose normalized trace is equivalent to the distance covariance. We first derive a deterministic limit for the eigenvalue distribution of the distance…
We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $AA^{\top}$, where $A$ is a special incidence matrix; This matrix can equivalently be defined based on a match relation between some…
We give a method for constructing a regularizing decomposition of a matrix pencil, which is formulated in terms of the linear mappings. We prove that two pencils are topologically equivalent if and only if their regularizing decompositions…
The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are…