Algorithms for Subspace State-Space System Identification: An Overview

  • De Moor B
  • Van Overschee P
  • Favoreel W
N/ACitations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a general overview of the state of the art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First the basics of linear subspace identification are summarized. Different algorithms one finds in literature (such as N4SID IV-4SID MOESP CVA) are discussed and put into a unifying framework. Further a comparison between subspace identification and prediction error methods is made on the basis of computational complexity and precision of the methods by applying them on 10 industrial datasets. Also the issue of statistical consistency of subspace identification methods is briefly discussed. Some extensions of linear subspace methods to other classes of systems such as continuous-time systems bilinear systems time-periodic systems etc. are given. Current software developments and trends in the field of system identification are also discussed including a general public domain database called DAISY containing numerous datasets that can be used to validate system identification algorithms.

Cite

CITATION STYLE

APA

De Moor, B., Van Overschee, P., & Favoreel, W. (1999). Algorithms for Subspace State-Space System Identification: An Overview. In Applied and Computational Control, Signals, and Circuits (pp. 247–311). Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-0571-5_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free