A third order exponential time differencing numerical scheme for no-slope-selection epitaxial thin film model with energy stability

202206 bcfcAccepted ManuscriptRGCPublishe

Energy Stable Numerical Schemes for Ternary Cahn-Hilliard System

We present and analyze a uniquely solvable and unconditionally energy stable numerical scheme for the ternary Cahn-Hilliard system, with a polynomial pattern nonlinear free energy expansion. One key difficulty is associated with presence of the three mass components, though a total mass constraint reduces this to two components. Another numerical challenge is to ensure the energy stability for the nonlinear energy functional in the mixed product form, which turns out to be non-convex, non-concave in the three-phase space. to overcome this subtle difficulty, we add a few auxiliary terms to make the combined energy functional convex in the three-phase space, and this, in turn, yields a convex-concave decomposition of the physical energy in the ternary system. Consequently, both the unique solvability and the unconditional energy stability of the proposed numerical scheme are established at a theoretical level. in addition, an optimal rate convergence analysis in the ℓ∞(0,T;HN-1)∩ℓ2(0,T;HN1) norm is provided, with Fourier pseudo-spectral discretization in space, which is the first such result in this field. to deal with the nonlinear implicit equations at each time step, we apply an efficient preconditioned steepest descent (PSD) algorithm. a second order accurate, modified BDF scheme is also discussed. a few numerical results are presented, which confirm the stability and accuracy of the proposed numerical scheme

Positive and energy stable schemes for Poisson-Nernst-Planck equations and related models

In this thesis, we design, analyze, and numerically validate positive and energy- dissipating schemes for solving Poisson-Nernst-Planck (PNP) equations and Fokker-Planck (FP) equations with interaction potentials. These equations play an important role in modeling the dynamics of charged particles in semiconductors and biological ion channels, as well as in other applications. These model equations are nonlinear/nonlocal gradient flows in density space, and their explicit solutions are rarely available; however, solutions to such problems feature intrinsic properties such as (i) solution positivity, (ii) mass conservation, and (iii) energy dissipation. These physically relevant properties are highly desirable to be preserved at the discrete level with the least time-step restrictions. We first construct our schemes for a reduced PNP model, then extend to multi-dimensional PNP equations and a class of FP equations with interaction potentials. The common strategies in the construction of the baseline schemes include two ingredients: (i) reformulation of each underlying model so that the resulting system is more suitable for constructing positive schemes, and (ii) integration of semi-implicit time discretization and central spatial discretization. For each model equation, we show that the semi-discrete schemes (continuous in time) preserve all three solution properties (positivity, mass conservation, and energy dissipation). The fully discrete first order schemes preserve solution positivity and mass conservation for arbitrary time steps. Moreover, there exists a discrete energy function which dissipates along time marching with an $O(1)$ bound on time steps. We show that the second order (in both time and space) schemes preserve solution positivity for suitably small time steps; for larger time steps, we apply a local limiter to restore the solution positivity. We prove that such limiter preserves local mass and does not destroy the approximation accuracy. In addition, the limiter provides a reliable way of restoring solution positivity for other high order conservative finite difference or finite volume schemes. Both the first and second order schemes are linear and can be efficiently implemented without resorting to any iteration method. The second order schemes are only slight modifications of the first order schemes. Computational costs of a single time step for first and second order schemes are similar, hence our second-order in time schemes are efficient than the first-order in time schemes, given a larger time step could be utilized (to save computational cost). We conduct extensive numerical tests that support our theoretical results and illustrate the accuracy, efficiency, and capacity to preserve the solution properties of our schemes