Related papers: Reduction and Normal Forms of Matrix Pencils
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 study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of matrices. We provide a complete…
We analyze when an arbitrary matrix pencil is equivalent to a dissipative Hamiltonian pencil and show that this heavily restricts the spectral properties. In order to relax the spectral properties, we introduce matrix pencils with…
It is well known that the generalized (or quotient) singular values of a matrix pair $(A, C)$ can be obtained from the generalized eigenvalues of a matrix pencil consisting of two augmented matrices. The downside of this reformulation is…
Versal deformation of a matrix A is a normal form to which all matrices A + E, close to A, can be reduced by similarity transformation smoothly depending on the entries of A + E. In this paper we discuss versal deformations and their use in…
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…
We study problems associated with an operator pencil, i.e., a pair of operators on Banach spaces. Two natural problems to consider are linear constrained differential equations and the description of the generalized spectrum. The main tool…
An invertible matrix is called a Perron similarity if one of its columns and the corresponding row of its inverse are both nonnegative or both nonpositive. Such matrices are of relevance and import in the study of the nonnegative inverse…
Call two pairs $(M,N)$ and $(M',N')$ of $m\times n$ matrices over a field $K$, \emph{simultaneously K-equivalent} if there exist square invertible matrices $S,T$ over K, with $M'=SMT$ and $N'=SNT$. Kronecker \cite{Kronecker} has given a…
We introduce a definition of strong hyperbolicity for second order partial differential equations using second order pencils. We show that this definition is equivalent to the standard one, derived by reducing the equations to first order…
Our purpose is to give new proofs of several known results about perturbations of matrix pencils. Andrzej Pokrzywa (1986) described the closure of orbit of a Kronecker canonical pencil $A-\lambda B$ in terms of inequalities with pencil…
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…
In our earlier posting "Matrix Pencils and Entanglement Classification", arXiv:0911.1803, we gave a polynomial-time algorithm for deciding if two states in a space of dimension $2\otimes m\otimes n$ are SLOCC equivalent. In this note, we…
In this paper we show how to construct diagonal scalings for arbitrary matrix pencils $\lambda B-A$, in which both $A$ and $B$ are complex matrices (square or nonsquare). The goal of such diagonal scalings is to "balance" in some sense 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…
The complete characterization of the Kronecker structure of a matrix pencil perturbed by another pencil of rank one is known, and it is stated in terms of very involved conditions. This paper is devoted to, loosing accuracy, better…
Many applications give rise to structured matrix polynomials. The problem of constructing structure-preserving strong linearizations of structured matrix polynomials is revisited in this work and in the forthcoming ones…
Over the real numbers, the Kronecker sum is the unique operation on matrices which exponentiates to the Kronecker product. Kronecker quotients provide an algebraic view of decompositions of matrices in terms of Kronecker products. This…
P. Van Dooren (1979) constructed an algorithm for computing all singular summands of Kronecker's canonical form of a matrix pencil. His algorithm uses only unitary transformations, which improves its numerical stability. We extend Van…
Paul Van Dooren [Linear Algebra Appl. 27 (1979) 103-140] constructed an algorithm for the computation of all irregular summands in Kronecker's canonical form of a matrix pencil. The algorithm is numerically stable since it uses only unitary…