A Simple Benchmark Problem for the Numerical Methods of the Cahn–Hilliard Equation

We present a very simple benchmark problem for the numerical methods of the Cahn–Hilliard (CH) equation. For the benchmark problem, we consider a cosine function as the initial condition. The periodic sinusoidal profile satisfies both the homogeneous and periodic boundary conditions. The strength of...

Full description

Bibliographic Details
Main Authors: Yibao Li, Chaeyoung Lee, Jian Wang, Sungha Yoon, Jintae Park, Junseok Kim
Format: Article
Language:English
Published: Hindawi Limited 2021-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2021/8889603
id doaj-a5549903526f4ca4b45ef858f9825ce8
record_format Article
spelling doaj-a5549903526f4ca4b45ef858f9825ce82021-03-22T00:04:37ZengHindawi LimitedDiscrete Dynamics in Nature and Society1607-887X2021-01-01202110.1155/2021/8889603A Simple Benchmark Problem for the Numerical Methods of the Cahn–Hilliard EquationYibao Li0Chaeyoung Lee1Jian Wang2Sungha Yoon3Jintae Park4Junseok Kim5School of Mathematics and StatisticsDepartment of MathematicsSchool of Mathematics and StatisticsDepartment of MathematicsDepartment of MathematicsDepartment of MathematicsWe present a very simple benchmark problem for the numerical methods of the Cahn–Hilliard (CH) equation. For the benchmark problem, we consider a cosine function as the initial condition. The periodic sinusoidal profile satisfies both the homogeneous and periodic boundary conditions. The strength of the proposed problem is that it is simpler than the previous works. For the benchmark numerical solution of the CH equation, we use a fourth-order Runge–Kutta method (RK4) for the temporal integration and a centered finite difference scheme for the spatial differential operator. Using the proposed benchmark problem solution, we perform the convergence tests for an unconditionally gradient stable scheme via linear convex splitting proposed by Eyre and the Crank–Nicolson scheme. We obtain the expected convergence rates in time for the numerical schemes for the one-, two-, and three-dimensional CH equations.http://dx.doi.org/10.1155/2021/8889603
collection DOAJ
language English
format Article
sources DOAJ
author Yibao Li
Chaeyoung Lee
Jian Wang
Sungha Yoon
Jintae Park
Junseok Kim
spellingShingle Yibao Li
Chaeyoung Lee
Jian Wang
Sungha Yoon
Jintae Park
Junseok Kim
A Simple Benchmark Problem for the Numerical Methods of the Cahn–Hilliard Equation
Discrete Dynamics in Nature and Society
author_facet Yibao Li
Chaeyoung Lee
Jian Wang
Sungha Yoon
Jintae Park
Junseok Kim
author_sort Yibao Li
title A Simple Benchmark Problem for the Numerical Methods of the Cahn–Hilliard Equation
title_short A Simple Benchmark Problem for the Numerical Methods of the Cahn–Hilliard Equation
title_full A Simple Benchmark Problem for the Numerical Methods of the Cahn–Hilliard Equation
title_fullStr A Simple Benchmark Problem for the Numerical Methods of the Cahn–Hilliard Equation
title_full_unstemmed A Simple Benchmark Problem for the Numerical Methods of the Cahn–Hilliard Equation
title_sort simple benchmark problem for the numerical methods of the cahn–hilliard equation
publisher Hindawi Limited
series Discrete Dynamics in Nature and Society
issn 1607-887X
publishDate 2021-01-01
description We present a very simple benchmark problem for the numerical methods of the Cahn–Hilliard (CH) equation. For the benchmark problem, we consider a cosine function as the initial condition. The periodic sinusoidal profile satisfies both the homogeneous and periodic boundary conditions. The strength of the proposed problem is that it is simpler than the previous works. For the benchmark numerical solution of the CH equation, we use a fourth-order Runge–Kutta method (RK4) for the temporal integration and a centered finite difference scheme for the spatial differential operator. Using the proposed benchmark problem solution, we perform the convergence tests for an unconditionally gradient stable scheme via linear convex splitting proposed by Eyre and the Crank–Nicolson scheme. We obtain the expected convergence rates in time for the numerical schemes for the one-, two-, and three-dimensional CH equations.
url http://dx.doi.org/10.1155/2021/8889603
work_keys_str_mv AT yibaoli asimplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT chaeyounglee asimplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT jianwang asimplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT sunghayoon asimplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT jintaepark asimplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT junseokkim asimplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT yibaoli simplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT chaeyounglee simplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT jianwang simplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT sunghayoon simplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT jintaepark simplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
AT junseokkim simplebenchmarkproblemforthenumericalmethodsofthecahnhilliardequation
_version_ 1714772560775741440