IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1085-d1620992.html
   My bibliography  Save this article

Maximum Principle-Preserving Computational Algorithm for the 3D High-Order Allen–Cahn Equation

Author

Listed:
  • Junseok Kim

    (Department of Mathematics, Korea University, Seoul 02841, Republic of Korea)

  • Youngjin Hwang

    (Department of Mathematics, Korea University, Seoul 02841, Republic of Korea)

Abstract

We propose an unconditionally stable computational algorithm that preserves the maximum principle for the three-dimensional (3D) high-order Allen–Cahn (AC) equation. The presented algorithm applies an operator-splitting technique that decomposes the original equation into nonlinear and linear diffusion equations. To guarantee the unconditional stability of the numerical solution, we solve the nonlinear equation using the frozen coefficient technique, which simplifies computations by approximating variable coefficients by constants within small regions. For the linear equation, we use an implicit finite difference scheme under the operator-splitting method. To validate the efficiency of the proposed algorithm, we conducted several computational tests. The numerical results confirm that the scheme achieves unconditional stability even for large time step sizes and high-order polynomial potential. In addition, we analyze motion by mean curvature in three-dimensional space and show that the numerical solutions closely match the analytical solutions. Finally, the robustness of the method is evaluated under noisy data conditions, and its ability to accurately classify complex data structures is demonstrated. These results confirm the efficiency and reliability of the proposed computational algorithm for simulating phase-field models with a high-order polynomial potential.

Suggested Citation

  • Junseok Kim & Youngjin Hwang, 2025. "Maximum Principle-Preserving Computational Algorithm for the 3D High-Order Allen–Cahn Equation," Mathematics, MDPI, vol. 13(7), pages 1-13, March.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1085-:d:1620992
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1085/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/7/1085/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1085-:d:1620992. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.