Abstract
We present an efficient linear second-order method for a Swift–Hohenberg (SH) type of a partial differential equation having quadratic-cubic nonlinearity on surfaces to simulate pattern formation on surfaces numerically. The equation is symmetric under a change of sign of the density field if there is no quadratic nonlinearity. We introduce a narrow band neighborhood of a surface and extend the equation on the surface to the narrow band domain. By applying a pseudo-Neumann boundary condition through the closest point, the Laplace–Beltrami operator can be replaced by the standard Laplacian operator. The equation on the narrow band domain is split into one linear and two nonlinear subequations, where the nonlinear subequations are independent of spatial derivatives and thus are ordinary differential equations and have closed-form solutions. Therefore, we only solve the linear subequation on the narrow band domain using the Crank–Nicolson method. Numerical experiments on various surfaces are given verifying the accuracy and efficiency of the proposed method.
1. Introduction
A Swift–Hohenberg (SH) type of partial differential equation [1] has been used to study pattern formation [2,3,4,5]:
where is the density field and and are constants. In general, the equation does not have an analytical solution, thus various computational algorithms [6,7,8,9,10,11,12,13] have been proposed to obtain a numerical solution. However, most of them were solved on flat surfaces except [12,13].
In this paper, we present an efficient linear second-order method for the SH type of equation on surfaces, which is based on the closest point method [14,15]. We introduce a narrow band domain of a surface and apply a pseudo-Neumann boundary condition on the boundary of the narrow band domain through the closest point [16]. This results in a constant value of in the direction normal to the surface, thus the Laplace–Beltrami operator can be replaced by the standard Laplacian operator. In addition, we split the equation into one linear and two nonlinear subequations [17,18], where the nonlinear subequations are independent of spatial derivatives and thus are ordinary differential equations and have closed-form solutions. Therefore, we only solve the linear subequation on the narrow band domain using the Crank–Nicolson method. As a result, our method is easy to implement and linear.
This paper is organized as follows. In Section 2, we describe the SH type of equation on a narrow band domain. In Section 3, we propose an efficient linear second-order method for the equation on the narrow band domain. Numerical examples on various surfaces are given in Section 4. Finally, we conclude in Section 5.
2. Swift–Hohenberg Type of Equation on a Narrow Band Domain
The SH type of equation on a surface is given by
where is the Laplace–Beltrami operator [19,20]. Next, let be a -neighborhood of , where is a unit normal vector at . Then, we extend the Equation (1) to the narrow band domain :
with the pseudo-Neumann boundary condition on :
where is a point on , which is closest to [14]. For a sufficiently small , is constant in the direction normal to the surface. Thus, the Laplace–Beltrami operator in can be replaced by the standard Laplacian operator [14], i.e.,
3. Numerical Method
In this section, we propose an efficient linear second-order method for solving Equation (4) with the boundary condition (3). We discretize Equation (4) in that includes . Let be the uniform grid size, where , , and are positive integers. Let be a discrete domain. Let be an approximation of , where is the time step. Let be a discrete narrow band domain, where is a signed distance function for the surface , and are discrete domain boundary points, where . Here, if , and , otherwise.
Equations (5) and (6) are solved analytically and the solutions are given as follows:
respectively. In addition, Equation (7) is solved using the Crank–Nicolson method:
with the boundary condition on :
Here, . The numerical closest point for a point is defined as
In general, is not a grid point in , i.e., , and thus we use trilinear interpolation and take to obtain . The resulting implicit linear discrete system of Equation (8) is solved efficiently using the Jacobi iterative method. We iterate the Jacobi iteration until a discrete -norm of the consecutive error on is less than a tolerance . Here, the discrete -norm on is defined as , where is the cardinality of . Then, the second-order solution of Equation (4) is evolved by five stages [21]
4. Numerical Experiments
4.1. Convergence Test
In order to verify the rate of convergence of the proposed method, we consider the evolution of on a unit sphere. An initial piece of data is
and a signed distance function for the unit sphere is
on . We fix the grid size to and vary for with , , and . Table 1 shows the -errors of and convergence rates with . Here, the errors are computed by comparison with a reference numerical solution using . It is observed that the method is second-order accurate in time. Note that we obtain the same result for .
Table 1.
-errors and convergence rates for .
4.2. Pattern Formation on a Sphere
Unless otherwise stated, we take an initial piece of data as
where is a uniformly distributed random number between and at the grid points, and use , , , , and .
For and 1, Figure 1 and Figure 2 show the evolution of on a sphere with on , respectively. Depending on the value of g, we have different patterns, such as striped (Figure 1) and hexagonal (Figure 2) [11]. Figure 3 shows the energy decay with and 1, where the energy is defined by
Figure 1.
Evolution of with . The yellow and blue regions indicate and , respectively.
Figure 2.
Evolution of with . The yellow and blue regions indicate and , respectively.
Figure 3.
Evolution of on the sphere with and 1.
4.3. Pattern Formation on a Sphere Perturbed by a Spherical Harmonic
In this section, we perform the evolution of on a sphere of center and radius 32 perturbed by a spherical harmonic . Here, and are the polar and azimuthal angles, respectively, and the computational domain is . Figure 4 and Figure 5 show the evolution of with and 1, respectively. From the results in Figure 4 and Figure 5, we can see that our method can solve the SH type of equation on not only simple but also complex surfaces. Figure 6 shows the energy decay with and 1.
Figure 4.
Evolution of with . The yellow and blue regions indicate and , respectively.
Figure 5.
Evolution of with . The yellow and blue regions indicate and , respectively.
Figure 6.
Evolution of on the perturbed sphere with and 1.
4.4. Pattern Formation on a Spindle
Finally, we simulate the evolution of on a spindle that has narrow and sharp tips. The spindle is defined parametrically as
where and , and the computational domain is . Figure 7 and Figure 8 show the evolution of with and 1, respectively. The results in Figure 7 and Figure 8 suggest that pattern formation on a surface having narrow and sharp tips can be simulated by using our method. Figure 9 shows the energy decay with and 1.
Figure 7.
Evolution of with . The yellow and blue regions indicate and , respectively.
Figure 8.
Evolution of with . The yellow and blue regions indicate and , respectively.
Figure 9.
Evolution of on the spindle with and 1.
5. Conclusions
We simulated pattern formation on surfaces numerically by solving the SH type of equation on surfaces by using the efficient linear second-order method. The method was based on the closest point and operator splitting methods and thus was easy to implement and linear. We confirmed that the proposed method gives the desired order of accuracy in time and observed that pattern formation on surfaces is affected by the value of g.
Funding
This work was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2019R1C1C1011112).
Acknowledgments
The corresponding author thanks the reviewers for the constructive and helpful comments on the revision of this article.
Conflicts of Interest
The author declares no conflict of interest.
References
- Swift, J.; Hohenberg, P.C. Hydrodynamic fluctuations at the convective instability. Phys. Rev. A 1977, 15, 319–328. [Google Scholar] [CrossRef]
- Hohenberg, P.C.; Swift, J.B. Effects of additive noise at the onset of Rayleigh–Bénard convection. Phys. Rev. A 1992, 46, 4773–4785. [Google Scholar] [CrossRef] [PubMed]
- Cross, M.C.; Hohenberg, P.C. Pattern formation outside of equilibrium. Rev. Mod. Phys. 1993, 65, 851–1112. [Google Scholar] [CrossRef]
- Rosa, R.R.; Pontes, J.; Christov, C.I.; Ramos, F.M.; Rodrigues Neto, C.; Rempel, E.L.; Walgraef, D. Gradient pattern analysis of Swift–Hohenberg dynamics: Phase disorder characterization. Phys. A 2000, 283, 156–159. [Google Scholar] [CrossRef]
- Hutt, A.; Atay, F.M. Analysis of nonlocal neural fields for both general and gamma-distributed connectivities. Phys. D 2005, 203, 30–54. [Google Scholar] [CrossRef]
- Cheng, M.; Warren, J.A. An efficient algorithm for solving the phase field crystal model. J. Comput. Phys. 2008, 227, 6241–6248. [Google Scholar] [CrossRef]
- Wise, S.M.; Wang, C.; Lowengrub, J.S. An energy-stable and convergent finite-difference scheme for the phase field crystal equation. SIAM J. Numer. Anal. 2009, 47, 2269–2288. [Google Scholar] [CrossRef]
- Gomez, H.; Nogueira, X. A new space–time discretization for the Swift–Hohenberg equation that strictly respects the Lyapunov functional. Commun. Nonlinear Sci. Numer. Simul. 2012, 17, 4930–4946. [Google Scholar] [CrossRef]
- Elsey, M.; Wirth, B. A simple and efficient scheme for phase field crystal simulation. ESAIM: Math. Model. Numer. Anal. 2013, 47, 1413–1432. [Google Scholar] [CrossRef]
- Sarmiento, A.F.; Espath, L.F.R.; Vignal, P.; Dalcin, L.; Parsani, M.; Calo, V.M. An energy-stable generalized-α method for the Swift–Hohenberg equation. J. Comput. Appl. Math. 2018, 344, 836–851. [Google Scholar] [CrossRef]
- Lee, H.G. An energy stable method for the Swift–Hohenberg equation with quadratic–cubic nonlinearity. Comput. Methods Appl. Mech. Eng. 2019, 343, 40–51. [Google Scholar] [CrossRef]
- Matthews, P.C. Pattern formation on a sphere. Phys. Rev. E 2003, 67, 036206. [Google Scholar] [CrossRef] [PubMed]
- Sigrist, R.; Matthews, P. Symmetric spiral patterns on spheres. SIAM J. Appl. Dyn. Syst. 2011, 10, 1177–1211. [Google Scholar] [CrossRef][Green Version]
- Ruuth, S.J.; Merriman, B. A simple embedding method for solving partial differential equations on surfaces. J. Comput. Phys. 2008, 227, 1943–1961. [Google Scholar] [CrossRef]
- Choi, Y.; Jeong, D.; Lee, S.; Yoo, M.; Kim, J. Motion by mean curvature of curves on surfaces using the Allen–Cahn equation. Int. J. Eng. Sci. 2015, 97, 126–132. [Google Scholar] [CrossRef]
- Lee, H.G.; Kim, J. A simple and efficient finite difference method for the phase-field crystal equation on curved surfaces. Comput. Methods Appl. Mech. Eng. 2016, 307, 32–43. [Google Scholar] [CrossRef]
- Pak, D.; Han, C.; Hong, W.-T. Iterative speedup by utilizing symmetric data in pricing options with two risky assets. Symmetry 2017, 9, 12. [Google Scholar] [CrossRef]
- Zong, C.; Tang, Y.; Cho, Y.J. Convergence analysis of an inexact three-operator splitting algorithm. Symmetry 2018, 10, 563. [Google Scholar] [CrossRef]
- Bertalmío, M.; Cheng, L.-T.; Osher, S.; Sapiro, G. Variational problems and partial differential equations on implicit surfaces. J. Comput. Phys. 2001, 174, 759–780. [Google Scholar] [CrossRef]
- Greer, J.B. An improvement of a recent Eulerian method for solving PDEs on general geometries. J. Sci. Comput. 2006, 29, 321–352. [Google Scholar] [CrossRef]
- Strang, G. On the construction and comparison of difference schemes. SIAM J. Numer. Anal. 1968, 5, 506–517. [Google Scholar] [CrossRef]
© 2019 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).