On computing root polynomials and minimal bases of matrix pencils
From MaRDI portal
Publication:2104967
Abstract: We revisit the notion of root polynomials, thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020] for general polynomial matrices, and show how they can efficiently be computed in the case of matrix pencils. The staircase algorithm implicitly computes so-called zero directions, as defined in [P. Van Dooren, Computation of zero directions of transfer functions, Proceedings IEEE 32nd CDC, 3132--3137, 1993]. However, zero directions generally do not provide the correct information on partial multiplicities and minimal indices. These indices are instead provided by two special cases of zero directions, namely, root polynomials and vectors of a minimal basis of the pencil. We show how to extract, starting from the block triangular pencil that the staircase algorithm computes, both a minimal basis and a maximal set of root polynomials in an efficient manner. Moreover, we argue that the accuracy of the computation of the root polynomials can be improved by making use of iterative refinement.
Recommendations
- Publication:4730683
- Root vectors of polynomial and rational matrices: theory and computation
- scientific article; zbMATH DE number 624733
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Spectral problems for pencils of polynomial matrices. Methods and algorithms. V
Cites work
- A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
- Accuracy and Stability of Numerical Algorithms
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Duality of matrix pencils, Wong chains and linearizations
- Fast projection methods for minimal design problems in linear system theory
- Fiedler companion linearizations and the recovery of minimal indices
- Fiedler-comrade and Fiedler-Chebyshev pencils
- scientific article; zbMATH DE number 3673938 (Why is no real title available?)
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- Linearizations of singular matrix polynomials and the recovery of minimal indices
- Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Minimal indices and minimal bases via filtrations
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion
- On the Segré, Weyr characteristics of right (left) regular matrix pencils
- Root polynomials and their role in the theory of matrix polynomials
- Root vectors of polynomial and rational matrices: theory and computation
- The behavior of the complete eigenstructure of a polynomial matrix under a generic rational transformation
- The computation of Kronecker's canonical form of a singular pencil
- The eigenvalue problem \(\lambda Tx+Sx\)
- The fundamental subspace sequences of matrix pencils: A Toeplitz matrix unified characterization
- The quasi-Kronecker form for matrix pencils
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
Cited in
(13)- An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects
- Root vectors of polynomial and rational matrices: theory and computation
- Construction of a minimal basis of the right null space of a singular multiparameter polynomial matrix
- Root polynomials and their role in the theory of matrix polynomials
- Minimal polynomial and reduced rank extrapolation methods are related
- A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
- scientific article; zbMATH DE number 624733 (Why is no real title available?)
- Locating the Eigenvalues of Matrix Polynomials
- The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials
- Revisiting the Matrix Polynomial Greatest Common Divisor
- Computing a compact local Smith–McMillan form
- Minimal rank factorizations of polynomial matrices
- Finding the nearest \(\mathbf{\Omega}\)-stable pencil with Riemannian optimization
This page was built for publication: On computing root polynomials and minimal bases of matrix pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104967)
