Lagrangian and Eulerian models for simulating turbulent dispersion and coalescence of droplets within a spray

Lagrangian and Eulerian modelling approaches are compared for simulating turbulent dispersion and coalescence of droplets within a spray. Both models predict similar droplet dispersion rates and shifts in droplet size distribution due to coalescence within the spray, over a wide range of droplet and gas flows, and for sprays with different droplet-size distributions at the nozzle exit. The computer time required for simulating coalescence within a steady axisymmetric spray is of a similar order of magnitude regardless of which formulation, Eulerian or Lagrangian, is adopted. However, the Lagrangian formulation is more practical in terms of the range of applicability and ease of implementation.     

Eine Schwefelbestimmungsmethode von allgemeiner Anwendbarkeit

Ohne Zusammenfassung     

Regularity of multiwavelets

The motivation for this paper is an interesting observation made by Plonka concerning the factorization of the matrix symbol associated with the refinement equation for B-splines with equally spaced multiple knots at integers and subsequent developments which relate this factorization to regularity of refinable vector fields over the real line. Our intention is to contribute to this train of ideas which is partially driven by the importance of refinable vector fields in the construction of multiwavelets. The use of subdivision methods will allow us to consider the problem almost entirely in the spatial domain and leads to exact characterizations of differentiability and Hölder regularity in arbitrary L _p spaces. We first study the close relationship between vector subdivision schemes and a generalized notion of scalar subdivision schemes based on bi-infinite matrices with certain periodicity properties. For the latter type of subdivision scheme we will derive criteria for convergence and Hölder regularity of the limit function, which mainly depend on the spectral radius of a bi-infinite matrix induced by the subdivision operator, and we will show that differentiability of the limit functions can be characterized by factorization properties of the subdivision operator. By switching back to vector subdivision we will transfer these results to refinable vectors fields and obtain characterizations of regularity by factorization and spectral radius properties of the symbol associated to the refinable vector field. Finally, we point out how multiwavelets can be generated from orthonormal refinable bi-infinite vector fields.     

Correlated polarization propagator calculations of static polarizabilities

We present a systematic comparison of the correlation contribution at the level of the second-order polarization propagator approximation (SOPPA ) and MP 2 to the static dipole polarizability of (1) Be, BeH^?, BH, CH⁺, MgH^?, AIH, SiH⁺, and GeH⁺; (2) BH₃, CH₄, NH₃, H₂O, HF, BF, and F₂; and (3) N₂, CO, CN^?, HCN, C₂H₂, and HCHO . Fairly extended basis sets were used in the calculations. We find that the agreement with experimental values is improved in SOPPA and MP .2 over the results at the SCF level. The signs and magnitudes of the correlation contribution in SOPPA are similar to those obtained in analytical derivative MP 2 calculations. However, it is not possible to say, in general, which method gives the largest correlation contribution or the best agreement with experiment, nor is it possible to make a priori prediction of the sign of the correlation contribution. For the first group of molecules, which have a quasi-degenerate ground state, additional CCDPPA and CCSDPPA calculations were performed and compared with polarizabilities obtained as analytical/numerical derivatives of the CCD and CCSD energies. The CCSDPPA results were found to be in better agreement with other calculations than were the SOPPA results, demonstrating the necessity of using methods based on infinite-order perturbation theory for these systems. © 1994 John Wiley & Sons, Inc.     

Symmetries of BLT-Sets

We do the tentative beginnings of a study of BLT-sets of generalised quadrangles via their symmetries. In particular, the study of whorls about a line leads us to hyperbolic reflections preserving a BLT-set of Q(4, q).     

Preemptive scheduling of interval orders is polynomial

In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem, for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order.