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.     

Quadratic Padé approximants and the intruder state problem of multireference perturbation methods

Simple and quadratic Padé resummation methods are applied to high‐order series from multireference many‐body perturbation theory (MR‐MBPT) calculations using various partitioning schemes (Møller–Plesset, Epstein–Nesbet, and forced degeneracy) to determine their efficacy in resumming slowly convergent or divergent series. The calculations are performed for the ground and low‐lying excited states of (i) CH₂, (ii) BeH₂ at three geometries, and (iii) Be, for which full configuration interaction (CI) calculations are available for comparison. The 49 perturbation series that are analyzed include those with oscillatory and monotonic divergence and convergence, including divergences that arise from either frontdoor or backdoor intruder states. Both the simple and quadratic Padé approximations are found to speed the convergence of slowly convergent or divergent series. However, the quadratic Padé method generally outperforms the simple Padé resummation. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005     

New synthetic route to diaminonitropyrazoles as precursors of energetic materials

Treatment of nitropyrimidine derivatives with (N-substituted) hydrazines (2 equiv.) gave 1-(substituted)-3,5-diamino-4-nitropyrazole, providing a very mild conversion of pyrimidines into pyrazoles. This reaction provided a convenient route to precursors for new efficient and insensitive explosives.     

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.