Comparing the CCA Subspace Method to Pseudo Maximum Likelihood Methods in the case of No Exogenous Inputs
Dietmar Bauer ()
Journal of Time Series Analysis, 2005, vol. 26, issue 5, 631-668
Abstract:
Abstract. This paper deals with the CCA subspace algorithm proposed in Larimore [Proceeding of 1983 American Control Conference (1983) pp. 445–451], which constitutes an alternative to the classical criteria optimization based approach to the identification of linear dynamic models for a stationary process. Subspace algorithms for the estimation of linear models have been advocated mainly due to their numerical properties. A large variety of different subspace algorithms is known to provide strongly consistent and asymptotically normal estimates of the system under mild assumptions on the noise and the underlying true system. This paper shows that for certain versions of CCA described in the paper the estimates are asymptotically equivalent to pseudo maximum‐likelihood estimates in the sense that the difference in the estimators multiplied by the square root of the sample size converges to zero (in probability). Therefore these versions of CCA are asymptotically efficient for Gaussian innovations.
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)
Downloads: (external link)
https://doi.org/10.1111/j.1467-9892.2005.00441.x
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:bla:jtsera:v:26:y:2005:i:5:p:631-668
Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0143-9782
Access Statistics for this article
Journal of Time Series Analysis is currently edited by M.B. Priestley
More articles in Journal of Time Series Analysis from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().