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

Numerical evolution of the resistive relativistic magnetohydrodynamic equations: A minimally implicit Runge-Kutta scheme

Author

Listed:
  • Cordero-Carrión, Isabel
  • Santos-Pérez, Samuel
  • Martínez-Vidallach, Clara

Abstract

We present the Minimally-Implicit Runge-Kutta (MIRK) methods for the numerical evolution of the resistive relativistic magnetohydrodynamic (RRMHD) equations, following the approach proposed by Komissarov (2007) of an augmented system of evolution equations to numerically deal with constraints. Previous approaches rely on Implicit-Explicit (IMEX) Runge-Kutta schemes; in general, compared to explicit schemes, IMEX methods need to apply the recovery (which can be very expensive computationally) of the primitive variables from the conserved ones in numerous additional times. Moreover, the use of an iterative process for the recovery could have potential convergence problems, increased by the additional number of required loops. In addition, the computational cost of the previous IMEX approach in comparison with the standard explicit methods is much higher. The MIRK methods are able to deal with stiff terms producing stable numerical evolutions, minimize the number of recoveries needed in comparison with IMEX methods, their computational cost is similar to the standard explicit methods and can actually be easily implemented in numerical codes which previously used explicit schemes. Two standard numerical tests are shown in the manuscript.

Suggested Citation

  • Cordero-Carrión, Isabel & Santos-Pérez, Samuel & Martínez-Vidallach, Clara, 2023. "Numerical evolution of the resistive relativistic magnetohydrodynamic equations: A minimally implicit Runge-Kutta scheme," Applied Mathematics and Computation, Elsevier, vol. 443(C).
  • Handle: RePEc:eee:apmaco:v:443:y:2023:i:c:s0096300322008426
    DOI: 10.1016/j.amc.2022.127774
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2022.127774?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:443:y:2023:i:c:s0096300322008426. 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.