Fractional damping enhances chaos in the nonlinear Helmholtz oscillator

Nonlinear Dynamics - The main purpose of this paper is to study both the underdamped and the overdamped dynamics of the nonlinear Helmholtz oscillator with a fractional-order damping. For that...     

Highly Selective Copper‐Catalyzed Asymmetric [3+2] Cycloaddition of Azomethine Ylides with Acyclic 1,3‐Dienes

The first examples of the catalytic asymmetric 1,3‐dipolar cycloaddition of azomethine ylides with acyclic activated 1,3‐dienes (and 1,3‐enynes) are described. Under copper catalysis, a selective cycloaddition at the terminal γ,δ‐C?C bond is observed. In addition, depending on the ligand used, either the exo or the endo adduct can be obtained with high selectivity. Under appropriate reaction conditions, the acyclic 1,6‐addition product is detected, suggesting a stepwise mechanism. The resulting C4‐alkenyl‐substituted pyrrolidines are suitable substrates for further access to polycyclic systems, as highlighted by the preparation of hexahydrochromeno[4,3‐b]pyrrole and the tetracyclic core of the alkaloid gracilamine.     

GDME-based methodology for the determination of free formaldehyde in cosmetics and hygiene products containing formaldehyde releasers

Analytical and Bioanalytical Chemistry - Formaldehyde is often applied in the industrial production of different products, such as textiles, insulation materials, or cosmetics, due to its...     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

Spectral boundary controllability of networks of strings

In this Note we give a necessary and sufficient condition for the spectral controllability from one simple node of a general network of strings that undergoes transversal vibrations in a sufficiently large time. This condition asserts that no eigenfunction vanishes identically on the string that contains the controlled node. The proof combines the Beurling–Malliavin's theorem and an asymptotic formula for the eigenvalues of the network. The optimal control time may be characterized as twice the sum of the lengths of all the strings of the network. To cite this article: R. Dáger, E. Zuazua, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 545–550.