Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-2pzkn Total loading time: 0 Render date: 2024-05-18T07:07:26.416Z Has data issue: false hasContentIssue false

9 - Subspace model identification

Published online by Cambridge University Press:  14 January 2010

Michel Verhaegen
Affiliation:
Technische Universiteit Delft, The Netherlands
Vincent Verdult
Affiliation:
Technische Universiteit Delft, The Netherlands
Get access

Summary

After studying this chapter you will be able to

  • derive the data equation that relates block Hankel matrices constructed from input–output data;

  • exploit the special structure of the data equation for impulse input signals to identify a state-space model via subspace methods;

  • use subspace identification for general input signals;

  • use instrumental variables in subspace identification to deal with process and measurement noise;

  • derive subspace identification schemes for various noise models;

  • use the RQ factorization for a computationally efficient implementation of subspace identification schemes; and

  • relate different subspace identification schemes via the solution of a least-squares problem.

Introduction

The problem of identifying an LTI state-space model from input and output measurements of a dynamic system, which we analyzed in the previous two chapters, is re-addressed in this chapter via a completely different approach. The approach we take is indicated in the literature (Verhaegen, 1994; Viberg, 1995; Van Overschee and De Moor, 1996b; Katayama, 2005) as the class of subspace identification methods. These methods are based on the fact that, by storing the input and output data in structured block Hankel matrices, it is possible to retrieve certain subspaces that are related to the system matrices of the signal-generating state-space model. Examples of such subspaces are the column space of the observability matrix, Equation (3.25) on page 67, and the row space of the state sequence of a Kalman filter.

Type
Chapter
Information
Filtering and System Identification
A Least Squares Approach
, pp. 292 - 344
Publisher: Cambridge University Press
Print publication year: 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×