IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v495y2025ics0096300325000256.html
   My bibliography  Save this article

Decoupled bound-preserving algorithms for compressible Darcy-Brinkman flow with advection-diffusion transport problem in fractured media

Author

Listed:
  • Liu, Wei
  • Li, Kai

Abstract

A coupling of compressible Darcy-Brinkman flow and advection-diffusion transport problem is considered in fractured media. Treating the fracture as hyperplane, we obtain a two-layer reduced coupled model and the whole considered media is divided into low dimensional fracture-interfaces and surrounding high dimensional subdomains. To improve efficiency, two decoupled algorithms are constructed to solve the reduced coupled model. One decoupled algorithm is proposed based on interpolating vectors as inner boundaries and the other is constructed by interpolating scalars as iterative terms. By using both algorithms, the models in each subdomain are solved in parallel. The BDF2 formula and modified upwind scheme are employed to maintain the accuracy. For advection-diffusion model, we develop a novel bound-preserving scheme to keep the concentration within [0,1] combined with finite volume method by the Lagrange multiplier approach. The accuracy and efficiency of the proposed algorithms are verified by numerical experiments including three-dimensional case and benchmark testing.

Suggested Citation

  • Liu, Wei & Li, Kai, 2025. "Decoupled bound-preserving algorithms for compressible Darcy-Brinkman flow with advection-diffusion transport problem in fractured media," Applied Mathematics and Computation, Elsevier, vol. 495(C).
    • Handle: RePEc:eee:apmaco:v:495:y:2025:i:c:s0096300325000256
    DOI: 10.1016/j.amc.2025.129298
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325000256
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129298?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 search for a different version of it.

    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:apmaco:v:495:y:2025:i:c:s0096300325000256. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.