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.
Original language | English |
---|---|
Pages (from-to) | 410-414 |
Number of pages | 5 |
Journal | IEEE Transactions on Automatic Control |
Volume | AC-12 |
Issue number | 4 |
DOIs | |
Publication status | Published - Aug 1967 |
Externally published | Yes |