Computing stationary states is an important topic for phase field crystal (PFC) models. Great efforts have been made for energy dissipation of the numerical schemes when using gradient flows. However, it is always time-consuming due to the requirement of small effective time steps. In this paper, we propose an adaptive accelerated proximal gradient method for finding the stationary states of PFC models. The energy dissipation is guaranteed and the convergence property is established for the discretized energy functional. Moreover, the connections between generalized proximal operator with classical (semi-)implicit and explicit schemes for gradient flow are given. Extensive numerical experiments, including two three dimensional periodic crystals in Landau-Brazovskii (LB) model and a two dimensional quasicrystal in Lifshitz-Petrich (LP) model, demonstrate that our approach has adaptive time steps which lead to significant acceleration over semi-implicit methods for computing complex structures. Furthermore, our result reveals a deep physical mechanism of the simple LB model via which the sigma phase is first discovered.

We propose a generalized multiscale finite element method (GMsFEM) based on clustering algorithm to study the elliptic PDEs with random coefficients in the multi-query setting. Our method consists of offline and online stages. In the offline stage, we construct a small number of reduced basis functions within each coarse grid block, which can then be used to approximate the multiscale finite element basis functions. In addition, we coarsen the corresponding random space through a clustering algorithm. In the online stage, we can obtain the multiscale finite element basis very efficiently on a coarse grid by using the pre-computed multiscale basis. The new GMsFEM can be applied to multiscale SPDE starting with a relatively coarse grid, without requiring the coarsest grid to resolve the smallest-scale of the solution. The new method offers considerable savings in solving multiscale SPDEs. Numerical results are

In this paper, we develop and analyze the Runge-Kutta discontinuous Galerkin (RKDG) method to solve weakly coupled hyperbolic multi-domain problems. Such problems involve transfer type boundary conditions with discontinuous fluxes between different domains, calling for special techniques to prove stability of the RKDG methods. We prove both stability and error estimates for our RKDG methods on simple models, and then apply them to a biological cell proliferation model \cite{EMSC}. Numerical results are provided to illustrate the good behavior of our RKDG methods.

Surface segmentation is a fundamental problem in computer graphics. It has various applications such as metamorphosis, surface matching, surface compression, 3D shape retrieval, texture mapping, etc. All orientable surfaces are Riemann surfaces, and admit conformal structures. This paper introduces a novel surface segmentation algorithm based on its conformal structure. Each segment can be conformally mapped to a planar rectangle, and the transition maps are planar translations. The segmentation is intrinsic to the surface, independent of the embedding, and consistent for surfaces with similar geometries. By using segmentation based on conformal structure, the mapping between surfaces with arbitrary topologies can be constructed explicitly. The method is rigorous, efficient and automatic. The segmentation can be applied to surface morphing, construct conformal geometry image, convert mesh to Spline

Since the development of Yee scheme back in 1966, it has become one of the most popular simulation tools for modeling electromagnetic wave propagation in various situations.However, its rigorous error analysis on nonuniform rectangular type gridswas carried out until 1994 by Monk and Süli. They showed that theYee scheme is still second-order convergent on a nonuniform mesh even though the local truncation error is only of first order. In this paper, we extend their results to Maxwell’s equations in metamaterials by a simpler proof, and show the second-order superconvergence in space for the trueYee scheme instead of the only semi-discrete form discussed in Monk and Süli’s original work. Numerical results supporting our analysis are presented.