相关论文: On a new kind of Ansatz Spaces for Matrix Polynomi…

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…

The seminal work by Mackey et al. in 2006 (reference [21] of the article) introduced vector spaces of matrix pencils, with the property that almost all the pencils in the spaces are strong linearizations of a given square regular matrix…

Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…

We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kronecker pencils"---and perform a backward stability analysis of complete polynomial eigenproblems. These problems are solved by applying any…

The standard way of solving the polynomial eigenvalue problem associated with a matrix polynomial is to embed the matrix polynomial into a matrix pencil, transforming the problem into an equivalent generalized eigenvalue problem. Such…

We revisit the landmark paper [D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann, SIAM J. Matrix Anal. Appl., 28 (2006), pp.~971--1004] and, by viewing matrices as coefficients for bivariate polynomials, we provide concise proofs for key…

We introduce a new class of structured matrix polynomials, namely, the class of M_A-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the…

The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…

In the last decade, there has been a continued effort to produce families of strong linearizations of a matrix polynomial $P(\lambda)$, regular and singular, with good properties. As a consequence of this research, families such as the…

Bundles of matrix pencils (under strict equivalence) are sets of pencils having the same Kronecker canonical form, up to the eigenvalues (namely, they are an infinite union of orbits under strict equivalence). The notion of bundle for…

Linearization is a standard method in the computation of eigenvalues and eigenvectors of matrix polynomials. In the last decade a variety of linearization methods have been developed in order to deal with algebraic structures and in order…

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…

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…

Linearization is a widely used method for solving polynomial eigenvalue problems (PEPs) and rational eigenvalue problem (REPs) in which the PEP/REP is transformed to a generalized eigenproblem and then solve this generalized eigenproblem…

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…

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…

The standard way of solving a polynomial eigenvalue problem associated with a matrix polynomial starts by embedding the matrix coefficients of the polynomial into a matrix pencil, known as a strong linearization. This process transforms the…

Given a possibly singular matrix polynomial $P(z)$, we study how the eigenvalues, eigenvectors, root polynomials, minimal indices, and minimal bases of the pencils in the vector space $\mathbb{DL}(P)$ introduced in Mackey, Mackey, Mehl, and…

Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…

A number of theoretical and computational problems for matrix polynomials are solved by passing to linearizations. Therefore a perturbation theory results for linearizations need to be related back to matrix polynomials. In this paper we…