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

ACEENs: Enhanced causality-enforced networks with probability-driven adaptive sampling for time-dependent PDEs

Author

Listed:
  • Yang, Xun
  • Ran, Maohua
  • Zhang, Li

Abstract

This paper presents a novel adaptive causality-enforced evolutional networks (ACEENs) framework for solving time-dependent partial differential equations (PDEs). Building upon the baseline CEENs, the framework introduces a probability-driven adaptive sampling strategy, which utilizes residual and gradient information from previous time steps to dynamically refine the mesh discretization in regions critical to solution accuracy. Two specialized implementations are developed: ACEENs I, driven solely by residuals, and ACEENs II, which additionally exploits gradient information for more comprehensive refinement. The ACEENs framework strictly preserves temporal causality. Numerical experiments on four standard problems demonstrate that both ACEENs variants significantly outperform the baseline model in accuracy. Furthermore, computational results based on the Burgers equation further demonstrate that the proposed adaptive sampling method can reduce the variance of the loss estimate, thereby improving training stability. This indicates that the method can effectively capture the steep gradients and transient characteristics of the solution, potentially opening up a new avenue for the numerical simulation of complex time-varying PDEs.

Suggested Citation

  • Yang, Xun & Ran, Maohua & Zhang, Li, 2026. "ACEENs: Enhanced causality-enforced networks with probability-driven adaptive sampling for time-dependent PDEs," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 250(C), pages 1003-1018.
  • Handle: RePEc:eee:matcom:v:250:y:2026:i:c:p:1003-1018
    DOI: 10.1016/j.matcom.2026.07.022
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2026.07.022?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:250:y:2026:i:c:p:1003-1018. 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.