Revisiting the Matrix Polynomial Greatest Common Divisor

DOI10.1137/22M1531993MaRDI QIDQ6116668zbMATH OpenOpenAlexFDO

Authors Vanni Noferini, Paul van Dooren

Publication date 16 August 2023

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

generalized state-spacegreatest common divisorHermite normal formpolynomial matrixSmith normal formstaircase algorithm

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Matrix pencils (15A22) Matrix equations and identities (15A24)

Abstract: In this paper we revisit the greatest common right divisor (GCRD) extraction from a set of polynomial matrices $P_i(lambda)inF[la{]}^{m_{i}imesn}$, $i=1,ldots,k$ with coefficients in a generic field $F$, and with common column dimension $n$. We give necessary and sufficient conditions for a matrix $G(la)inF[la{]}^{ellimesn}$ to be a GCRD using the Smith normal form of the $mimesn$ compound matrix $P(lambda)$ obtained by concatenating $P_i(lambda)$ vertically, where $m=su{m}_{i=1}^k{m}_i$. We also describe the complete set of degrees of freedom for the solution $G(la)$, and we link it to the Smith form and Hermite form of $P(la)$. We then give an algorithm for constructing a particular minimum rank solution for this problem when $F=C$ or $R$, using state-space techniques. This new method works directly on the coefficient matrices of $P(la)$, using orthogonal transformations only. The method is based on the staircase algorithm, applied to a particular pencil derived from a generalized state-space model of $P(la)$.

Recommendations

• Structure of the greatest common divisors of matrices
• Structured matrix methods computing the greatest common divisor of polynomials
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
• An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
• A note on the Wolovich method of extraction of a greatest common divisor of two polynomial matrices

Cites work

• A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
• A system theoretic interpretation for GCD extraction
• An improved Toeplitz algorithm for polynomial matrix null-space computation
• Common multiples and common divisors of matrix polynomials, II. Vandermonde and resultant matrices
• Deadbeat control: A special inverse eigenvalue problem
• Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
• Generic complete eigenstructures for sets of matrix polynomials with bounded rank and degree
• Greatest common divisor via generalized Sylvester and Bezout matrices
• scientific article; zbMATH DE number 3702850 (Why is no real title available?)
• 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 3390604 (Why is no real title available?)
• Linear multivariable control. A geometric approach
• Linear multivariable systems
• Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems
• Matrices of rational functions
• Matrices. Algebra, analysis and applications
• Nonsingular Factors of Polynomial Matrices and (A,B)-Invariant Subspaces
• On computing root polynomials and minimal bases of matrix pencils
• On coprime rational function matrices
• Properties of the system matrix of a generalized state-space system†
• Rational and polynomial matrix factorizations via recursive pole-zero cancellation
• Reliable numerical methods for polynomial matrix triangularization
• Root polynomials and their role in the theory of matrix polynomials
• Root vectors of polynomial and rational matrices: theory and computation
• Strongly minimal self-conjugate linearizations for polynomial and rational matrices
• The Bezoutian and the eigenvalue-separation problem for matrix polynomials
• The computation of Kronecker's canonical form of a singular pencil
• The generalized eigenstructure problem in linear system theory
• Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach

Cited in

(6)

• A matrix Euclidean algorithm induced by state space realization
• A note on the Wolovich method of extraction of a greatest common divisor of two polynomial matrices
• GREATEST COMMON DIVISORS OF EUCLIDEAN DOMAIN MATRICES
• Minimal rank factorizations of polynomial matrices
• Computation of an exact GCRD of several polynomial matrices: QR decomposition approach
• Rosenbrock's theorem on system matrices over elementary divisor domains

This page was built for publication: Revisiting the Matrix Polynomial Greatest Common Divisor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116668)