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

Unconditionally stable higher order semi-implicit level set method for advection equations

Author

Listed:
  • Frolkovič, Peter
  • Gajdošová, Nikola

Abstract

We present compact semi-implicit finite difference schemes on structured grids for numerical solutions of advection by an external velocity and by a speed in the normal direction that are applicable in level set methods. The recommended numerical scheme is third order accurate for the linear advection in the 2D case with a space dependent velocity. Using a combination of analytical and numerical tools in the von Neumann stability analysis, the third order scheme is claimed to be unconditionally stable. We also present a simple high-resolution scheme that gives a TVD (Total Variation Diminishing) approximation of the spatial derivative for the advected level set function in the 1D case. In the case of nonlinear advection, a semi-implicit discretization is proposed to linearize the problem. The compact implicit part of the stencil of numerical schemes contains unknowns only in the upwind direction. Consequently, algebraic solvers like the fast sweeping method can be applied efficiently to solve the resulting algebraic systems. Numerical tests to evolve a smooth and non-smooth interface and an example with a large variation of the velocity confirm the good accuracy of the third order scheme even in the case of very large Courant numbers. The advantage of the high-resolution scheme is documented for examples where the advected level set functions contain large jumps in the gradient.

Suggested Citation

  • Frolkovič, Peter & Gajdošová, Nikola, 2024. "Unconditionally stable higher order semi-implicit level set method for advection equations," Applied Mathematics and Computation, Elsevier, vol. 466(C).
  • Handle: RePEc:eee:apmaco:v:466:y:2024:i:c:s009630032300629x
    DOI: 10.1016/j.amc.2023.128460
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2023.128460?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:466:y:2024:i:c:s009630032300629x. 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.