IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v221y2024icp222-243.html
   My bibliography  Save this article

An error predict-correction formula of the load vector in the BSLM for solving three-dimensional Burgers’ equations

Author

Listed:
  • Park, Sangbeom
  • Jeon, Yonghyeon
  • Kim, Philsu
  • Bak, Soyoon

Abstract

This paper aims to develop an algorithm reducing the computational cost of the backward semi-Lagrangian method for solving nonlinear convection–diffusion equations. For this goal, we introduce an error predict-correction formula (EPCF) of the load term for the Helmholtz system. The EPCF is built up to involve the same values as solving the perturbed Cauchy problem, which allows the reuse of the values. These reuses dramatically reduce the computational cost by eliminating the interpolation processes to evaluate the load term in most computational domains. The algorithm also produces a stable solution, even where the original solution has a sharp gradient, by introducing an indicator to distinguish the sharpness of the solution. Furthermore, the proposed algorithm discusses fast solvers of the discrete systems for the perturbed Cauchy problem, for which we utilize an eigenvalue decomposition theory. To show the adaptability and efficiency of the proposed algorithm, we apply it to the convection–diffusion equations such as two and three-dimensional viscous Burgers’ equations. Through several simulations, we confirm that the proposed algorithm for the load term radically reduces the computational cost, and the indicator for stiff components guarantees precision.

Suggested Citation

  • Park, Sangbeom & Jeon, Yonghyeon & Kim, Philsu & Bak, Soyoon, 2024. "An error predict-correction formula of the load vector in the BSLM for solving three-dimensional Burgers’ equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 221(C), pages 222-243.
  • Handle: RePEc:eee:matcom:v:221:y:2024:i:c:p:222-243
    DOI: 10.1016/j.matcom.2024.03.001
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2024.03.001?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:matcom:v:221:y:2024:i:c:p:222-243. 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.