Analysis of the Asymptotic Properties of the MOESP Type of Subspace Algorithms
2000 (English)In: Automatica, ISSN 00051098, Vol. 36, no 4, 497-509 p.Article in journal (Refereed) Published
The MOESP type of subspace algorithms are used for the identification of linear, discrete time, finite-dimensional state-space systems. They are based on the geometric structure of covariance matrices and exploit the properties of the state vector extensively. In this paper the asymptotic properties of the algorithms are examined. The main results include consistency and asymptotic normality for the estimates of the system matrices, under suitable assumptions on the noise sequence, the input process and the underlying true system.
Place, publisher, year, edition, pages
Elsevier , 2000. Vol. 36, no 4, 497-509 p.
subspace method, linear systems, asymptotic analysis, identification
IdentifiersURN: urn:nbn:se:kth:diva-82180DOI: 10.1016/S0005-1098(99)00174-0OAI: oai:DiVA.org:kth-82180DiVA: diva2:498008
NR 201408052012-02-112012-02-112012-02-11Bibliographically approved