Frequency-domain subspace system identification using non-parametric noise models

In the general case of non-uniformly spaced frequency-domain data and/or arbitrarily coloured disturbing noise, the frequency-domain subspace identification algorithms described in McKelvey, Akçay, and Ljung (IEEE Trans. Automatic Control 41(7) (1996) 960) and Van Overschee and De Moor (Signal Proce...

Full description

Saved in:
Bibliographic Details
Published in:Automatica (Oxford) 2002-08, Vol.38 (8), p.1295-1311
Main Author: Pintelon, R.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Control theory. Systems
Exact sciences and technology
Frequency domain
Modelling and identification
Non-parametric noise model
Parameter estimation
Subspace identification
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the general case of non-uniformly spaced frequency-domain data and/or arbitrarily coloured disturbing noise, the frequency-domain subspace identification algorithms described in McKelvey, Akçay, and Ljung (IEEE Trans. Automatic Control 41(7) (1996) 960) and Van Overschee and De Moor (Signal Processing 52(2) (1996) 179) are consistent only if the covariance matrix of the disturbing noise is known. This paper studies the asymptotic properties (strong convergence, convergence rate, asymptotic normality, strong consistency and loss in efficiency) of these algorithms when the true noise covariance matrix is replaced by the sample noise covariance matrix obtained from a small number of independent repeated experiments. As an additional result the strong convergence (in case of model errors), the convergence rate and the asymptotic normality of the subspace algorithms with known noise covariance matrix follows.
ISSN:0005-1098
1873-2836
DOI:10.1016/S0005-1098(02)00036-5