1 Aalborg University Space Center, The Faculty of Engineering and Science, Aalborg University, VBN2 Automation & Control, The Faculty of Engineering and Science, Aalborg University, VBN3 Aalborg U Robotics, The Faculty of Humanities, Aalborg University, VBN4 Department of Electronic Systems, The Faculty of Engineering and Science, Aalborg University, VBN5 The Faculty of Engineering and Science, Aalborg University, VBN6 Univ Lille Nord de France
In this paper, we present a theoretical analysis of the model reduction algorithm for linear switched systems from Shaker and Wisniewski (2011, 2009) and . This algorithm is a reminiscence of the balanced truncation method for linear parameter varying systems (Wood et al., 1996) . Specifically in this paper, we provide a bound on the approximation error in the L2L2 norm for continuous-time and the l2l2 norm for discrete-time linear switched systems. We provide a system theoretic interpretation of grammians and their singular values. Furthermore, we show that the performance of balanced truncation depends only on the input–output map and not on the choice of the state-space representation. For a class of stable discrete-time linear switched systems (so called strongly stable systems), we define nice controllability and nice observability grammians, which are genuinely related to reachability and controllability of switched systems. In addition, we show that quadratic stability and LMI estimates of the L2L2 and l2l2 gains depend only on the input–output map.
Nonlinear Analysis: Hybrid Systems, 2013, Vol 10, p. 4-20
Switched systems; Model reduction; Balanced truncation; Realization theory