Design of controller for Lur’e systems guaranteeing dichotomy

In this paper, the problem of controller design for Lur’e systems guaranteeing dichotomy is investigated. On the basis of Kalman-Yakubovich-Popov (KYP) lemma and two frequency equalities, a new methodology for the dichotomy analysis of the Lur’e systems is proposed. A linear matrix inequality (LMI) based criterion is derived, which is equivalent to the Leonov’s frequency-domain one, while for the dichotomy analysis and synthesis which is more straightforward than the frequency-domain one. In virtue of this result, a dynamic output feedback controller ensuring the dichotomy property for Lur’e systems is designed. Finally a numerical example is included to demonstrate the validity and the applicability of the proposed approach.     

Nonstationary ideal incompressible fluid flows: Conditions of existence and uniqueness of solutions

The problem of formulating minimal conditions on input data that can guarantee the existence and uniqueness of solutions of the boundary value problems describing non-one-dimensional ideal incompressible fluid flow is considered using as an example the initial boundary value problem in a space-time cylinder constructed on a bounded flow domain with the nonpenetration condition on its boundary (which corresponds to fluid flow in a closed vessel). The existence problems are considered only for plane flows, and the uniqueness issues for three-dimensional flows as well. The required conditions are obtained in the form of conditions specifying that the vorticity belongs to definite functional Orlicz spaces. The results are compared with well-known results. Examples are given of admissible types of singularities for which the obtained results are valid, which is a physical interpretation of these results. __________ Translated from Prikladnaya Mekhanika i Tekhnicheskaya Fizika, Vol. 49, No. 4, pp. 130–145, July–August, 2008.     

Geometric Singular Perturbations for Multiple Turning Points: Invariant Manifolds and Exchange Lemmas

In this paper, we consider singularly perturbed systems with multiple sets of turning points. Two types of related results contributing to geometric singular perturbation theory are obtained. The first result establishes a new class of invariant manifolds. The second result consists of several exchange lemmas that characterize the evolution of an invariant manifold passing through the vicinity of the slow manifold.Partially supported by NSF Grants DMS-0071931 and DMS-0406998.     

A Theorem of the Alternative in Banach Lattices

We consider a linear sytem in a Banach lattice and provide a simple theorem of the alternative (or Farkas lemma) without the usual closure condition.

     

A stochastic Ramsey theorem

We establish a stochastic extension of Ramsey's theorem. Any Markov chain generates a filtration relative to which one may define a notion of stopping times. A stochastic colouring is any k-valued (k<∞) colour function defined on all pairs consisting of a bounded stopping time and a finite partial history of the chain truncated before this stopping time. For any bounded stopping time θ and any infinite history ω of the Markov chain, let ω|θ denote the finite partial history up to and including the time θ(ω). Given k=2, for every ?>0, we prove that there is an increasing sequence θ₁<θ₂<? of bounded stopping times having the property that, with probability greater than 1−?, the history ω is such that the values assigned to all pairs (ω|θi,θj), with i<j, are the same. Just as with the classical Ramsey theorem, we also obtain an analogous finitary stochastic Ramsey theorem. Furthermore, with appropriate finiteness assumptions, the time one must wait for the last stopping time (in the finitary case) is uniformly bounded, independently of the probability transitions. We generalise the results to any finite number k of colours.     

Loose Hamilton cycles in hypergraphs

We prove that any k-uniform hypergraph on n vertices with minimum degree at least contains a loose Hamilton cycle. The proof strategy is similar to that used by Kühn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.     

Abel's lemma on summation by parts and basic hypergeometric series

Basic hypergeometric series identities are revisited systematically by means of Abel's lemma on summation by parts. Several new formulae and transformations are also established. The author is convinced that Abel's lemma on summation by parts is a natural choice in dealing with basic hypergeometric series.     

Generalised acyclic edge colourings of graphs with large girth

The r-acyclic edge chromatic number of a graph G is the minimum number of colours required to colour the edges of G in such a way that adjacent edges receive different colours and every cycle C receives at least min{|C|,r} colours. We prove that for any integer r?4, the r-acyclic edge chromatic number of any graph G with maximum degree Δ and with girth at least 3(r-1)Δ is at most 6(r-1)Δ.     

Existence of closed-loop policies for constrained discrete-time linear systems with bounded disturbances

We consider discrete-time linear systems with constraints on both control and state variables and bounded disturbances. We exhibit a closed-form expression of the necessary and sufficient conditions for existence of closed-loop policy. These conditions are linear constraints on the initial state and the bounds on the disturbances, control variables and state variables. A simple illustrative example is presented.