A polar macroporous sorbent for gas chromatography

Summary The gas chromatographic behaviour of crosslinked macroporous 2-hydroxyethyl methacrylate grafted with 2-methyloxazoline was investigated and the range of applicability of the copolymer was assessed. Retention index values were measured on this copolymer and compared with those obtained on the terpolymer 2-hydroxyethyl methacrylate-ethylene dimethacrylate-acrylonitrile. Rohrschneider constants and efficiency data for selected sorbates are given. The use of this type of polymer in the separation of various types of compounds is documented by various examples.     

Shape sensitivity of a plane crack front

The 3D‐elasticity model of a solid with a plane crack under the stress‐free boundary conditions at the crack is considered. We investigate variations of a solution and of energy functionals with respect to perturbations of the crack front in the plane. The corresponding expansions at least up to the second‐order terms are obtained. The strong derivatives of the solution are constructed as an iterative solution of the same elasticity problem with specified right‐hand sides. Using the expansion of the potential and surface energy, we consider an approximate quadratic form for local shape optimization of the crack front defined by the Griffith criterion. To specify its properties, a procedure of discrete optimization is proposed, which reduces to a matrix variational inequality. At least for a small load we prove its solvability and find a quasi‐static model of the crack growth depending on the loading parameter. Copyright © 2003 John Wiley & Sons, Ltd.     

Novel acrylic macromonomer with amphiphilic character derived from Triton X‐100: Radical copolymerization with methyl methacrylate and thermal properties

This article explores the synthesis of a novel methacrylic macromonomer with an amphiphilic character derived from poly(ethylene glycol) tert‐octylphenyl ether (MT) and its respective homopolymer. To know their reactivity in radical copolymerization reactions with methyl methacrylate (MMA), a model monomer (MTm) was synthesized to determine the reactivity ratios and compare them with the low molar fractions of copolymers of MT with MMA because they were difficult to isolate. They were r_MTm = 0.97 and r_MMA = 0.95. The compositional diagrams when representing the weight fraction of MT and MTm in the feed and the copolymer suggested that a clear correlation exists between the experimental points of the model monomer MTm and the macromonomer MT ones, suggesting that the length of the side poly(ethylene oxide) chain does not affect the reactivity of the methacrylic double bond in the prepared monomers for this type of polymerization reaction. The reactivity ratios of the copolymers have a tendency for the formation of random or Bernoullian copolymers. The glass‐transition temperatures (T_g's) of the prepared copolymers were determined by differential scanning calorimetry, deviated from the Fox equation, and discussed on the basis of treatments that consider the influence of the monomeric units along the copolymer chains, determining the T_g of the corresponding alternating dyads. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1641–1649, 2003     

Mass‐lumping or not mass‐lumping for eigenvalue problems

In this article we analyze the effect of mass‐lumping in the linear triangular finite element approximation of second‐order elliptic eigenvalue problems. We prove that the eigenvalue obtained by using mass‐lumping is always below the one obtained with exact integration. For singular eigenfunctions, as those arising in non convex polygons, we prove that the eigenvalue obtained with mass‐lumping is above the exact eigenvalue when the mesh size is small enough. So, we conclude that the use of mass‐lumping is convenient in the singular case. When the eigenfunction is smooth several numerical experiments suggest that the eigenvalue computed with mass‐lumping is below the exact one if the mesh is not too coarse. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 653–664, 2003     

A Multidimensional Branch-and-Prune Method for Interval Global Optimization

In this paper a new multidimensional extension of the recently developed one-dimensional enclosure method called kite is given for interval global optimization. A more sophisticated version of the pruning technique based on the kite method is introduced. By the new componentwise approach all the one-dimensional theoretical results and procedures can be used in the higher-dimensional case. The possibilities in the implementation of the new algorithm together with numerical results on 40 standard test problems are presented.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Divisible Effect Algebras

Divisible effect algebras and their relations to convex effect algebras and MV-algebras are studied. A categorical equivalence between divisible effect algebras and rational vector spaces is proved. Infinitesimal, sharp and extremal elements in divisible effect algebras are studied and their relations to properties of the state space are shown.     

Steady-state analytical solutions for the lattice boltzmann equation

A general class of analytical solutions of the lattice Boltzmann equation is derived for two-dimensional, steady-state unidirectional flows. A subset of the solutions that verifies the corresponding Navier-Stokes equations is given. It is pointed out that this class includes, e.g., the Couette and the Poiseuille flow but not, e.g., the basic Kolmogorov flow. For steady-state non-unidirectional flows, first and second order solutions of the lattice Boltzmann equation are derived. Practical consequences of the analysis are mentioned. Differences between the technique applied here and those used in some earlier works are emphasized.     

A technique to construct symmetric variable-stepsize linear multistep methods for second-order systems

Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.

     

On the computation of scaling coefficients of Daubechies' wavelets

In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions.