Vector spaces of generalized linearizations for rectangular matrix polynomials
From MaRDI portal
linearizationmatrix polynomialsbackward error analysispolynomial eigenvalue problemminimal indicesminimal bases
Eigenvalues, singular values, and eigenvectors (15A18) Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Linearizations (93B18) Vector spaces, linear dependence, rank, lineability (15A03) Matrix pencils (15A22) Matrices over function rings in one or more variables (15A54) Nonlinear spectral theory, nonlinear eigenvalue problems (47J10)
Abstract: 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 polynomial. This work was subsequently extended by De Ter'an et al. in 2009 (reference [5] of the article) to include the case of square singular matrix polynomials. We extend this work to non-square matrix polynomials by proposing similar vector spaces of rectangular matrix pencils that are equal to the ones introduced by Mackey et al. when the polynomial is square. Moreover, the properties of these vector spaces are similar to those in the article by De Ter'an et al. for the singular case. In particular, the complete eigenvalue problem associated with the matrix polynomial can be solved by using almost every matrix pencil from these spaces. Further, almost every pencil in these spaces can be trimmed to form many smaller pencils that are strong linearizations of the matrix polynomial which readily solve the complete eigenvalue problem for the polynomial. These linearizations are easier to construct and are often smaller than the Fiedler linearizations introduced by De Ter'an et al. in 2012 (reference [7] of the article). Further, the global backward error analysis by Dopico et al. in 2016 (reference [10] of the article) applied to these linearizations, shows that they provide a wide choice of linearizations with respect to which the complete polynomial eigenvalue problem can be solved in a globally backward stable manner.
Recommendations
- Vector Spaces of Linearizations for Matrix Polynomials
- Fiedler companion linearizations for rectangular matrix polynomials
- Linearizations of singular matrix polynomials and the recovery of minimal indices
- Block Kronecker linearizations of matrix polynomials and their backward errors
- On vector spaces of linearizations for matrix polynomials in orthogonal bases
Cites work
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- scientific article; zbMATH DE number 49560 (Why is no real title available?)
- scientific article; zbMATH DE number 2157777 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- A new family of companion forms of polynomial matrices
- A permuted factors approach for the linearization of polynomial matrices
- A simplified approach to Fiedler-like pencils via block minimal bases pencils
- Block Kronecker ansatz spaces for matrix polynomials
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Definite matrix polynomials and their linearization by definite pencils
- Fiedler companion linearizations and the recovery of minimal indices
- Fiedler companion linearizations for rectangular matrix polynomials
- Linearizations of singular matrix polynomials and the recovery of minimal indices
- Matrix Analysis
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- On vector spaces of linearizations for matrix polynomials in orthogonal bases
- Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
- Polynomial eigenvalue problems: theory, computation, and structure
- Recovery of eigenvectors and minimal bases of matrix polynomials from generalized Fiedler linearizations
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Structured polynomial eigenproblems related to time-delay systems
- The computation of Kronecker's canonical form of a singular pencil
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- The quadratic eigenvalue problem
- Vector Spaces of Linearizations for Matrix Polynomials
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
Cited in
(5)- Rectangular eigenvalue problems
- Fiedler companion linearizations for rectangular matrix polynomials
- Vector Spaces of Linearizations for Matrix Polynomials
- Large vector spaces of block-symmetric strong linearizations of matrix polynomials
- The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials
This page was built for publication: Vector spaces of generalized linearizations for rectangular matrix polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376737)
