On some properties of the minimal in degree irreducible factorizations of a rational matrix
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XIV, Tome 268 (2000), pp. 185-189
Cet article a éte moissonné depuis la source Math-Net.Ru
The definition and the brief description of the algorithms for constructing the irreducible factorizations of a rational matrix of minimal degree are presented. Two properties of these factorizations are established. First, these factorizations are just the MFDs in application to proper rational matrices and, second, they make it possible to reduce the problem of determining the pole-zero structure of a rational matrix at infinity to the problem of finding the spectral indices of two polynomial matrices at the zero point.
@article{ZNSL_2000_268_a12,
author = {V. B. Khazanov},
title = {On some properties of the minimal in degree irreducible factorizations of a rational matrix},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {185--189},
year = {2000},
volume = {268},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2000_268_a12/}
}
V. B. Khazanov. On some properties of the minimal in degree irreducible factorizations of a rational matrix. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XIV, Tome 268 (2000), pp. 185-189. http://geodesic.mathdoc.fr/item/ZNSL_2000_268_a12/