An algebraic solution to the spectral factorization problem
- 1 August 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 12 (4) , 410-414
- https://doi.org/10.1109/tac.1967.1098646
Abstract
The problem of giving a spectral factorization of a class of matrices arising in Wiener filtering theory and network synthesis is tackled via an algebraic procedure. A quadratic matrix equation involving only constant matrices is shown to possess solutions which directly define a solution to the spectral factorization problem. A spectral factor with a stable inverse is defined by that unique solution to the quadratic equation which also satisfies a certain eigenvalue inequality. Solution of the quadratic matrix equation and incorporation of the eigenvalue inequality constraint are made possible through determination of a transformation which reduces to Jordan form a matrix formed from the coefficient matrices of the quadratic equation.Keywords
This publication has 7 references indexed in Scilit:
- A System Theory Criterion for Positive Real MatricesSIAM Journal on Control, 1967
- Spectral factorization-computational aspectsIEEE Transactions on Automatic Control, 1966
- Matrix Quadratic SolutionsSIAM Journal on Applied Mathematics, 1966
- Factoring the spectral matrixIEEE Transactions on Automatic Control, 1963
- Mathematical Description of Linear Dynamical SystemsJournal of the Society for Industrial and Applied Mathematics Series A Control, 1963
- On the factorization of rational matricesIEEE Transactions on Information Theory, 1961
- The prediction theory of multivariate stochastic processes: I. The regularity conditionActa Mathematica, 1957