IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v518y2026ics0096300325006265.html

Efficient diffusion for high order non-oscillatory entropy stable schemes

Author

Listed:
  • Sahu, Anuradha
  • Pandey, Prashant Kumar
  • Dubey, Ritesh Kumar

Abstract

This paper proposes an efficient approach to construct non-oscillatory entropy stable fluxes (F^) by adding an efficient diffusion term to the entropy conservative fluxes. Computation of proposed diffusion term does not require restrictive and logically expensive sign stability condition on high order reconstruction process or flux sign stability on high order fluxes. The diffusion term is defined as the absolute difference of non-oscillatory (F˘) and entropy conservative fluxes (F˜) multiplied with sign of jump in entropy variable. The amount of diffusion is adjusted using a limiter function without compromising the entropy stability of the resulting scheme which exhibits both high resolution and the non-oscillatory property. The proposed approach is tested on various standard benchmark test problems. Numerical results demonstrate the effectiveness of the method in achieving high resolution entropy stable schemes, Moreover the scheme maintains formal order of accuracy of the lower order flux used in defining the diffusion term.

Suggested Citation

  • Sahu, Anuradha & Pandey, Prashant Kumar & Dubey, Ritesh Kumar, 2026. "Efficient diffusion for high order non-oscillatory entropy stable schemes," Applied Mathematics and Computation, Elsevier, vol. 518(C).
  • Handle: RePEc:eee:apmaco:v:518:y:2026:i:c:s0096300325006265
    DOI: 10.1016/j.amc.2025.129901
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2025.129901?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:apmaco:v:518:y:2026:i:c:s0096300325006265. 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.