Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs
For a class of subspace algorithms, in the case where no observed inputs are included, the asymptotic properties of the estimates of the system matrices are discussed. One proves the asymptotic normality of subspace estimates and that the variance may be calculated. A new consistency result for the system matrix is presented.
scientific article; zbMATH DE number 1331898