Approximation of multi-scale elliptic problems using patches of finite elements

In this paper we present a method to solve numerically elliptic problems with multi-scale data using multiple levels of not necessarily nested grids. The method consists in calculating successive corrections to the solution in patches whose discretizations are not necessarily conforming. It resembles the FAC method (see Math. Comp. 46 (174) (1986) 439–456) and its convergence is obtained by a domain decomposition technique (see Math. Comp. 57 (195) (1991) 1–21). However it is of much more flexible use in comparison to the latter. To cite this article: R. Glowinski et al., C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Evidences of phase separation in moisture‐cured poly(urethane urea)s by means of temperature modulated differential scanning calorimetry

The degree of phase separation in several moisture‐cured poly(urethane urea)s (PUUs) was studied by FTIR spectroscopy, wide angle X‐ray diffraction (WAXD), and temperature‐modulated differential scanning calorimetry (TMDSC). This latter technique was shown to be particularly useful in analysing the degree of phase separation in PUU polymers. Both phase mixing and phase segregation coexisted in the PUUs and the degree of phase separation increased as the urea hard segment (HS) content in the PUU increased. The maximum solubility of urea HSs into the polyol soft segments (SSs) was achieved for 50 wt % urea HS content in diol‐based PUUs, whereas for triol‐based PUUs the highest solubility between HS and SS was reached for lower urea HS amount. Finally, the higher the urea HS content the higher the extent of phase separation in the PUU. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 3034–3045, 2007     

An algorithm to locate perinatal facilities in the municipality of Rio de Janeiro

In order to reduce infant mortality in the municipality of Rio de Janeiro it is desired to encourage all mothers-to-be to attend the appropriate health care facilities. A 3-level hierarchical prenatal–neonatal health care system is described together with a basic model for optimising accessibility to facilities. A genetic algorithm to solve the basic model is developed and some numerical experience reported. Extensions to the basic model and planned future research are briefly indicated.     

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.     

Preparation and characterization of finely dispersed drugs. 5. Ethyl 3,5-di(acetylamino)-2,4,6-triiodobenzoate

Controlled precipitation of the diagnostic imaging agent ethyl 3,5-di(acetylamino)-2,4,6-triiodobenzoate has been used to produce fine particles of various sizes, morphologies, and degrees of crystallinity, which depended on experimental conditions. In addition, two distinct polymorphic forms of the drug have been fully characterized by single crystal X-ray diffraction studies, and evidence for a third polymorph was also observed. Some of the so prepared dry particles were coated with a thin layer of silica.     

New inequalities from classical Sturm theorems

Inequalities satisfied by the zeros of the solutions of second-order hypergeometric equations are derived through a systematic use of Liouville transformations together with the application of classical Sturm theorems. This systematic study allows us to improve previously known inequalities and to extend their range of validity as well as to discover inequalities which appear to be new. Among other properties obtained, Szegő's bounds on the zeros of Jacobi polynomials for , are completed with results for the rest of parameter values, Grosjean's inequality (J. Approx. Theory 50 (1987) 84) on the zeros of Legendre polynomials is shown to be valid for Jacobi polynomials with |β|1, bounds on ratios of consecutive zeros of Gauss and confluent hypergeometric functions are derived as well as an inequality involving the geometric mean of zeros of Bessel functions.     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

The standard model on non-commutative space-time

We consider the standard model on a non-commutative space and expand the action in the non-commutativity parameter . No new particles are introduced; the structure group is . We derive the leading order action. At zeroth order the action coincides with the ordinary standard model. At leading order in we find new vertices which are absent in the standard model on commutative space-time. The most striking features are couplings between quarks, gluons and electroweak bosons and many new vertices in the charged and neutral currents. We find that parity is violated in non-commutative QCD. The Higgs mechanism can be applied. QED is not deformed in the minimal version of the NCSM to the order considered. Received: 29 November 2001 / Published online: 25 January 2002     

Tracing Possible Structural Asymmetry of Silica Gel Used for Precoating Thin-Layer Chromatography Plates

JPC – Journal of Planar Chromatography – Modern TLC - We have previously described unexpected two-dimensionality in the thin-layer chromatographic separation of pairs of enantiomers of...