Column reduced rational matrix functions with given null-pole data in the complex plane
The problem of constructing a column reduced rational matrix function with prescribed null-pole data is discussed. This problem arises in the framework of parametrization of rational matrices meeting a number of prescribed bitangential interpolation conditions and it is related to Wiener-Hopf factorization at infinity. A regular \(m \times m\) rational matrix \(W(s)\) can be represented as \(W(s) = E(s) \cdot \text{diag} (s^{k_ 1}, \dots, s^{k_ m})\) where \(E(s) = E_ 0 + s^{-1} E_ 1 + s^{-2} E_ 2 + \cdots\); the integers \(k_ j\), \(j=1, \dots, m\) denote the highest power of \(s\) in the \(j\)th column of \(W(s)\). \(W(s)\) is said to be column reduced at infinity if \(E_ 0\) is an invertible matrix. A quintet \(\sigma = (C, A_ \pi; A_ \zeta, B; \Gamma)\) of matrices of appropriate dimensions is called an admissible data set if the pairs \((C,A_ \pi)\) and \((A_ \zeta, B)\) are respectively observable and controllable and \(\Gamma\) satisfies the Sylvester equation \(\Gamma A_ \pi - A_ \zeta \Gamma = BC\). The main problem is the following: Given an admissible Sylvester data set \(\sigma\) construct all regular rational matrix functions \(W\) such that \(W\) has \(\sigma\) as its \(\mathbb{C}\)-null-pole triple and it is column reduced at infinity. This problem is completely solved. Explicit formulas are given for a solution \(W\) and up to a certain constant invertible factor on the right one obtains a full parametrization of such solutions. The results are specified and developed in the last section for matrix polynomials.
- Errata to: Two-sided tangential interpolation of real rational matrix functions
- Factorization indices at infinity for rational matrix functions
- Factorization indices for matrix polynomials
- Factorization of matrix functions and singular integral operators
- Fast projection methods for minimal design problems in linear system theory
- scientific article; zbMATH DE number 16875 (Why is no real title available?)
- scientific article; zbMATH DE number 1284115 (Why is no real title available?)
- scientific article; zbMATH DE number 3388886 (Why is no real title available?)
- Invariant Description of Linear, Time-Invariant Controllable Systems
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Minimal McMillan degree rational matrix functions with prescribed local zero-pole structure
- On canonical forms for linear constant systems
- On the solution of the minimal rational interpolation problem
- Rational interpolation and state-variable realizations
- Regular rational matrix functions with prescribed null and pole data except at infinity
- Topics in interpolation theory of rational matrix-valued functions
- Stability and McMillan degree for rational matrix interpolants
- Reconstruction of a rational nonsquare matrix function from local data
- \(J\)-pseudo-spectral and \(J\)-inner-pseudo-outer factorizations for matrix polynomials
- Bitangential interpolation problems for symmetric rational matrix functions
- Zero-pole interpolation for meromorphic matrix functions on an algebraic curve and transfer functions of 2D systems
- Regular rational matrix functions with prescribed null and pole data except at infinity
- A definition of column reduced proper rational matrices
- Hermite's formula for vector polynomial interpolation with applications to structured matrices
- THE REPRESENTATION OF THE GOLDEN RATIO BY THE CONTINUED FRACTION
- scientific article; zbMATH DE number 837794 (Why is no real title available?)
- The rational interpolation problem: Grassmannian and Loewner-matrix approaches
This page was built for publication: Column reduced rational matrix functions with given null-pole data in the complex plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329972)
