Fast Multi-Order Computation of System Matrices in Subspace-Based System Identification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Control Engineering Practice Year : 2012

Fast Multi-Order Computation of System Matrices in Subspace-Based System Identification

Abstract

Subspace methods have proven to be efficient for the identification of linear time-invariant systems, especially applied to mechanical , civil or aeronautical structures in operation conditions. Therein, system identification results are needed at multiple (over-specified) model orders in order to distinguish the true structural modes from spurious modes using the so-called stabilization diagrams. In this paper, new efficient algorithms are derived for this multi-order system identification with subspace-based identification algorithms and the closely related Eigensystem Realization Algorithm. It is shown that the new algorithms are significantly faster than the conventional algorithms in use. They are demonstrated on the system identification of a large-scale civil structure.
Fichier principal
Vignette du fichier
fastSSI.pdf (569.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00724068 , version 1 (20-04-2020)

Identifiers

Cite

Michael Döhler, Laurent Mevel. Fast Multi-Order Computation of System Matrices in Subspace-Based System Identification. Control Engineering Practice, 2012, 20 (9), pp.882-894. ⟨10.1016/j.conengprac.2012.05.005⟩. ⟨hal-00724068⟩
208 View
174 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More