Consistency of a linear system of inequalities

We show that a consistency check of a linear system of inequalitiesAxb reduces to check whetherQb0 for a certain matrixQ. It is a direct consequence of the Farkas-Minkowski theorem. Thus, when one has to check consistency for different values ofb, one need not run a numerical algorithm for eachb.On leave at the Electronics Research Laboratory of the University of California at Berkeley in a CNRS/NSF Exchange Program.     

Reachable and controllable sets for two-dimensional,linear, discrete-time systems

We consider two-dimensional discrete-time linear systems with constrained controls. We propose a simple polynomial time procedure to give an exact external representation of theN-step reachable set and controllable set. The bounding hyperplanes are explicitly derived in terms of the data of the problem. By using a result in computational geometry, all the calculations are made in polynomial time in contrast to classical methods. The limit case asN is also investigated.     

Proposed search for a fourth neutrino with a PBq antineutrino source

Several observed anomalies in neutrino oscillation data can be explained by a hypothetical fourth neutrino separated from the three standard neutrinos by a squared mass difference of a few eV(2). We show that this hypothesis can be tested with a PBq (ten kilocurie scale) (144)Ce or (106)Ru antineutrino beta source deployed at the center of a large low background liquid scintillator detector. In particular, the compact size of such a source could yield an energy-dependent oscillating pattern in event spatial distribution that would unambiguously determine neutrino mass differences and mixing angles.     

On Polynomial Optimization Over Non-compact Semi-algebraic Sets

The optimal value of a polynomial optimization over a compact semi-algebraic set can be approximated as closely as desired by solving a hierarchy of semidefinite programs and the convergence is finite generically under the mild assumption that a quadratic module generated by the constraints is Archimedean. We consider a class of polynomial optimization problems with non-compact semi-algebraic feasible sets, for which an associated quadratic module, that is generated in terms of both the objective function and the constraints, is Archimedean. For such problems, we show that the corresponding hierarchy converges and the convergence is finite generically. Moreover, we prove that the Archimedean condition (as well as a sufficient coercivity condition) can be checked numerically by solving a similar hierarchy of semidefinite programs. In other words, under reasonable assumptions, the now standard hierarchy of semidefinite programming relaxations extends to the non-compact case via a suitable modification.     

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.

     

Automated topology classification method for instantaneous velocity fields

Topological concepts provide highly comprehensible representations of the main features of a flow with a limited number of elements. This paper presents an automated classification method of instantaneous velocity fields based on the analysis of their critical points distribution and feature flow fields. It uses the fact that topological changes of a velocity field are continuous in time to extract large scale periodic phenomena from insufficiently time-resolved datasets. This method is applied to two test-cases : an analytical flow field and PIV planes acquired downstream a wall-mounted cube.     

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.