Singular Switched Systems in Discrete Time: Solvability, Observability, and Reachability Notions

Discrete-time singular (switched) systems, also known as(switched) difference-algebraic equations and discrete-time (switched)descriptor systems, have in general three solvability issues:inconsistent initial values, nonexistence ornonuniqueness of solutions, and noncausalities, which are generallynot desired in applications. To deal with those issues, newsolvability notions are proposed in the study, and the correspondingnecessary and sufficient conditions have been derived with the help of(strictly) index-1 notions. Furthermore, surrogate (switched)systems--ordinary (switched) systems that have equivalentbehavior--have also been established for solvable systems. Byutilizing those surrogate systems, fundamental analysis includingobservability, determinability, reachability, and controllability has also beencharacterized for singular linear (switched) systems. The solvabilitystudy has been extended to singular nonlinear (switched) systems, andmoreover, Lyapunov and incremental stability analyses have beenderived via single and switched Lyapunov function approaches

Balanced truncation for linear switched systems

In this paper, we present a theoretical analysis of the model reduction algorithm for linear switched systems. This algorithm is a reminiscence of the balanced truncation method for linear parameter varying systems. Specifically in this paper, we provide a bound on the approximation error in L2 norm for continuous-time and l2 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 bal- anced 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 L2 and l2 gains depend only on the input-output map.Comment: We have corrected a number of typos and inconsistencies. In addition, we added new results in Theorem

H ∞ sliding mode observer design for a class of nonlinear discrete time-delay systems: A delay-fractioning approach

Copyright @ 2012 John Wiley & SonsIn this paper, the H ∞  sliding mode observer (SMO) design problem is investigated for a class of nonlinear discrete time-delay systems. The nonlinear descriptions quantify the maximum possible derivations from a linear model, and the system states are allowed to be immeasurable. Attention is focused on the design of a discrete-time SMO such that the asymptotic stability as well as the H ∞  performance requirement of the error dynamics can be guaranteed in the presence of nonlinearities, time delay and external disturbances. Firstly, a discrete-time discontinuous switched term is proposed to make sure that the reaching condition holds. Then, by constructing a new Lyapunov–Krasovskii functional based on the idea of ‘delay fractioning’ and by introducing some appropriate free-weighting matrices, a sufficient condition is established to guarantee the desired performance of the error dynamics in the specified sliding mode surface by solving a minimization problem. Finally, an illustrative example is given to show the effectiveness of the designed SMO design scheme

Reduced realizations and model reduction for switched linear systems:a time-varying approach

In the last decades, switched systems gained much interest as a modeling framework in many applications. Due to a large number of subsystems and their high-dimensional dynamics, such systems result in high complexity and challenges. This motivates to find suitable reduction methods that produce simplified models which can be used in simulation and optimization instead of the original (large) system. In general, the study aims to find a reduced model for a given switched system with a fixed switching signal and known mode sequence. This thesis concerns first the reduced realization of switched systems with known mode sequence which has the same input-output behavior as original switched systems. It is conjectured that the proposed reduced system has the smallest order for almost all switching time duration. Secondly, a model reduction method is proposed for switched systems with known switching signals which provide a good model with suitable thresholds for the given switched system. The quantitative information for each mode is carried out by defining suitable Gramians and, these Gramians are exploited at the midpoint of the given switching time duration. Finally, balanced truncation leads to a modewise reduction. Later, a model reduction method for switched differential-algebraic equations in continuous time is proposed. Thereto, a switched linear system with jumps and impulses is constructed which has the identical input-output behavior as original systems. Finally, a model reduction approach for singular linear switched systems in discrete time is studied. The choice of initial/final values of the reachability and observability Gramians are also investigated

Model Reduction by Moment Matching for Linear Switched Systems

Two moment-matching methods for model reduction of linear switched systems (LSSs) are presented. The methods are similar to the Krylov subspace methods used for moment matching for linear systems. The more general one of the two methods, is based on the so called "nice selection" of some vectors in the reachability or observability space of the LSS. The underlying theory is closely related to the (partial) realization theory of LSSs. In this paper, the connection of the methods to the realization theory of LSSs is provided, and algorithms are developed for the purpose of model reduction. Conditions for applicability of the methods for model reduction are stated and finally the results are illustrated on numerical examples.Comment: Sent for publication in IEEE TAC, on October 201

Realization Theory for LPV State-Space Representations with Affine Dependence

In this paper we present a Kalman-style realization theory for linear parameter-varying state-space representations whose matrices depend on the scheduling variables in an affine way (abbreviated as LPV-SSA representations). We deal both with the discrete-time and the continuous-time cases. We show that such a LPV-SSA representation is a minimal (in the sense of having the least number of state-variables) representation of its input-output function, if and only if it is observable and span-reachable. We show that any two minimal LPV-SSA representations of the same input-output function are related by a linear isomorphism, and the isomorphism does not depend on the scheduling variable.We show that an input-output function can be represented by a LPV-SSA representation if and only if the Hankel-matrix of the input-output function has a finite rank. In fact, the rank of the Hankel-matrix gives the dimension of a minimal LPV-SSA representation. Moreover, we can formulate a counterpart of partial realization theory for LPV-SSA representation and prove correctness of the Kalman-Ho algorithm. These results thus represent the basis of systems theory for LPV-SSA representation.Comment: The main difference with respect to the previous version is as follows: typos have been fixe