Paper Info
Title
Identifiability of discrete-time linear switched systems
Abstract
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.
Year
DOI
Venue
2010
10.1145/1755952.1755973
Automatica
Keywords
Field
DocType
sufficient condition,semi-algebraic parametrizations,structural identifiability,system identification method,system identification,system identification algorithm,parametrized lsss,identifiability,hybrid systems
Mathematical optimization,Parametrization,Identifiability,Control theory,Discrete time and continuous time,System identification,Hybrid system,Mathematics
Conference
Citations 
PageRank 
References 
7
0.60
12
Authors
3
Name
Order
Citations
PageRank
M. Petreczky16713.14
Laurent Bako213414.80
Jan H. van Schuppen335845.36