Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Dynamics of the two-atom Jaynes-Cummings model with nondegenerate two-photon transitions

An exact solution is found for the collective model of two identical two-level atoms that resonantly interact with a two-mode quantum electromagnetic field in an ideal cavity via two-photon nondegenerate transitions. In the case under study, at the initial moment, both field modes are in the coherent state and atoms are in the excited state. The time dependences of the atomic probabilities, the mean number of photons in the modes, and the statistics and squeezing of the photon modes are studied based on the exact solution.     

Images of a Bose-Einstein condensate in position and momentum space

In the Bogoliubov theory, a condensate initially prepared in its ground state described by a stationary Bogoliubov vacuum and later perturbed by a time-dependent potential or interaction strength evolves into a time-dependent excited state which is a dynamical Bogoliubov vacuum. The dynamical vacuum has a simple diagonal form in a time-dependent orthonormal basis of single-particle modes. This diagonal representation leads to a Gaussian probability distribution for possible density-measurement outcomes in position and momentum space.     

An expedient route to diaza-spirocycles utilizing a sequential multicomponent α-aminoallylation/ring-closing metathesis strategy

A general method for the preparation of diaza-spirocycles is reported. This method used an olefin metathesis in order to construct the desired spirocyclic framework. Beginning with commercially available protected amino ketones, this strategy ultimately produced pharmacologically relevant diaza-scaffolds in an efficient and high-yielding process.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

High-throughput screening of fuel cell electrocatalysts

The drawbacks of our earlier report of preparing fuel cell catalyst arrays by borohydride reduction of inkjet prepared arrays of metal salts are discussed along with the need for inclusion of state-of-the-art metrics in all array screening. An alternative method for screening of hydrogen/air cathode catalysts, direct methanol fuel cell (DMFC) anode catalysts, and catalyst loading studies is provided. State-of-the-art Johnson Matthey catalysts were used in control experiments to demonstrate the utility of the array fuel cell for high throughput screening of fuel cell catalysts in the 3-4 mg/cm² range. This report lays out hard learned rules for high throughput screening and demonstrates that the array fuel cell can be used for very precise screening of libraries of membrane electrode assembly (MEA) components without the pitfalls discussed in the introduction.     

Polynomial-time computation of the degree of a dominant morphism in zero characteristic. II

Consider a projective algebraic variety W which is an irreducible component of the set of all common zeros of a family of homogeneous polynomials of degrees less than d in n + 1 variables over a field of zero characteristic. Consider a dominant rational morphism from W to W′ given by homogeneous polynomials of degree d′. We suggest algorithms for constructing objects in general position related to this morphism. They generalize some algorithms from the first part of the paper to the case dim W > dim W′. These algorithms are deterministic and polynomial in (dd′)n and the size of the input. Bibliography: 12 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 325, 2005, pp. 181–224.