The related problems of (finite-length) robust prediction and maximizing spectral entropy over a simplex of co-variance matrices are considered. General properties of iterative solutions of these problems are developed, and monotone convergence proofs are presented for two algorithms that provide such solutions. The analogous problems for simplexes of spectral densities are also considered.
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences