Analysis of the asymptotic properties of the MOESP type of subspace algorithms
- 1 April 2000
- journal article
- Published by Elsevier BV in Automatica
- Vol. 36 (4), 497-509
- https://doi.org/10.1016/s0005-1098(99)00174-0
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Consistency and asymptotic normality of some subspace algorithms for systems without observed inputsAutomatica, 1999
- On Consistency of Subspace Methods for System IdentificationAutomatica, 1998
- Counterexample to General Consistency of Subspace System Identification MethodsIFAC Proceedings Volumes, 1997
- Statistical analysis of novel subspace identification methodsSignal Processing, 1996
- A linear regression approach to state-space subspace system identificationSignal Processing, 1996
- Subspace Identification for Linear SystemsPublished by Springer Science and Business Media LLC ,1996
- Consistency and relative efficiency of subspace methodsAutomatica, 1995
- N4SID: Subspace algorithms for the identification of combined deterministic-stochastic systemsAutomatica, 1994
- Identification of the deterministic part of MIMO state space models given in innovations form from input-output dataAutomatica, 1994
- Asymptotic Theory for Principal Component AnalysisThe Annals of Mathematical Statistics, 1963