Fast-array recursive closed-loop subspace model identification

41Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a subspace model identification algorithm is presented that can be implemented recursively to track slowly time-varying linear systems operating in open loop and closed loop. Particular attention is paid to the computational cost and tracking performance of the developed identification algorithm. The identification problem is described by only two linear problems. The computational complexity is reduced by using array algorithms to solve these linear problems and exploiting the structure in the vectors. This results in a fast implementation of the developed recursive identification algorithm. The effectiveness of the proposed algorithm in comparison with existing methods is emphasized with a simulation study on a time-varying closed-loop system. © 2009 IFAC.

Cite

CITATION STYLE

APA

Houtzager, I., Van Wingerden, J. W., & Verhaegen, M. (2009). Fast-array recursive closed-loop subspace model identification. In IFAC Proceedings Volumes (IFAC-PapersOnline) (Vol. 15, pp. 96–101). https://doi.org/10.3182/20090706-3-FR-2004.0158

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