Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization
From MaRDI portal
Publication:2114103
Abstract: 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 present an algorithm that finds which perturbation of matrix coefficients of a matrix polynomial corresponds to a given perturbation of the entire linearization pencil. Moreover we find transformation matrices that, via strict equivalence, transform a perturbation of the linearization to the linearization of a perturbed polynomial. For simplicity, we present the results for the first companion linearization but they can be generalized to a broader class of linearizations.
Recommendations
- Fiedler companion linearizations and the recovery of minimal indices
- Recovery of eigenvectors and minimal bases of matrix polynomials from generalized Fiedler linearizations
- Algebraic linearizations of matrix polynomials
- Linearizations of singular matrix polynomials and the recovery of minimal indices
- Perturbation, extraction and refinement of invariant pairs for matrix polynomials
Cites work
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A new family of companion forms of polynomial matrices
- Algorithms for Hessenberg-triangular reduction of Fiedler linearization of matrix polynomials
- Backward error and condition of polynomial eigenvalue problems
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Change of the \(^*\)congruence canonical form of 2-by-2 matrices under perturbations
- Change of the congruence canonical form of 2-by-2 and 3-by-3 matrices under perturbations and bundles of matrices under congruence
- Computing the nearest rank-deficient matrix polynomial
- Fiedler companion linearizations for rectangular matrix polynomials
- Generic complete eigenstructures for sets of matrix polynomials with bounded rank and degree
- Geometrical properties of the Frobenius condition number for positive definite matrices
- Geometry of matrix polynomial spaces
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Invertibly convergent infinite products of matrices
- Miniversal deformations of matrices of bilinear forms
- Miniversal deformations of matrices under *congruence and reducing transformations
- Miniversal deformations of pairs of skew-symmetric matrices under congruence
- Miniversal deformations of pairs of symmetric matrices under congruence
- NLEVP, a collection of nonlinear eigenvalue problems
- Normalized Frobenius condition number of the orthogonal projections of the identity
- On the Nearest Singular Matrix Pencil
- Perturbation theory of matrix pencils through miniversal deformations
- Polynomial eigenvalue problems: theory, computation, and structure
- Spectral condition-number estimation of large sparse matrices.
- Stratification of full rank polynomial matrices
- Structure preserving stratification of skew-symmetric matrix polynomials
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- The nonlinear eigenvalue problem
- The quadratic eigenvalue problem
- Where is the nearest non-regular pencil?
This page was built for publication: Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114103)
