Related papers: Eigenvalue placement for regular matrix pencils wi…
Eigenvalue and eigenpair backward errors are computed for matrix pencils arising in optimal control. In particular, formulas for backward errors are developed that are obtained under block-structure-preserving and…
Eigensolvers involving complex moments can determine all the eigenvalues in a given region in the complex plane and the corresponding eigenvectors of a regular linear matrix pencil. The complex moment acts as a filter for extracting…
Under the action of the general linear group with tensor structure, the ranks of matrices $A$ and $B$ forming an $m \times n$ pencil $A + \lambda B$ can change, but in a restricted manner. Specifically, with every pencil one can associate a…
A new approach to solving eigenvalue optimization problems for large structured matrices is proposed and studied. The class of optimization problems considered is related to computing structured pseudospectra and their extremal points, and…
This book is about solving matrix nearness problems that are related to eigenvalues or singular values or pseudospectra. These problems arise in great diversity in various fields, be they related to dynamics, as in questions of robust…
Let $k$ be a field and $n,a,b$ natural numbers. A matrix pencil $P$ is given by $n$ matrices of the same size with coefficients in $k$, say by $(b\times a)$-matrices, or, equivalently, by $n$ linear transformations $\alpha_i\:k^a \to k^b$…
The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…
Complete eigenstructure, e.g., eigenvalues with multiplicities and minimal indices, of a skew-symmetric matrix pencil may change drastically if the matrix coefficients of the pencil are subjected to (even small) perturbations. These changes…
This paper presents a definition for local linearizations of rational matrices and studies their properties. This definition allows us to introduce matrix pencils associated to a rational matrix that preserve its structure of zeros and…
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…
We study the eigenvalue distribution of a large Jordan block subject to a small random Gaussian perturbation. A result by E.B. Davies and M. Hager shows that as the dimension of the matrix gets large, with probability close to $1$, most of…
The stated paper is dedicated to one of the inverse problems of spectral theory. It is necessary to define matrix (constant) coefficients of some quadratic pencil, if the eigenvalues of this pencil are known. Furthermore, it is known that…
A number of random matrix ensembles permitting exact determination of their eigenvalue and eigenvector statistics maintain this property under a rank $1$ perturbation. Considered in this review are the additive rank $1$ perturbation of the…
A popular method for solving large sparse regular eigenvalue problem is the shift-and-invert Arnoldi method. This paper aims to use the method for large sparse singular pencils. In three recent papers, {\em Hochstenbach, Mehl, and…
A conjecture from a paper by J. Bierkens and A.C.M. Ran concerning the location of eigenvalues of rank one perturbations of singular M-matrices is shown to be false in dimension four and higher, but true for dimension two, as well as for…
This paper is a didactic commentary (a transcription with variations) to the paper of S.R. Foguel {\it Finite Dimensional Perturbations in Banach Spaces}. Addressed, mainly: postgraduates and related readers. Subject: Suppose we have two…
The eigenproblem of low-rank updated matrices are of crucial importance in many applications. Recently, an upper bound on the number of distinct eigenvalues of a perturbed matrix was established. The result can be applied to estimate the…
We consider a quadratic operator pencil with a small periodic perturbation multiplied by the spectral parameter. It is motivated, in particular, by a one-dimensional Klein-Gordon equation with a time-parity-symmetric perturbation. We study…
We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…
Several recent methods used to analyze asymptotic stability of delay-differential equations (DDEs) involve determining the eigenvalues of a matrix, a matrix pencil or a matrix polynomial constructed by Kronecker products. Despite some…