Related papers: Eigenvalue placement for regular matrix pencils wi…

Let A and E be Hermitian self-adjoint matrices, where A is fixed and E a small perturbation. We study how the eigenvalues and eigenvectors of A+E depend on E, with the aim of obtaining first order formulas (and when possible also second…

This paper is devoted to a dispersion analysis of a class of perturbed p-Laplacians. Besides the p-Laplacian-like eigenvalue problems we also deal with new and non-standard eigenvalue problems, which can not be solved by the methods used in…

Loewner matrix pencils play a central role in the system realization theory of Mayo and Antoulas, an important development in data-driven modeling. The eigenvalues of these pencils reveal system poles. How robust are the poles recovered via…

Spectral properties of Toeplitz operators and their finite truncations have long been central in operator theory. In the finite dimensional, non-normal setting, the spectrum is notoriously unstable under perturbations. Random perturbations…

It is known (see e.g. [2], [4], [5], [6]) that continuous variations in the entries of a complex square matrix induce continuous variations in its eigenvalues. If such a variation arises from one real parameter $\alpha \in [0, 1]$, then the…

Invariant subspaces of a matrix $A$ are considered which are obtained by truncation of a Jordan basis of a generalized eigenspace of $A$. We characterize those subspaces which are independent of the choice of the Jordan basis. An…

In a recent work Killip and Nenciu gave random recurrences for the characteristic polynomials of certain unitary and real orthogonal upper Hessenberg matrices. The corresponding eigenvalue p.d.f.'s are beta-generalizations of the classical…

Training of neural networks can be reformulated in spectral space, by allowing eigenvalues and eigenvectors of the network to act as target of the optimization instead of the individual weights. Working in this setting, we show that the…

Dual complex matrices have found applications in brain science. There are two different definitions of the dual complex number multiplication. One is noncommutative. Another is commutative. In this paper, we use the commutative definition.…

The matrix pencil (A,B) = {tB-A | t \in C} is considered under the assumptions that A is entrywise nonnegative and B-A is a nonsingular M-matrix. As t varies in [0,1], the Z-matrices tB-A are partitioned into the sets L_s introduced by…

We study completely reducible fibers of pencils of hypersurfaces on $\mathbb P^n$ and associated codimension one foliations of $\mathbb P^n$. Using methods from theory of foliations we obtain certain upper bounds for the number of these…

Consider a given square matrix $\textrm {K}$ with square blocks $A_{11},A_{22},\ldots,A_{nn}$ on the main diagonal. This paper aims to compute an optimal perturbation $\Delta$ of a preassigned block $A_{ii}\in\mathbb{C}^{d_i\times d_k},…

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…

We characterize the eigenvalues and eigenvectors of a class of complex valued tridiagonal $n$ by $n$ matrices subject to arbitrary boundary conditions, i.e. with arbitrary elements on the first and last rows of the matrix. %By boundary…

Euclidean random matrices arise in a wide range of physical systems where interactions are determined by spatial configurations, including disordered media and cooperative phenomena in atomic ensembles. Unlike classical random matrix…

We consider initial value problems for differential-algebraic equations in a possibly infinite-dimensional Hilbert space. Assuming a growth condition for the associated operator pencil, we prove existence and uniqueness of solutions for…

Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with…

Computing the eigenvectors and eigenvalues of a perturbed matrix can be remarkably difficult when the unperturbed matrix has repeated eigenvalues. In this work we show how the limiting eigenvectors and eigenvalues of a symmetric matrix…

A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…

We calculate the probability to find exactly $n$ eigenvalues in a spectral interval of a large random $N \times N$ matrix when this interval contains $s \ll N$ eigenvalues on average. The calculations exploit an analogy to the problem of…