On the minimal spectral factorization of nonsingular positive rational matrices
- 1 November 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 21 (6) , 612-618
- https://doi.org/10.1109/tit.1975.1055474
Abstract
In this paper a novel theory and algorithm for spectral factorization is presented. It is based on a criterion for minimal extraction of a so-called "elementary factor." Although not all positive para-hermitian matrices can be minimally factored into elementary factors, still the method can be adapted to fit the general case by increasing the degree in a well-controlled way and removing the nonminimal units of degree at the end. The method is, in this sense, strictly minimal. Moreover, the algorithm produces the spectral factor in ali cases where such a factorization does exist. Also, an independent proof of the famous spectral factorization result of Youla is obtained, so that the completeness of the method is ascertained. The procedure results in a workable and optimally minimal algorithm.Keywords
This publication has 8 references indexed in Scilit:
- On the factorization of a nonsingular rational matrixIEEE Transactions on Circuits and Systems, 1975
- Recursive algorithm for spectral factorizationIEEE Transactions on Circuits and Systems, 1974
- On the determination of the order and the degree of a zero of a rational matrixIEEE Transactions on Automatic Control, 1974
- A solution to the matrix factorization problemIEEE Transactions on Information Theory, 1972
- An algebraic solution to the spectral factorization problemIEEE Transactions on Automatic Control, 1967
- Irreducible Realizations and the Degree of a Rational MatrixJournal of the Society for Industrial and Applied Mathematics, 1965
- Factoring the spectral matrixIEEE Transactions on Automatic Control, 1963
- On the factorization of rational matricesIEEE Transactions on Information Theory, 1961