On computing root polynomials and minimal bases of matrix pencils

DOI10.1016/J.LAA.2022.10.025zbMATH Open1504.15039arXiv2110.15416OpenAlexW3210750863MaRDI QIDQ2104967FDOQ2104967

Authors: Vanni Noferini, Paul van Dooren 

Publication date: 8 December 2022

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2110.15416

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

zbMATH Keywords

matrix pencilSmith formmaximal setminimal basisstaircase algorithmroot polynomiallocal Smith form

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Canonical forms, reductions, classification (15A21) Matrix pencils (15A22)

Cites Work

• Fast projection methods for minimal design problems in linear system theory
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• The computation of Kronecker's canonical form of a singular pencil
• Accuracy and Stability of Numerical Algorithms
• The quasi-Kronecker form for matrix pencils
• Fiedler companion linearizations and the recovery of minimal indices
• Linearizations of singular matrix polynomials and the recovery of minimal indices
• Title not available (Why is that?)
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• Title not available (Why is that?)
• The behavior of the complete eigenstructure of a polynomial matrix under a generic rational transformation
• On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion
• The eigenvalue problem \(\lambda Tx+Sx\)
• An improved Toeplitz algorithm for polynomial matrix null-space computation
• A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
• On the Segré, Weyr characteristics of right (left) regular matrix pencils
• Root polynomials and their role in the theory of matrix polynomials
• Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
• Title not available (Why is that?)
• Numerical computation of minimal polynomial bases: a generalized resultant approach
• The fundamental subspace sequences of matrix pencils: A Toeplitz matrix unified characterization
• Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties
• Block Kronecker linearizations of matrix polynomials and their backward errors
• Fiedler-comrade and Fiedler-Chebyshev pencils
• Duality of matrix pencils, Wong chains and linearizations
• Root vectors of polynomial and rational matrices: theory and computation

Cited In (7)

• A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
• Locating the Eigenvalues of Matrix Polynomials
• The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials
• Construction of a minimal basis of the right null space of a singular multiparameter polynomial matrix
• Revisiting the Matrix Polynomial Greatest Common Divisor
• Computing a compact local Smith–McMillan form
• Minimal polynomial and reduced rank extrapolation methods are related

Uses Software

• mctoolbox

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)