Root vectors of polynomial and rational matrices: theory and computation

DOI10.1016/J.LAA.2022.10.013MaRDI QIDQ2093531zbMATH OpenOpenAlexFDO

Authors Vanni Noferini, Paul van Dooren

Publication date 8 November 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

eigenvalueeigenvectorSmith formroot vectormaximal setrational matrixminimal basisroot polynomialcoalescent pole/zerolocal Smith form

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Canonical forms, reductions, classification (15A21) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Matrix pencils (15A22)

Abstract: The notion of root polynomials of a polynomial matrix $P(lambda)$ was 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]. In this paper, we extend such a systematic approach to general rational matrices $R(lambda)$, possibly singular and possibly with coalescent pole/zero pairs. We discuss the related theory for rational matrices with coefficients in an arbitrary field. As a byproduct, we obtain sensible definitions of eigenvalues and eigenvectors of a rational matrix $R(lambda)$, without any need to assume that $R(lambda)$ has full column rank or that the eigenvalue is not also a pole. Then, we specialize to the complex field and provide a practical algorithm to compute them, based on the construction of a minimal state space realization of the rational matrix $R(lambda)$ and then using the staircase algorithm on the linearized pencil to compute the null space as well as the root polynomials in a given point $lambd{a}_0$. If $lambd{a}_0$ is also a pole, then it is necessary to apply a preprocessing step that removes the pole while making it possible to recover the root vectors of the original matrix: in this case, we study both the relevant theory (over a general field) and an algorithmic implementation (over the complex field), still based on minimal state space realizations.

Recommendations

• Root polynomials and their role in the theory of matrix polynomials
• On computing root polynomials and minimal bases of matrix pencils
• Linearizations of rational matrices from general representations
• Strong Linearizations of Rational Matrices
• scientific article; zbMATH DE number 749525

Cites work

• scientific article; zbMATH DE number 3661177 (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 49560 (Why is no real title available?)
• scientific article; zbMATH DE number 3390604 (Why is no real title available?)
• Finite and infinite structures of rational matrices: a local approach
• Matrices of rational functions
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties
• Model Reduction of MIMO Systems via Tangential Interpolation
• NLEIGS: A Class of Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems
• Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
• On coprime rational function matrices
• On minimal bases and indices of rational matrices and their linearizations
• Poles and zeros of linear multivariable systems : a survey of the algebraic, geometric and complex-variable theory
• Properties of the system matrix of a generalized state-space system†
• Rational and polynomial matrix factorizations via recursive pole-zero cancellation
• Root polynomials and their role in the theory of matrix polynomials
• The behavior of the complete eigenstructure of a polynomial matrix under a generic rational transformation
• The generalized eigenstructure problem in linear system theory
• The nonlinear eigenvalue problem
• Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems

Cited in

(16)

• On computing root polynomials and minimal bases of matrix pencils
• Finite and infinite structures of rational matrices: a local approach
• The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials
• Root polynomials and their role in the theory of matrix polynomials
• Van Dooren's index sum theorem and rational matrices with prescribed structural data
• On Matrix Polynomials with Real Roots
• Revisiting the Matrix Polynomial Greatest Common Divisor
• Decomposition of a rational matrix into partial fractions
• Invertible bases and root vectors for analytic matrix-valued functions
• scientific article; zbMATH DE number 6403633 (Why is no real title available?)
• The continuous kernel of a nonsquare rational matrix function
• Para-Hermitian rational matrices
• A degree property of rational matrices
• Computing a compact local Smith–McMillan form
• Perturbation Theory of Transfer Function Matrices
• On generalizing trace minimization principles. II

Describes a project that uses

Uses Software

• NLEIGS

This page was built for publication: Root vectors of polynomial and rational matrices: theory and computation

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