A time‐accurate pseudo‐compressibility approach based on an unstructured hybrid finite volume technique applied to unsteady turbulent premixed flame propagation

A preconditioning approach based on the artificial compressibility formulation is extended to solve the governing equations for unsteady turbulent reactive flows with heat release, at low Mach numbers, on an unstructured hybrid grid context. Premixed reactants are considered and a flamelet approach for combustion modelling is adopted using a continuous quenched mean reaction rate. An overlapped cell‐vertex finite volume method is adopted as a discretisation scheme. Artificial dissipation terms for hybrid grids are explicitly added to ensure a stable, discretised set of equations. A second‐order, explicit, hybrid Runge–Kutta scheme is applied for the time marching in pseudo‐time. A time derivative of the dependent variable is added to recover the time accuracy of the preconditioned set of equations. This derivative is discretised by an implicit, second‐order scheme. The resulting scheme is applied to the calculation of an infinite planar (one‐dimensional) turbulent premixed flame propagating freely in reactants whose turbulence is supposed to be frozen, homogeneous and isotropic. The accuracy of the results obtained with the proposed method proves to be excellent when compared to the data available in the literature. Copyright © 2004 John Wiley & Sons, Ltd.     

Hollow latex particles as submicrometer reactors for polymerization in confined geometries

A method was developed for free‐radical polymerization in the confines of a hollow latex particle. Hollow particles were prepared via the dynamic swelling method from polystyrene seed and divinylbenzene and had hollows of 500–1000 nm. So that these hollow poly(divinylbenzene) particles could function as submicrometer reactors, the particles were filled with a monomer (N‐isopropylacrylamide) via the dispersion of the dried particles in the molten monomer. The monomer that was not contained in the hollows was removed by washing and gentle abrasion. Free‐radical polymerization was then initiated by γ radiolysis in the solid state. Transmission electron microscopy showed that poly(N‐isopropylacrylamide) formed in the hollow interior of the particles, which functioned as submicrometer reactors. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 5706–5713, 2004     

PSL2(59) is a Subgroup of the Monster

A computer construction of the Monster is used to prove thatPSL(2, 59) is a subgroup of the Monster.     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.     

Metric Embeddings—Beyond One-Dimensional Distortion

The extensive study of metric spaces and their embeddings has so far focused on embeddings that preserve pairwise distances. A very intriguing concept introduced by Feige allows us to quantify the extent to which larger structures are preserved by a given embedding. We investigate this concept, focusing on several major graph families such as paths, trees, cubes, and expanders. We find some similarities to the regular (pairwise) distortion, as well as some striking differences.     

Local adsorption sites and bondlength changes in Ni(1 0 0)/H/CO and Ni(1 0 0)/CO

The local adsorption geometry of CO adsorbed in different states on Ni(1 0 0) and on Ni(1 0 0) precovered with atomic hydrogen has been determined by C 1s (and O 1s) scanned-energy mode photoelectron diffraction, using the photoelectron binding energy changes to characterise the different states. The results confirm previous spectroscopic assignments of local atop and bridge sites both with and without coadsorbed hydrogen. The measured Ni–C bondlengths for the Ni(1 0 0)/CO states show an increase of 0.16 ± 0.04 Å in going from atop to bridge sites, while comparison with similar results for Ni(1 1 1)/CO for threefold coordinated adsorption sites show a further lengthening of the bond by 0.05 ± 0.04 Å. These changes in the Ni–CO chemisorption bondlength with bond order (for approximately constant adsorption energy) are consistent with the standard Pauling rules. However, comparison of CO adsorbed in the atop geometry with and without coadsorbed hydrogen shows that the coadsorption increases the Ni–C bondlength by only 0.06 ± 0.04 Å, despite the decrease in adsorption energy of a factor of 2 or more. This result is also reproduced by density functional theory slab calculations. The results of both the experiments and the density functional theory calculations show that CO adsorption onto the Ni(1 0 0)/H surface is accompanied by significant structural modification; the low desorption energy may then be attributed to the energy cost of this restructuring rather than weak local bonding.     

Space time-index plots for probing dynamical nonstationarity

We propose a simple method to efficiently probe dynamical nonstationarity in observed time series. In a space time-index plot, the density distributions as a function of normalized time-index are V-shaped due to nonstationarity. We show that this method is workable for short data sets and typical examples are illustrated.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.