Partial-realization theory and algorithms for linear switched systems: A formal power series approach

2010/10/25 by Mihaly Petreczky, Petreczky, Mihaly, Jan H. van Schuppen +1
Mathematics · #93B15 #93B20 #93B25 #93C99 #FOS: Mathematics #Optimization and Control (math.OC) #math.OC #msc:93B15 #msc:93B20 #msc:93B25 #msc:93C99

paper · pdf · doi:10.48550/arxiv.1010.5160

arxiv created 2010/10/25 · arxiv updated 2010/10/26

Abstract

The paper presents partial-realization theory and realization algorithms for linear switched systems. Linear switched systems are a particular subclass of hybrid systems. We formulate a notion of a partial realization and we present conditions for existence of a minimal partial realization. We propose two partial-realization algorithms and we show that under certain conditions they yield a complete realization. Our main tool is the theory of rational formal power series.

Related

• Realization theory of discrete-time linear switched systems
• Minimal covariance realization and system identification algorithm for a class of stochastic linear switched systems with i.i.d. switching
• On the H₂ norm and iterative model order reduction of linear switched systems
• Analysis of Discrete-Time Switched Linear Systems under Logic Dynamic Switchings
• Extremal storage functions and minimal realizations of discrete-time\n linear switching systems