On a class of matrix pencils and -ifications equivalent to a given matrix polynomial
From MaRDI portal
Publication:281981
DOI10.1016/J.LAA.2015.07.017zbMATH Open1338.65099arXiv1406.1025OpenAlexW2962961128MaRDI QIDQ281981FDOQ281981
Publication date: 11 May 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: A new class of linearizations and -ifications for matrix polynomials of degree is proposed. The -ifications in this class have the form where is a block diagonal matrix polynomial with blocks of size , is an matrix polynomial and , for a suitable integer . The blocks can be chosen a priori, subjected to some restrictions. Under additional assumptions on the blocks the matrix polynomial is a strong -ification, i.e., the reversed polynomial of defined by is an -ification of . The eigenvectors of the matrix polynomials and are related by means of explicit formulas. Some practical examples of -ifications are provided. A strategy for choosing in such a way that is a well conditioned linearization of is proposed. Some numerical experiments that validate the theoretical results are reported
Full work available at URL: https://arxiv.org/abs/1406.1025
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- NLEVP
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Numerical Methods for Structured Markov Chains
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- The quadratic eigenvalue problem
- Fiedler Companion Linearizations and the Recovery of Minimal Indices
- Tropical Scaling of Polynomial Matrices
- Linearization of matrix polynomials expressed in polynomial bases
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Spectral equivalence of matrix polynomials and the index sum theorem
- Fiedler companion linearizations for rectangular matrix polynomials
- Locating the Eigenvalues of Matrix Polynomials
- Backward error and condition of polynomial eigenvalue problems
- Solving secular and polynomial equations: a multiprecision algorithm
- Triangularizing matrix polynomials
- Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
- Triangularizing quadratic matrix polynomials
- Definite Matrix Polynomials and their Linearization by Definite Pencils
- Standard triples of structured matrix polynomials
- Vector Spaces of Linearizations for Matrix Polynomials
- The Conditioning of Linearizations of Matrix Polynomials
- Symmetric Linearizations for Matrix Polynomials
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Some Modified Matrix Eigenvalue Problems
Cited In (12)
- Orthogonal iterations on companion-like pencils
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Block minimal bases \(\ell\)-ifications of matrix polynomials
- Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
- Title not available (Why is that?)
- Strong Linearizations of Rational Matrices
- Matrix pencil equivalents of a general polynomial matrix
- Relations between Perron-Frobenius results for matrix pencils
- Title not available (Why is that?)
- Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form
- Factoring Block Fiedler Companion Matrices
- Fast Hessenberg Reduction of Some Rank Structured Matrices
Uses Software
This page was built for publication: On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281981)