Nano palladium supported on high‐surface‐area metal–organic framework MIL‐101: an efficient catalyst for Sonogashira coupling of aryl and heteroaryl bromides with alkynes

Palladium nanoparticle‐incorporated metal–organic framework MIL‐101 (Pd/MIL‐101) was successfully synthesized and characterized using X‐ray diffraction, nitrogen physisorption, X‐ray photoelectron, UV–visible and infrared spectroscopies, and transmission electron microscopy. The characterization techniques confirmed high porosity and high surface area of MIL‐101 and high stability of nano‐size palladium particles. Pd/MIL‐101 nanocomposite was investigated for the Sonogashira cross‐coupling reaction of aryl and heteroaryl bromides with various alkynes under copper‐free conditions. The reusability of the catalyst was tested for up to four cycles without any significant loss in catalytic activity. Copyright © 2015 John Wiley & Sons, Ltd.     

Single Crystal to Single Crystal (SC‐to‐SC) Transformation from a Nonporous to Porous Metal–Organic Framework and Its Application Potential in Gas Adsorption and Suzuki Coupling Reaction through Postmodification

A new amino‐functionalized strontium–carboxylate‐based metal–organic framework (MOF) has been synthesized that undergoes single crystal to single crystal (SC‐to‐SC) transformation upon desolvation. Both structures have been characterized by single‐crystal X‐ray analysis. The desolvated structure shows an interesting 3D porous structure with pendent ?NH₂ groups inside the pore wall, whereas the solvated compound possesses a nonporous structure with DMF molecules on the metal centers. The amino group was postmodified through Schiff base condensation by pyridine‐2‐carboxaldehyde and palladium was anchored on that site. The modified framework has been utilized for the Suzuki cross‐coupling reaction. The compound shows high activity towards the C?C cross‐coupling reaction with good yields and turnover frequencies. Gas adsorption studies showed that the desolvated compound had permanent porosity and was microporous in nature with a BET surface area of 2052 m² g^?1. The material also possesses good CO₂ (8 wt %) and H₂ (1.87 wt %) adsorption capabilities.     

Diastereoselective Cyclobutenol Synthesis: A Heterogeneous Palladium-Catalyzed Oxidative Carbocyclization-Borylation of Enallenols

A highly selective and efficient oxidative carbocyclization/borylation of enallenols catalyzed by palladium immobilized on amino-functionalized siliceous mesocellular foam (Pd-AmP-MCF) was developed for diastereoselective cyclobutenol synthesis. The heterogeneous palladium catalyst can be recovered and recycled without any observed loss of activity or selectivity. The high diastereoselectivity of the reaction is proposed to originate from a directing effect of the enallenol hydroxyl group. Optically pure cyclobutenol synthesis was achieved by the heterogeneous strategy by using chiral enallenol obtained from kinetic resolution.     

Transformation of malonic acid adsorbed on a clay-mineral by gamma irradiation

The effect of clay on the radiolysis of malonic acid solutions was studied. The results showed an enhanced of decarboxylation rather than condensation reactions.     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

An efficient numerical scheme for precise time integration of a diffusion-dissolution/precipitation chemical system

A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.

     

Semi‐analytical integration of the 8‐node plane element stiffness matrix using symbolic computation

The semi‐analytical integration of an 8‐node plane strain finite element stiffness matrix is presented in this work. The element is assumed to be super‐parametric, having straight sides. Before carrying out the integration, the integral expressions are classified into several groups, thus avoiding duplication of calculations. Symbolic manipulation and integration is used to obtain the basic formulae to evaluate the stiffness matrix. Then, the resulting expressions are postprocessed, optimized, and simplified in order to reduce the computation time. Maple symbolic‐manipulation software was used to generate the closed expressions and to develop the corresponding Fortran code. Comparisons between semi‐analytical integration and numerical integration were made. It was demonstrated that semi‐analytical integration required less CPU time than conventional numerical integration (using Gaussian‐Legendre quadrature) to obtain the stiffness matrix. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Numerical solution of the three‐dimensional parabolic equation with an integral condition

Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.