A simple sufficient condition for stability and robust stability of a discrete Lotka-Volterra model

2019 ◽  
Author(s):  
Dragana Lj. Cvetkovic
Keyword(s):  
Robust Stability ◽  
Volterra Model ◽  
Sufficient Condition ◽  
Simple Sufficient Condition

In Search of Weaker Conditions to Insure Robust Stability in Linear Feedback Systems

1991 ◽  
Vol 113 (1) ◽  
pp. 168-170
Author(s):  
Yossi Chait ◽  
Nir Cohen ◽  
C. R. MacCluer
Keyword(s):  
Robust Stability ◽  
Approximation Error ◽  
Maximum Modulus ◽  
Linear Feedback ◽  
Sufficient Condition ◽  
Feedback Systems ◽  
Sector Condition ◽  
Plant Uncertainty ◽  
Weaker Conditions

This paper is concerned with the well-known condition for robust stability of systems with plant uncertainty. It is shown that the usual sufficient condition for robust stability, given in terms of the maximum modulus of the plant approximation error, can be relaxed to a sector condition. This sector condition, related to the phase of the uncertain portion of the plant, can increase the range of the allowed variations in the parameters of the uncertain plant sufficient for robust stability.

scholarly journals A finite model-theoretical proof of a property of bounded query classes within PH

2004 ◽  
Vol 69 (4) ◽  
pp. 1105-1116 ◽  
Author(s):  
Leszek Aleksander Kołodziejczyk
Keyword(s):  
Normal Form ◽  
Model Theory ◽  
Finite Model ◽  
Sufficient Condition ◽  
Finite Model Theory ◽  
Finite Models ◽  
Constructible Function ◽  
Simple Sufficient Condition

Abstract.We use finite model theory (in particular, the method of FM-truth definitions, introduced in [MM01] and developed in [K04], and a normal form result akin to those of [Ste93] and [G97]) to prove:Let m ≥ 2. Then:(A) If there exists k such that NP⊆ Σm TIME(nk)∩ Πm TIME(nk), then for every r there exists kr such that :(B) If there exists a superpolynomial time-constructible function f such that NTIME(f), then additionally .This strengthens a result by Mocas [M96] that for any r, .In addition, we use FM-truth definitions to give a simple sufficient condition for the arity hierarchy to be strict over finite models.

A simple sufficient condition for triviality of obstructions in the orbifold construction for subfactors

2017 ◽  
Vol 121 (1) ◽  
pp. 101
Author(s):  
Toshihiko Masuda
Keyword(s):  
Sufficient Condition ◽  
Principal Graph ◽  
Simple Sufficient Condition ◽  
Orbifold Construction

We present a simple sufficient condition for triviality of obstructions in the orbifold construction. As an application, we can show the existence of subfactors with principal graph $D_{2n}$ without full use of Ocneanu's paragroup theory.

Unfragile Passive Control of Uncertain Sampling System

2013 ◽  
Vol 325-326 ◽  
pp. 1170-1175
Author(s):  
Qing Zhi Liu
Keyword(s):  
Control Problem ◽  
Robust Stability ◽  
Passive Control ◽  
Lyapunov Method ◽  
Linear Matrix ◽  
Sufficient Condition ◽  
Matrix Inequality ◽  
Sampling System ◽  
State Delay ◽  
Index Terms

The unfragile passive control problem of a class of uncertain state-delay sampling system is discussed. Applying Lyapunov method, and combining the properties of matrix inequality, the sufficient condition of robust stability is given, and the unfragile passive controller is designed. Finally a numerical example illustrates the effectiveness and the availability for the design.Index Terms - Uncertain State-delay Sampling System , Linear Matrix Inequility , Unfragile Passive Control .

Unfragile Control of Uncertain State-Delay Sampled-Data System

2012 ◽  
Vol 433-440 ◽  
pp. 7499-7504
Author(s):  
Xue Liang Wang
Keyword(s):  
Control Problem ◽  
Robust Stability ◽  
Lyapunov Method ◽  
Data System ◽  
Sufficient Condition ◽  
Matrix Inequality ◽  
Sampled Data ◽  
State Delay ◽  
Numerical Example

The unfragile control problem of a class of uncertain state-delay sampled system is discussed. Applying Lyapunov method, and combining the properties of matrix inequality, the sufficient condition of robust stability is given, and the unfragile controller is designed. Finally a numerical example illustrates the effectiveness and the availability for the design.

scholarly journals A Restless Bandit Model for Resource Allocation, Competition, and Reservation

2021 ◽  
Author(s):  
Jing Fu ◽  
Bill Moran ◽  
Peter G. Taylor
Keyword(s):  
Resource Allocation ◽  
Numerical Experiments ◽  
Asymptotic Optimality ◽  
Sufficient Condition ◽  
Limited Capacity ◽  
Index Policy ◽  
Asymptotically Optimal ◽  
Restless Bandit ◽  
Simple Sufficient Condition ◽  
Resource Capacity

In “A Restless Bandit Model for Resource Allocation, Competition and Reservation,” J. Fu, B. Moran, and P. G. Taylor study a resource allocation problem with varying requests and with resources of limited capacity shared by multiple requests. This problem is modeled as a set of heterogeneous restless multi-armed bandit problems (RMABPs) connected by constraints imposed by resource capacity. Following Whittle’s idea of relaxing the constraints and Weber and Weiss’s proof of asymptotic optimality, the authors propose an index policy and establish conditions for it to be asymptotically optimal in a regime where both arrival rates and capacities increase. In particular, they provide a simple sufficient condition for asymptotic optimality of the policy and, in complete generality, propose a method that generates a set of candidate policies for which asymptotic optimality can be checked. Via numerical experiments, they demonstrate the effectiveness of these results even in the pre-limit case.

Sign in / Sign up

Export Citation Format

Share Document