On the Linear Convergence of a Covariance Factorization Algorithm
- 1 April 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 23 (2), 310-316
- https://doi.org/10.1145/321941.321950
Abstract
An algorithm for factoring a covariance function into its Hurwitz factors, which is based on the Cholesky factors of a certain matrix, was proposed by F.L. Bauer and others. This algorithm bears a close connection to the theory of orthogonal polynomials, and a closer one to the theory of prediction of stationary time series. In this paper these relations are pointed out and then used to advantage to prove the linear convergence of this algorithm.Keywords
This publication has 7 references indexed in Scilit:
- Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomialsMathematics of Computation, 1973
- An Algorithm for Fitting Autoregressive SchemesJournal of the Royal Statistical Society Series C: Applied Statistics, 1972
- Properties of infinite covariance matrices and stability of optimum predictorsInformation Sciences, 1969
- Factorization of the Covariance Generating Function of a Pure Moving Average ProcessSIAM Journal on Numerical Analysis, 1969
- Asymptotic Estimates for the Finite Predictor.MATHEMATICA SCANDINAVICA, 1964
- Toeplitz Forms and Their ApplicationsPublished by University of California Press ,1958
- The Wiener (Root Mean Square) Error Criterion in Filter Design and PredictionJournal of Mathematics and Physics, 1946