30,309 research outputs found

    Stochastic Stability Analysis of Discrete Time System Using Lyapunov Measure

    Full text link
    In this paper, we study the stability problem of a stochastic, nonlinear, discrete-time system. We introduce a linear transfer operator-based Lyapunov measure as a new tool for stability verification of stochastic systems. Weaker set-theoretic notion of almost everywhere stochastic stability is introduced and verified, using Lyapunov measure-based stochastic stability theorems. Furthermore, connection between Lyapunov functions, a popular tool for stochastic stability verification, and Lyapunov measures is established. Using the duality property between the linear transfer Perron-Frobenius and Koopman operators, we show the Lyapunov measure and Lyapunov function used for the verification of stochastic stability are dual to each other. Set-oriented numerical methods are proposed for the finite dimensional approximation of the Perron-Frobenius operator; hence, Lyapunov measure is proposed. Stability results in finite dimensional approximation space are also presented. Finite dimensional approximation is shown to introduce further weaker notion of stability referred to as coarse stochastic stability. The results in this paper extend our earlier work on the use of Lyapunov measures for almost everywhere stability verification of deterministic dynamical systems ("Lyapunov Measure for Almost Everywhere Stability", {\it IEEE Trans. on Automatic Control}, Vol. 53, No. 1, Feb. 2008).Comment: Proceedings of American Control Conference, Chicago IL, 201

    Data-Driven Approximation of Transfer Operators: Naturally Structured Dynamic Mode Decomposition

    Full text link
    In this paper, we provide a new algorithm for the finite dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time series data. We argue that existing approach for the finite dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose in this paper preserve these two properties. We call the proposed algorithm as naturally structured DMD since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However preserving positivity properties is critical for capturing the real transient dynamics of the system. This positivity of the transfer operators and it's finite dimensional approximation also has an important implication on the application of the transfer operator methods for controller and estimator design for nonlinear systems from time series data

    Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Holder constants

    Get PDF
    In this paper, the global optimization problem minySF(y)\min_{y\in S} F(y) with SS being a hyperinterval in N\Re^N and F(y)F(y) satisfying the Lipschitz condition with an unknown Lipschitz constant is considered. It is supposed that the function F(y)F(y) can be multiextremal, non-differentiable, and given as a `black-box'. To attack the problem, a new global optimization algorithm based on the following two ideas is proposed and studied both theoretically and numerically. First, the new algorithm uses numerical approximations to space-filling curves to reduce the original Lipschitz multi-dimensional problem to a univariate one satisfying the H\"{o}lder condition. Second, the algorithm at each iteration applies a new geometric technique working with a number of possible H\"{o}lder constants chosen from a set of values varying from zero to infinity showing so that ideas introduced in a popular DIRECT method can be used in the H\"{o}lder global optimization. Convergence conditions of the resulting deterministic global optimization method are established. Numerical experiments carried out on several hundreds of test functions show quite a promising performance of the new algorithm in comparison with its direct competitors.Comment: 26 pages, 10 figures, 4 table
    corecore