Papers
Topics
Authors
Recent
Search
2000 character limit reached

Subspace Identification with Multiple Data Records: unlocking the archive

Published 9 Apr 2017 in cs.SY | (1704.02635v1)

Abstract: We develop an approach to subspace system identification using multiple data records and present a simple rank-based test for the adequacy of these data for fitting the unique linear, noise-free, dynamic model of prescribed state-vector, input-vector and output-vector dimensions. The approach is motivated by the prospect of sorting through archives of operational data and extracting a sequence of not-necessarily-contiguous data records individually insufficient for providing identifiability but collectively making this possible. The test of identifiability then becomes the sorting criterion for accepting or rejecting new data records. En passant, the familiar Hankel structure of the data matrices of subspace system identification is reinterpreted and revised.

Citations (5)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.