Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs
From MaRDI portal
Publication:1301438
DOI10.1016/S0005-1098(99)00031-XzbMath0944.93008OpenAlexW2030181817MaRDI QIDQ1301438
Wolfgang Scherrer, Dietmar Bauer, Manfred Deistler
Publication date: 2 September 1999
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0005-1098(99)00031-x
identificationconsistencyasymptotic normalityasymptotic analysislinear multivariable systemsdiscrete time systemssubspace algorithms
Related Items (16)
Some facts about the choice of the weighting matrices in Larimore type of subspace algorithms ⋮ Subspace-based fault detection robust to changes in the noise covariances ⋮ The relation of the CCA subspace method to a balanced reduction of an autoregressive model. ⋮ ESTIMATING LINEAR DYNAMICAL SYSTEMS USING SUBSPACE METHODS ⋮ Analysis of the asymptotic properties of the MOESP type of subspace algorithms ⋮ Subspace identification for non-linear systems with measured-input non-linearities ⋮ System identification methods for (operational) modal analysis: review and comparison ⋮ An improved bias-compensation approach for errors-in-variables model identification ⋮ Bootstrap-based estimates of uncertainty in subspace identification methods ⋮ Asymptotic properties of subspace estimators ⋮ Estimating ARMAX systems for multivariate time series using the state approach to subspace algorithms ⋮ Model specification and selection for multivariate time series ⋮ A Note on the Specification and Estimation of ARMAX Systems ⋮ Comparing the CCA Subspace Method to Pseudo Maximum Likelihood Methods in the case of No Exogenous Inputs ⋮ USING SUBSPACE METHODS FOR ESTIMATING ARMA MODELS FOR MULTIVARIATE TIME SERIES WITH CONDITIONALLY HETEROSKEDASTIC INNOVATIONS ⋮ Estimating cointegrated systems using subspace algorithms
This page was built for publication: Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs
