Abstract
The definition of irreducible factorizations of minimal degree of a rational matrix and a brief description of an algorithm for constructing them are presented. Two properties of such factorizations are established. First, for every proper rational matrix, these factorizations are just its minimal matrix fractiondescriptions (MFDs), and, second, they make it possible to reduce the problem of determining the pole-zero structure of a rational matrix at infinity to that of finding the indices of two polynomial matrices at the zero point. Bibliography: 4 titles.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
V. N. Kublanovskaya, “Methods and algorithms for solving spectral problems for polynomial and rational matrices," Zap. Nauchn. Semin. POMI, 238, 3–330 (1997).
V. N. Kublanovskaya and V. B. Khazanov, “On irreducible factorizations of rational matrices and their application," Zap. Nauchn. Semin. POMI, 219, 117–156 (1995).
T. Kailath, Linear Systems, Prentice Hall (1980).
V. Kublanovskaya, “Rank-division algorithms and their applications," J. Numer. Linear. Algebra Appl., 1, No. 2, 199–213 (1992).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Khazanov, V.B. On Some Properties of the Minimal-in-Degree Irreducible Factorizations of a Rational Matrix. Journal of Mathematical Sciences 114, 1860–1862 (2003). https://doi.org/10.1023/A:1022418906126
Issue Date:
DOI: https://doi.org/10.1023/A:1022418906126