A pseudo-spectral based efficient volume penalization scheme for Cahn–Hilliard equation in complex geometries.

In this paper, we have developed an efficient volume penalization based diffuse-filtering scheme to solve variable mobility based Cahn–Hilliard equation in complex geometries. The main novelty of the work is that a dealiased pseudo-spectral scheme with immersed interface method (IIM) is proposed for solving any generalized concentration-dependent mobility function-based Cahn–Hilliard (CH) equation in complicated computational domains. An indicator function based mobility parameter is introduced to perform simulation of binary spinodal decomposition problem at a lower computational expense in complex geometries by solving a single phase field equation. Due to the smooth removal of high frequency Fourier components, the solution of the present RK4 based diffuse-filtering scheme does not display spurious currents when suitable low-pass filtering strategy and adequately resolved mobility indicator are incorporated. The traditional and memory optimized zero padding schemes are also implemented to show the comparative performance of different dealiasing schemes for the variable mobility based Cahn–Hilliard equation. It is found that the diffuse-filtering scheme displays reasonable accuracy similar to the zero padding based schemes but its average CPU time is significantly lower, which indicates better computational performance of the scheme for the variable mobility Cahn–Hilliard equation. Time variation of the characteristic length scale during spinodal decomposition of a binary mixture agrees well with the analytical prediction. The optimal three stage SSPRK3 temporal scheme is employed and it is found that time step size can be increased approximately 1.4 times than the classical RK4 scheme reducing total CPU time. Oscillation free numerical solution and conservation of order parameter are obtained for the complex geometry based spinodal decomposition problem. A radially-averaged structure factor is introduced to quantify resolution issues of the dealiasing schemes for the spinodal decomposition problem in different complex geometries. [ABSTRACT FROM AUTHOR]