Aryl Boronic Acid Catalysed Dehydrative Substitution of Benzylic Alcohols for C−O Bond Formation

A combination of pentafluorophenylboronic acid and oxalic acid catalyses the dehydrative substitution of benzylic alcohols with a second alcohol to form new C−O bonds. This method has been applied to the intermolecular substitution of benzylic alcohols to form symmetrical ethers, intramolecular cyclisations of diols to form aryl-substituted tetrahydrofuran and tetrahydropyran derivatives, and intermolecular crossed-etherification reactions between two different alcohols. Mechanistic control experiments have identified a potential catalytic intermediate formed between the aryl boronic acid and oxalic acid.     

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.     

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.