Covariance factorization via newton-raphson iteration
Abstract
The solution of an integral equation arising in a covariance factorization problem is obtained by a Newton-Raphson iteration that is almost always globally convergent. Interpretations of the iterates are given, and the result is shown to specialize to known algorithms when the covariance is stationary with a rational Fourier transform.
Description
Keywords
Citation
Collections
Source
IEEE Transactions on Information Theory
Type
Book Title
Entity type
Publication