A New Method of Matrix Spectral Factorization
Authors:
- 14 March 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 57 (4) , 2318-2326
Abstract
A new algorithm of matrix spectral factorization is proposed which can be applied to compute an approximate spectral factor of any positive definite matrix function which satisfies the Paley-Wiener condition.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- On Approximate Spectral Factorization of Matrix FunctionsJournal of Fourier Analysis and Applications, 2011
- A Simple Proof of the Matrix-Valued Fejér-Riesz TheoremJournal of Fourier Analysis and Applications, 2008
- A new efficient matrix spectral factorization algorithm2007
- CONTINUITY OF THE SPECTRAL FACTORIZATION MAPPINGJournal of the London Mathematical Society, 2004
- Effective Fast Algorithms for Polynomial Spectral FactorizationNumerical Algorithms, 2003
- A survey of spectral factorization methodsNumerical Linear Algebra with Applications, 2001
- Factorization of the Covariance Generating Function of a Pure Moving Average ProcessSIAM Journal on Numerical Analysis, 1969
- Prediction theory and Fourier Series in several variablesActa Mathematica, 1958
- The prediction theory of multivariate stochastic processes, II: The linear predictorActa Mathematica, 1958
- The prediction theory of multivariate stochastic processes: I. The regularity conditionActa Mathematica, 1957