IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v247y2026icp500-522.html

A maximum-preserving high-order scheme with relaxed constraints for the space-fractional Allen–Cahn equation

Author

Listed:
  • Zhang, Yuxin
  • Ding, Hengfei
  • Luo, Xianbing

Abstract

In this paper, we investigate the numerical solution of the space-fractional Allen–Cahn equation, a fundamental model widely used to describe phase separation phenomena in material science and fluid dynamics. Our work begins by re-deriving a fourth-order numerical differentiation formula for approximating the Riesz derivative, developed from the perspective of generating functions. For time discretization, we employ the Crank–Nicolson method and introduce a novel technique to handle the nonlinear term effectively. By integrating these approaches, a new fully discrete finite difference scheme is constructed, achieving high-order accuracy in both space and time. One of the key contributions of this study is the design of a second-order approximation for the nonlinear term. This construction not only preserves structural properties but also enables the establishment of a discrete maximum principle and energy stability under less stringent conditions compared to the existing methods. Moreover, a rigorous theoretical analysis is provided, confirming that the proposed scheme attains the expected convergence order of Oτ2+h4. Finally, the theoretical findings are validated through a series of comprehensive numerical experiments. The results robustly demonstrate the method’s practical effectiveness, corroborating its high accuracy and computational efficiency.

Suggested Citation

  • Zhang, Yuxin & Ding, Hengfei & Luo, Xianbing, 2026. "A maximum-preserving high-order scheme with relaxed constraints for the space-fractional Allen–Cahn equation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 247(C), pages 500-522.
  • Handle: RePEc:eee:matcom:v:247:y:2026:i:c:p:500-522
    DOI: 10.1016/j.matcom.2026.03.034
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475426001266
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2026.03.034?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:matcom:v:247:y:2026:i:c:p:500-522. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.