We study a fourth order finite difference method for the unsteady incompressible Navier-Stokes equations in vorticity formulation. The scheme is essentially compact and can be implemented very efficiently. Either Briley’s formula, or a new higher order formula, which will be derived in this paper, can be chosen as the vorticity boundary condition. By formal Taylor expansion, the new formula for the vorticity on the boundary gives 4th order accuracy; while Briley’s formula provides only 3rd order accuracy. However, the use of either formula results in a stable method and achieves full 4th order accuracy. The convergence analysis of the scheme with our new formula will be given in this paper, while that with Briley’s formula has been established in earlier literature. The consistency analysis is easier than that of Briley’s formula, no Strang type analysis is needed. In the stability analysis part, we adopt the technique of controlling some local terms by the diffusion term via discrete elliptic regularity. Physical no-slip boundary conditions are used throughout.

The matrix completion problem is to recover a low-rank matrix from a subset of its entries. The main solution strategy for this problem has been based on nuclear-norm minimization which requires computing singular value decompositionsa task that is increasingly costly as matrix sizes and ranks increase. To improve the capacity of solving large-scale problems, we propose a low-rank factorization model and construct a nonlinear successive over-relaxation (SOR) algorithm that only requires solving a linear least squares problem per iteration. Extensive numerical experiments show that the algorithm can reliably solve a wide range of problems at a speed at least several times faster than many nuclear-norm minimization algorithms. In addition, convergence of this nonlinear SOR algorithm to a stationary point is analyzed.

We present a new Matched Interface and Boundary (MIB) regularization method for treating charge singularity in solvated biomolecules whose electrostatics are described by the Poisson–Boltzmann (PB) equation. In a regularization method, by decomposing the potential function into two or three components, the singular component can be analytically represented by the Green’s function, while other components possess a higher regularity. Our new regularization combines the efficiency of two-component schemes with the accuracy of the three-component schemes. Based on this regularization, a new MIB finite difference algorithm is developed for solving both linear and nonlinear PB equations, where the nonlinearity is handled by using the inexact-Newton’s method. Compared with the existing MIB PB solver based on a three-component regularization, the present algorithm is simpler to implement by circumventing the work to solve a boundary value Poisson equation inside the molecular interface and to compute related interface jump conditions numerically. Moreover, the new MIB algorithm becomes computationally less expensive, while maintains the same second order accuracy. This is numerically verified by calculating the electrostatic potential and solvation energy on the Kirkwood sphere on which the analytical solutions are available and on a series of proteins with various sizes.

In this paper, we consider an interior penalty discontinuous Galerkin (DG) method for the time-dependent Maxwell’s equations in cold plasma. In Huang and Li (J. Sci. Comput., 42 (2009), 321–340), for both semi and fully discrete DG schemes, we proved error estimates which are optimal in the energy norm, but sub-optimal in the L2-norm. Here by filling this gap, we show that these schemes are optimally convergent in the L2-norm on quasi-uniform tetrahedral meshes if the solution is sufficiently smooth.

No abstract uploaded!