Addition of a Silyl Ketene Acetal to α,β-Unsaturated Cyclic Anhydrides

Addition of [1-methoxy-2 methyl-1-propenyl)-oxy] trimethylsilane (MTS) to unsymmetrical α,β-unsaturated cyclic anhydrides (namely, itaconic anhydride and citraconic anhydride) as well as symmetrical anhydrides (namely, maleic anhydride and 2,3-dimethylmaleic anhydride) was investigated. Itaconic anhydride isomerizes to citraconic anhydride in the presence of MTS. In the presence of Lewis acid catalysts (Yb(OTf)₃/CH₂Cl₂), MTS adds to itaconic anhydride at room temperature in a 1,4-fashion. 1,2-Addition is the preferred pathway with both 2,3-dimethyl maleic anhydride and citraconic anhydride.     

Conjugate Addition of a Silyl Ketene Acetal to α,β‐Unsaturated Lactones

Abstract

Conjugate addition of a silyl ketene acetal [Me₂C?C (OMe)OSiMe₃] to α,β‐unsaturated lactones (namely, 5,6‐dihydro‐2H‐pyran‐2‐one, 2(5H)‐furanone as Michael acceptor) occurs efficiently at room temperature in the presence of a nucleophilic catalyst, tetra‐n‐butyl ammonium bibenzoate (TBABB), in THF as well as Lewis acid catalysts such as Yb(OTf)₃ and I₂ in CH₂Cl₂, giving the corresponding 1,4‐adducts in excellent yields.     

A new efficient technique for solving two-point boundary value problems for integro-differential equations

In this paper, we propose a new efficient method based on a combination of Adomian decomposition method (ADM) and Green’s function for solving second-order boundary value problems (BVPs) for integro-differential equations (IDEs). The proposed method depends on constructing Green’s function before establishing the recursive scheme for the solution components. Unlike the ADM or modified ADM , the proposed method avoids solving a sequence of difficult nonlinear equations (transcendental equations) for the unknown parameters. The proposed method provides a direct recursive scheme for obtaining the series solution with easily calculable components. We also provide a sufficient condition that guarantees a unique solution to the second-order BVPs for IDEs. Convergence and error analysis of the proposed method are also discussed. Convergence analysis is reliable enough to estimate the error bound of the series solution. Some numerical examples are included to demonstrate the accuracy, applicability, and generality of the proposed approach. The numerical results reveal that the proposed method is very effective and simple.     

Superconvergence of Legendre projection methods for the eigenvalue problem of a compact integral operator

In this paper, we consider the Galerkin and collocation methods for the eigenvalue problem of a compact integral operator with a smooth kernel using the Legendre polynomials of degree ≤n. We prove that the error bounds for eigenvalues are of the order O(n^−2r) and the gap between the spectral subspaces are of the orders O(n^−r) in L₂-norm and O(n^1/2−r) in the infinity norm, where r denotes the smoothness of the kernel. By iterating the eigenvectors we show that the iterated eigenvectors converge with the orders of convergence O(n^−2r) in both L₂-norm and infinity norm. We illustrate our results with numerical examples.     

Jacobi Spectral Methods for Volterra-Urysohn Integral Equations of Second Kind with Weakly Singular Kernels

Abstract

In this article, we discuss Jacobi spectral Galerkin and iterated Jacobi spectral Galerkin methods for Volterra-Urysohn integral equations with weakly singular kernels and obtain the convergence results in both the infinity and weighted L²-norm. We show that the order of convergence in iterated Jacobi spectral Galerkin method improves over Jacobi spectral Galerkin method. We obtain the convergence results in two cases when the exact solution is sufficiently smooth and non-smooth. For finding the improved convergence results, we also discuss Jacobi spectral multi-Galerkin and iterated Jacobi spectral multi-Galerkin method and obtain the convergence results in weighted L²-norm. In fact, we prove that the iterated Jacobi spectral multi-Galerkin method improves over iterated Jacobi spectral Galerkin method. We provide numerical results to verify the theoretical results.     

Superconvergence of functional approximation methods for integral equations

In this work, a functional approximation method for calculating the linear functional of the solution of second-kind Fredholm integral equations is developed. When the method is applied to the collocation method or to the multi-projection method, it generates approximations which exhibit superconvergence.     

Wavelet Galerkin method for eigenvalue problem of a compact integral operator

We consider the approximation of eigenfunctions of a compact integral operator with a smooth kernel by the Galerkin method using wavelet bases. By truncating the Galerkin operator, we obtain a sparse representation of a matrix eigenvalue problem. We prove that the error bounds for the eigenvalues and for the distance between the spectral subspaces are of the orders O(nμ^-2nr) and O(μ^-nr), respectively, where μ⁻ⁿ denotes the norm of the partition and r denotes the order of the wavelet basis functions. By iterating the eigenvectors, we show that the error bounds for the eigenvectors are of the order O(nμ^-2nr). We illustrate our results with numerical results.     

Approximate series solution of fourth-order boundary value problems using decomposition method with Green’s function

This paper proposes a new efficient approach for obtaining approximate series solutions to fourth-order two-point boundary value problems. The proposed approach depends on constructing Green’s function and Adomian decomposition method (ADM). Unlike existing methods like ADM or modified ADM, the proposed approach avoids solving a sequence of nonlinear equations for the undetermined coefficients. In fact, the proposed method gives a direct recursive scheme for obtaining approximations of the solution with easily computable components. We also discuss the convergence and error analysis of the proposed scheme. Moreover, several numerical examples are included to demonstrate the accuracy, applicability, and generality of the proposed approach. The numerical results reveal that the proposed method is very effective and simple.     

Richardson extrapolation of iterated discrete projection methods for eigenvalue approximation

In this paper, the eigenvalue approximation of a compact integral operator with a smooth kernel is discussed. We propose asymptotic error expansions of the iterated discrete Galerkin and iterated discrete collocation methods, and asymptotic error expansion of approximate eigenvalues. We then apply Richardson extrapolation to obtain higher order super-convergence of eigenvalue approximations. Numerical examples are presented to illustrate the theoretical estimate.     

Discrete multi-projection methods for eigen-problems of compact integral operators

In this paper, a discrete multi-projection method is developed for solving the eigenvalue problem of a compact integral operator with a smooth kernel. We propose a theoretical framework for analysis of the convergence of these methods. The theory is then applied to establish super-convergence results of the corresponding discrete Galerkin method, collocation method and their iterated solutions. Numerical examples are presented to illustrate the theoretical estimates for the error of these methods.