Efficient Algorithm for Spectral Factorization

Abstract An algorithm is presented for the spectral factorization of polynomial (or rational) matrices arising in optimal control and filtering theory as well as in network theory. There are two versions of the algorithm: one applicable to continuous-time problems, the other to discrete time ones. Both versions are based on Newton's method, feature quadratic convergence, and provide a significant improvement in efficiency over the existing methods.

[1]  Zdenek Vostrý.  New algorithm for polynomial spectral factorization with quadratic convergence. II , 1975, Kybernetika.

[2]  Brian D. O. Anderson,et al.  Recursive algorithm for spectral factorization , 1974 .

[3]  D. Youla,et al.  On the factorization of rational matrices , 1961, IRE Trans. Inf. Theory.

[4]  W. Tuel.  Computer algorithm for spectral factorization of rational matrices , 1968 .

[5]  M. Davis.  Factoring the spectral matrix , 1963 .

[6]  G. Wilson.  The Factorization of Matricial Spectral Densities , 1972 .

[7]  V. Kučera,et al.  Discrete Linear Control: The Polynomial Equation Approach , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  F. Callier.  On polynomial matrix spectral factorization by symmetric extraction , 1985 .

[9]  J. Rissanen.  Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomials , 1973 .

[10]  Jan Jezek.  Conjugated and symmetric polynomial equations. I. Continuous-time systems , 1983, Kybernetika.

[11]  Dante C. Youla,et al.  Bauer-type factorization of positive matrices and the theory of matrix polynomials orthogonal on the unit circle , 1978 .

[12]  Norbert Wiener,et al.  Extrapolation, Interpolation, and Smoothing of Stationary Time Series , 1964 .

[13]  G. Wilson.  Factorization of the Covariance Generating Function of a Pure Moving Average Process , 1969 .

[14]  Jan Jezek.  Conjugated and symmetric polynomial equations. II. Discrete-time systems , 1983, Kybernetika.