148,350 research outputs found

    Numerical Solution of ODEs and the Columbus' Egg: Three Simple Ideas for Three Difficult Problems

    Full text link
    On computers, discrete problems are solved instead of continuous ones. One must be sure that the solutions of the former problems, obtained in real time (i.e., when the stepsize h is not infinitesimal) are good approximations of the solutions of the latter ones. However, since the discrete world is much richer than the continuous one (the latter being a limit case of the former), the classical definitions and techniques, devised to analyze the behaviors of continuous problems, are often insufficient to handle the discrete case, and new specific tools are needed. Often, the insistence in following a path already traced in the continuous setting, has caused waste of time and efforts, whereas new specific tools have solved the problems both more easily and elegantly. In this paper we survey three of the main difficulties encountered in the numerical solutions of ODEs, along with the novel solutions proposed.Comment: 25 pages, 4 figures (typos fixed

    A Unified Approach to High-Gain Adaptive Controllers

    Get PDF
    It has been known for some time that proportional output feedback will stabilize MIMO, minimum-phase, linear time-invariant systems if the feedback gain is sufficiently large. High-gain adaptive controllers achieve stability by automatically driving up the feedback gain monotonically. More recently, it was demonstrated that sample-and-hold implementations of the high-gain adaptive controller also require adaptation of the sampling rate. In this paper, we use recent advances in the mathematical field of dynamic equations on time scales to unify and generalize the discrete and continuous versions of the high-gain adaptive controller. We prove the stability of high-gain adaptive controllers on a wide class of time scales

    Global synchronization for discrete-time stochastic complex networks with randomly occurred nonlinearities and mixed time delays

    Get PDF
    Copyright [2010] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discrete-time stochastic complex networks with randomly occurred nonlinearities (RONs) and time delays. The discrete-time complex networks under consideration are subject to: (1) stochastic nonlinearities that occur according to the Bernoulli distributed white noise sequences; (2) stochastic disturbances that enter the coupling term, the delayed coupling term as well as the overall network; and (3) time delays that include both the discrete and distributed ones. Note that the newly introduced RONs and the multiple stochastic disturbances can better reflect the dynamical behaviors of coupled complex networks whose information transmission process is affected by a noisy environment (e.g., Internet-based control systems). By constructing a novel Lyapunov-like matrix functional, the idea of delay fractioning is applied to deal with the addressed synchronization analysis problem. By employing a combination of the linear matrix inequality (LMI) techniques, the free-weighting matrix method and stochastic analysis theories, several delay-dependent sufficient conditions are obtained which ensure the asymptotic synchronization in the mean square sense for the discrete-time stochastic complex networks with time delays. The criteria derived are characterized in terms of LMIs whose solution can be solved by utilizing the standard numerical software. A simulation example is presented to show the effectiveness and applicability of the proposed results

    On the linear stability of the inviscid Kármán vortex street

    Get PDF
    The classical point-vortex model for a Kármán vortex street is linearly stable only for an isolated case. This property has been shown numerically to hold for other, more complicated, models of the same flow. It is shown here that it is a consequence of the Hamiltonian structure of the model, related to the codimension of the set of matrices with a particular Jordan block structure in the space of Hamiltonian matrices, and that it can be expected to hold generically for any two-dimensional inviscid array of vortices that has back-to-fore symmetry, and that is 'close enough' to the point-vortex model

    Revisiting the Complexity of Stability of Continuous and Hybrid Systems

    Full text link
    We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using first-order formulas over the real numbers, and reduce stability problems to the delta-decision problems of these formulas. The framework allows us to obtain a precise characterization of the complexity of different notions of stability for nonlinear continuous and hybrid systems. We prove that bounded versions of the stability problems are generally decidable, and give upper bounds on their complexity. The unbounded versions are generally undecidable, for which we give upper bounds on their degrees of unsolvability
    corecore