125,192 research outputs found

    Stability of switched linear differential systems

    Get PDF
    We study the stability of switched systems where the dynamic modes are described by systems of higher-order linear differential equations not necessarily sharing the same state space. Concatenability of trajectories at the switching instants is specified by gluing conditions, i.e. algebraic conditions on the trajectories and their derivatives at the switching instant. We provide sufficient conditions for stability based on LMIs for systems with general gluing conditions. We also analyse the role of positive-realness in providing sufficient polynomial-algebraic conditions for stability of two-modes switched systems with special gluing conditions

    On the D-Stability of Linear and Nonlinear Positive Switched Systems

    Get PDF
    We present a number of results on D-stability of positive switched systems. Different classes of linear and nonlinear positive switched systems are considered and simple conditions for D-stability of each class are presented

    Common Lyapunov Function Based on Kullback–Leibler Divergence for a Switched Nonlinear System

    Get PDF
    Many problems with control theory have led to investigations into switched systems. One of the most urgent problems related to the analysis of the dynamics of switched systems is the stability problem. The stability of a switched system can be ensured by a common Lyapunov function for all switching modes under an arbitrary switching law. Finding a common Lyapunov function is still an interesting and challenging problem. The purpose of the present paper is to prove the stability of equilibrium in a certain class of nonlinear switched systems by introducing a common Lyapunov function; the Lyapunov function is based on generalized Kullback–Leibler divergence or Csiszár's I-divergence between the state and equilibrium. The switched system is useful for finding positive solutions to linear algebraic equations, which minimize the I-divergence measure under arbitrary switching. One application of the stability of a given switched system is in developing a new approach to reconstructing tomographic images, but nonetheless, the presented results can be used in numerous other areas

    Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems

    Full text link
    We show that for any positive integer dd, there are families of switched linear systems---in fixed dimension and defined by two matrices only---that are stable under arbitrary switching but do not admit (i) a polynomial Lyapunov function of degree ≤d\leq d, or (ii) a polytopic Lyapunov function with ≤d\leq d facets, or (iii) a piecewise quadratic Lyapunov function with ≤d\leq d pieces. This implies that there cannot be an upper bound on the size of the linear and semidefinite programs that search for such stability certificates. Several constructive and non-constructive arguments are presented which connect our problem to known (and rather classical) results in the literature regarding the finiteness conjecture, undecidability, and non-algebraicity of the joint spectral radius. In particular, we show that existence of an extremal piecewise algebraic Lyapunov function implies the finiteness property of the optimal product, generalizing a result of Lagarias and Wang. As a corollary, we prove that the finiteness property holds for sets of matrices with an extremal Lyapunov function belonging to some of the most popular function classes in controls
    • …
    corecore