In this paper we analyze the explicit Runge-Kutta discontinuous Galerkin (RKDG) methods for the semilinear hyperbolic system of a correlated random walk model describing movement of animals and cells in biology. The RKDG methods use a third order explicit total-variation-diminishing Runge-Kutta (TVDRK3) time discretization and upwinding numerical fluxes. By using the energy method, under a standard CFL condition, we obtain $L^2$ stability for general solutions and a priori error estimates when the solutions are smooth enough. The theoretical results are proved for piecewise polynomials with any degree $k \geq 1$. Finally, since the solutions to this system are non-negative, we discuss a positivity-preserving limiter to preserve positivity without compromising accuracy. Numerical results are provided to demonstrate these RKDG methods.

A new augmented method is proposed for elliptic interface problems with a piecewise variable coefficient that has a finite jump across a smooth interface. The main motivation is to get not only a second order accurate solution but also a second order accurate gradient from each side of the interface. Key to the new method is introducing the jump in the normal derivative of the solution as an augmented variable and rewriting the interface problem as a new PDE that consists of a leading Laplacian operator plus lower order derivative terms near the interface. In this way, the leading second order derivative jump relations are independent of the jump in the coefficient that appears only in the lower order terms after the scaling. An upwind type discretization is used for the finite difference discretization at the irregular grid points on or near the interface so that the resulting coefficient matrix is an M-matrix. A multigrid solver is used to solve the linear system of equations, and the GMRES iterative method is used to solve the augmented variable. Second order convergence for the solution and the gradient from each side of the interface is proved in this paper. Numerical examples for general elliptic interface problems confirm the theoretical analysis and efficiency of the new method.

Finding the stationary states of a free energy functional is an important problem in phase field crystal (PFC) models. Many efforts have been devoted to designing numerical schemes with energy dissipation and mass conservation properties. However, most existing approaches are time-consuming due to the requirement of small effective step sizes. In this paper, we discretize the energy functional and propose efficient numerical algorithms for solving the constrained nonconvex minimization problem. A class of gradient-based approaches, which are the so-called adaptive accelerated Bregman proximal gradient (AA-BPG) methods, is proposed, and the convergence property is established without the global Lipschitz constant requirements. A practical Newton method is also designed to further accelerate the local convergence with convergence guarantee. One key feature of our algorithms is that the energy dissipation and mass conservation properties hold during the iteration process. Moreover, we develop a hybrid acceleration framework to accelerate the AA-BPG methods and most of the existing approaches through coupling with the practical Newton method. Extensive numerical experiments, including two three-dimensional periodic crystals in the Landau--Brazovskii (LB) model and a two-dimensional quasicrystal in the Lifshitz--Petrich (LP) model, demonstrate that our approaches have adaptive step sizes which lead to a significant acceleration over many existing methods when computing complex structures.

No abstract uploaded!

Intrinsic curvature flows can be used to design Riemannian metrics by prescribed curvatures. This chapter presents three discrete curvature flow methods that are recently introduced into the engineering fields: the discrete Ricci flow and discrete Yamabe flow for surfaces with various topology, and the discrete curvature flow for hyperbolic 3-manifolds with boundaries. For each flow, we introduce its theories in both the smooth setting and the discrete setting, plus the numerical algorithms to compute it. We also provide a brief survey on their history and their link to some of the engineering applications in computer graphics, computer vision, medical imaging, computer aided design and others.