The immersed boundary method has evolved into one of the most useful computational methods in studying fluid structure interaction. On the other hand, the immersed boundary method is also known to suffer from a severe timestep stability restriction when using an explicit time discretization. In this paper, we propose several efficient semi-implicit schemes to remove this stiffness from the immersed boundary method for the two-dimensional Stokes flow. First, we obtain a novel unconditionally stable semi-implicit discretization for the immersed boundary problem. Using this unconditionally stable discretization as a building block, we derive several efficient semi-implicit schemes for the immersed boundary problem by applying the small scale decomposition to this unconditionally stable discretization. Our stability analysis and extensive numerical experiments show that our semi-implicit schemes offer much better stability property than the explicit scheme. Unlike other implicit or semi-implicit schemes proposed in the literature, our semi-implicit schemes can be solved explicitly in the spectral space. Thus the computational cost of our semi-implicit schemes is comparable to that of an explicit scheme, but with a much better stability property.

Poisson equation on point cloud with Dirichlet boundary condition plays important role in many problems. In this paper, we use the volume constraint proposed by Du et.al to handle the Dirichlet boundary condition in the point integral method for Poisson equation on point cloud. We prove that the solution given by volume constraint converges to the true solution as the point cloud converges to the underlying smooth manifold.

In this paper, we propose a multi-scale discontinuous Galerkin (DG) method for second-order elliptic problems with curvilinear unidirectional rough coefficients by choosing a special non-polynomial approximation space. The key ingredient of the method lies in the incorporation of the local oscillatory features of the differential operators into the approximation space so as to capture the multi-scale solutions without having to resolve the finest scales. The unidirectional feature of the rough coefficients allows us to construct the basis functions of the DG non-polynomial approximation space explicitly, thereby greatly increasing the algorithm efficiency. Detailed error estimates for two-dimensional second-order DG methods are derived, and a general guidance on how to construct such non-polynomial basis is discussed. Numerical examples are also presented to validate and demonstrate the effectiveness of the algorithm.

In this paper, we analyze the stability of the fourth order Runge-Kutta method for integrating semi-discrete approximations of time-dependent partial differential equations. Our study focuses on linear problems and covers general semi-bounded spatial discretizations. A counter example is given to show that the classical four-stage fourth order Runge-Kutta method can not preserve the one-step strong stability, even though the ordinary differential equation system is energy-decaying. But with an energy argument, we show that the strong stability property holds in two steps under an appropriate time step constraint. Based on this fact, the stability extends to general well-posed linear systems. As an application, we utilize the results to examine the stability of the fourth order Runge-Kutta approximations of several specific method of lines schemes for hyperbolic problems, including the spectral Galerkin method and the discontinuous Galerkin method.

In this paper, we propose a simple bound-preserving sweeping procedure for conservative numerical approximations. Conservative schemes are of importance in many applications, yet for high order methods, the numerical solutions do not necessarily satisfy maximum principle. This paper constructs a simple sweeping algorithm to enforce the bound of the solutions. It has a very general framework acting as a postprocessing step accommodating many point-based or cell average-based discretizations. The method is proven to preserve the bounds of the numerical solution while conserving a prescribed quantity designated as a weighted average of values from all points. The technique is demonstrated to work well with a spectral method, high order finite difference and finite volume methods for scalar conservation laws and incompressible flows. Extensive numerical tests in 1D and 2D are provided to verify the accuracy of the sweeping procedure.