ACM Home Page
Please provide us with feedback. Feedback
On the Linear Convergence of a Covariance Factorization Algorithm
Full text PdfPdf (393 KB)
Source Journal of the ACM (JACM) archive
Volume 23 ,  Issue 2  (April 1976) table of contents
Pages: 310 - 316  
Year of Publication: 1976
ISSN:0004-5411
Author
Marcello Pagano  Statistical Science Division, State University of New York at Buffalo, 4230 Ridge Lea Road, Amherst, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321941.321950
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BAUER, F.L. Ein Direktes Iterationsverfahren zur Hurwitzzerlegung eines Polynoms. Archly. el. Ubertr. 9 (1955), 285--290.
 
2
BAUER, F.L. Beitr~ige zur Entwicklung numerischer Verfahren ftir programmgestuerte Rechenandagen, II. Sztzungsberichte der Mathem, Naturtmss. Klasse der Bayer. Akademie der W~ssenschaften, 1956, pp. 163-203.
 
3
DEVINATZ, A. Asymptotic estimates for the finite predictor Math. Scan& 16 (1964), 111-120.
 
4
FmCHER, D, GOLUB, G, HALD, O., LEIvA, C., AND WIDLUND, O. On Fourier-Toeplitz methods for separable elliptic problems. Rep. STAN-CS-73-375, Comput. Sci. Dep., Stanford U., Stanford, Calif., 1973.
 
5
GERONIMUS, L.YA. Orthogonal Polynomzal~. Transl. and pub. by Consultants Bureau, New York.
 
6
GRENANDER, U, AND ROSE~BLA~r, M. An extension of a theorem of G. Szego and its application to the study of stochastic processes. Trans. Amer. Math. Soc. 76 (1954), 112-126.
 
7
GRENANVER, U., AND SZEGd, G. Toepl~tz Forms and Their Applications. U of California Press, Berkeley and Los Angeles, CMif, 1958.
 
8
LEVXNSON, N. The Wiener RMS (root mean square) error criterion in filter design and prediction. J. Math Phys. 25 (1947), 261-278.
 
9
PAGANO, M. An algorithm for fitting autoregressive schemes. J. Roy Statist. Soc., Ser. C (Apphed Statzst~cs), $1 (1972), 274-281.
 
10
RISSANEN, J Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomials. Math. Comput. 27 (1973), 147-154
 
11
RISSANEN, J, AND BARBOSA, L. Properties of infinite covariance matrices and stability of optimum predictors. Inform. Sc~s. 1 (1969), 221-236.
 
12
WmTTZ, E, P. Prediction and Regulation. The English Universities Press Ltd, London, 1963.
 
13
W, LSON, G. Factorization of the covariance generating function of a pure moving average process. SIAM J. Numer. Anal. 6 (1969), 1-7.
 
14
WoLv, H. A large-sample test for moving averages. J. Roy. Statist. Soc., Set. B, 11 (1949), 297-305.


Peer to Peer - Readers of this Article have also read: