Highlights • We present a critical comparison for solving the Allen–Cahn equation. • Numerical solvability and stability are discussed. • We show the pointwise boundedness of the numerical solution. • We demonstrate its usefulness with the numerical experiments. Abstract The goal of this paper is to present a brief review and a critical comparison of the performance of several numerical schemes for solving the Allen–Cahn equation representing a model for antiphase domain coarsening in a binary mixture. Explicit, fully implicit, Crank–Nicolson, and unconditionally gradient stable schemes are considered. In this paper, we show the solvability conditions of the numerical schemes and the decreasing property of total energy using eigenvalues of the Hessian matrix of the energy functional. We also present the pointwise boundedness of the numerical solution for the Allen–Cahn equation. To compare the accuracy and numerical efficiency of these methods, numerical experiments such as traveling wave and motion by mean curvature are performed. Numerical results show that Crank–Nicolson and nonlinearly stabilized splitting schemes are almost close to the analytic solution. However, if a large time step is used in the numerical test, we have only two results with linearly and nonlinearly stabilized splitting schemes in spite of having large gaps between analytic solution and numerical results. The other numerical schemes except for linearly and nonlinearly stabilized splitting schemes have unstable results when large time step is used. Graphical abstract Numerical traveling wave solutions with an initial profile ϕ ( x , 0 ) = 1 - tanh x 2 2 ∊ 4 2 and two different time step sizes at final time T=140h2 T = 140 h 2 . (a) and (b) are results with Δt=0.1h2 Δ t = 0.1 h 2 and 10h2, respectively.

In this paper we consider a vector-valued Allen–Cahn MPEC problem. To derive optimality conditions we exploit a regularization–relaxation technique. The optimality system of the regularized–relaxed subproblems are investigated by applying the classical result of Zowe and Kurcyusz. Finally we show that the stationary points of the regularized–relaxed subproblems converge to weak stationary points of the limit problem.

In this paper, we consider the analytical solution and numerical approximation of the celebrated steady states Allen-Cahn equation. We present a computer code to solve and plot the solutions using Maxima software. (c) 2014 Elsevier Inc. All rights reserved.