Related papers: The eigenvector variety of a matrix pencil

The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to…

In this paper we define the combinatorial analogous of a pencil, and show its relationship with the concept of admissibility. Such an object is usefull to study the isomorphisms between fundamental groups of the complements of line…

The eigenvalue problem plays a central role in linear algebra and its applications in control and optimization methods. In particular, many matrix decompositions rely upon computation of eigenvalue-eigenvector pairs, such as diagonal or…

In this paper we study the inverse spectral problem for Jacobi-type pencils. By a Jacobi-type pencil we mean the following pencil $J_5 - \lambda J_3$, where $J_3$ is a Jacobi matrix and $J_5$ is a semi-infinite real symmetric five-diagonal…

Efficiency, the basic concept of multi-objective optimization is investigated for the class of pairwise comparison matrices. A weight vector is called efficient if no alternative weight vector exists such that every pairwise ratio of the…

We solve the problem of determining the Weierstrass structure of a regular matrix pencil obtained by a low rank perturbation of another regular matrix pencil. We apply the result to find necessary and sufficient conditions for the existence…

A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…

We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…

We give a geometric approach to the relation between the irreducible components of the characteristic varieties of local systems on a plane curve arrangement complement and the associated pencils of plane curves discovered recently by M.…

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…

For each square complex matrix, V. I. Arnold constructed a normal form with the minimal number of parameters to which a family of all matrices B that are close enough to this matrix can be reduced by similarity transformations that smoothly…

The dimensions of sets of matrices of various types, with specified eigenvalue multiplicities, are determined. The dimensions of the sets of matrices with given Jordan form and with given singular value multiplicities are also found. Each…

We study the angles between the eigenvectors of a random $n\times n$ complex matrix $M$ with density $\propto \mathrm{e}^{-n\operatorname{Tr}V(M^*M)}$ and $x\mapsto V(x^2)$ convex. We prove that for unit eigenvectors…

We consider the eigenvalues and eigenvectors of matrices of the form M + P, where M is an n by n Wigner random matrix and P is an arbitrary n by n deterministic matrix with low rank. In general, we show that none of the eigenvalues of M + P…

The current general form of the well-known Eigenvalue Interlacing Theorem states that, given an $N \times N$ Hermitian matrix $P$, the eigenvalues of the matrix product $Q^{H} P Q$ will interlace those of $P$ if the columns of the $N \times…

This paper describes a set of rational filtering algorithms to compute a few eigenvalues (and associated eigenvectors) of non-Hermitian matrix pencils. Our interest lies in computing eigenvalues located inside a given disk, and the proposed…

Let $x_1, \dots, x_n$ be points in a metric space and define the distance matrix $D \in \mathbb{R}^{n \times n}$ by ${D}_{ij} = d(x_i, x_j)$. The Perron-Frobenius Theorem implies that there is an eigenvector $v \in \mathbb{R}^n_{}$ with…

It is known that a unitary matrix can be decomposed into a product of reflections, one for each dimension, and the Haar measure on the unitary group pushes forward to independent uniform measures on the reflections. We consider the sequence…

We introduce an eigenvalue-preserving transformation algorithm from the generalized eigenvalue problem by matrix pencil of the upper and the lower bidiagonal matrices into a standard eigenvalue problem while preserving sparsity, using the…

We identify a class of operator pencils, arising in a number of applications, which have only real eigenvalues. In the one-dimensional case we prove a novel version of the Sturm oscillation theorem: if the dependence on the eigenvalue…