IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i11p2589-d1164416.html
   My bibliography  Save this article

On Reusing the Stages of a Rejected Runge-Kutta Step

Author

Listed:
  • Vladislav N. Kovalnogov

    (Laboratory of Inter-Disciplinary Problems of Energy Production, Ulyanovsk State Technical University, 32 Severny Venetz Street, 432027 Ulyanovsk, Russia)

  • Ruslan V. Fedorov

    (Laboratory of Inter-Disciplinary Problems of Energy Production, Ulyanovsk State Technical University, 32 Severny Venetz Street, 432027 Ulyanovsk, Russia)

  • Tamara V. Karpukhina

    (Laboratory of Inter-Disciplinary Problems of Energy Production, Ulyanovsk State Technical University, 32 Severny Venetz Street, 432027 Ulyanovsk, Russia)

  • Theodore E. Simos

    (Laboratory of Inter-Disciplinary Problems of Energy Production, Ulyanovsk State Technical University, 32 Severny Venetz Street, 432027 Ulyanovsk, Russia
    Center for Applied Mathematics and Bioinformatics, Gulf University for Science and Technology, West Mishref 32093, Kuwait
    Department of Medical Research, China Medical University Hospital, China Medical University, Taichung City 40402, Taiwan
    Data Recovery Key Laboratory of Sichun Province, Neijiang Normal University, Neijiang 641100, China)

  • Charalampos Tsitouras

    (General Department, National & Kapodistrian University of Athens, Euripus Campus, 34400 Evia, Greece)

Abstract

Runge-Kutta (RK) pairs are amongst the most popular methods for numerically solving Initial Value Problems. While using an RK pair, we may experience rejection of some steps through the interval of integration. Traditionally, all of the evaluations are then dropped, and we proceed with a completely new round of computations. In this work, we propose avoiding this waste and continuing by reusing the rejected RK stages. We focus especially on an RK pair of orders six and five. After step rejection, we reuse all the previously evaluated stages and only add three new stages. We proceed by evaluating the output using a smaller step. By this technique, we manage to significantly reduce the cost in a set of problems that are known to pose difficulties in RK algorithms with changing step sizes.

Suggested Citation

  • Vladislav N. Kovalnogov & Ruslan V. Fedorov & Tamara V. Karpukhina & Theodore E. Simos & Charalampos Tsitouras, 2023. "On Reusing the Stages of a Rejected Runge-Kutta Step," Mathematics, MDPI, vol. 11(11), pages 1-10, June.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:11:p:2589-:d:1164416
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/11/2589/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/11/2589/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:11:y:2023:i:11:p:2589-:d:1164416. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.