Sciweavers

Share
HYBRID
2010
Springer

Identifiability of discrete-time linear switched systems

9 years 7 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the boundaries of applicability of any system identification method; no system identification algorithm can properly estimate the parameters of a system which is not identifiable. We present necessary and sufficient conditions that guarantee structural identifiability for parametrized LSSs. We also introduce the class of semi-algebraic parametrizations, for which these conditions can be checked effectively. Categories and Subject Descriptors J.2 [Computer applications]: Physical sciences and engineering; I.6.5 [Simulation and Modeling]: Model development General Terms Theory,Measurement Keywords hybrid systems, linear switched systems, identifiability, structural identifiability, realization theory
Mihály Petreczky, Laurent Bako, Jan H. van
Added 13 Oct 2010
Updated 13 Oct 2010
Type Conference
Year 2010
Where HYBRID
Authors Mihály Petreczky, Laurent Bako, Jan H. van Schuppen
Comments (0)
books