Beyond Stereoselectivity,Switchable Catalysis: Some of the Last Frontier Challenges in Ring‐Opening Polymerization of Cyclic Esters

Metal‐based catalysts and initiators have played a pivotal role in the ring‐opening polymerization (ROP) of cyclic esters, thanks to their high activity and remarkable ability to control precisely the architectures of the resulting polyesters in terms of molar mass, dispersity, microstructure, or tacticity. Today, after two decades of extensive research, the field is slowly reaching maturity. However, several challenges remain, while original concepts have emerged around new types or new applications of catalysis. This Review is not intended to comprehensively cover all of these aspects. Rather, it provides a personal overview of the very recent progress achieved in some selected, important aspects of ROP catalysis—stereocontrol and switchable catalysis. Hence, the first part addresses the development of new metal‐based catalysts for the isoselective ROP of racemic lactide towards stereoblock copolymers, and the use of syndioselective ROP metal catalysts to control the monomer sequence in copolymers. A second part covers the development of ROP catalysts—primarily metal‐based catalysts, but also organocatalysts—that can be externally regulated by the use of chemical or photo stimuli to switch them between two states with different catalytic abilities. Current challenges and opportunities are highlighted.     

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.