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

Efficient partitioned numerical integrators for myocardial cell models

Author

Listed:
  • Spiteri, Raymond J.
  • Guo, Wenxian

Abstract

Cardiac simulations are often performed by numerically solving the bidomain or monodomain equations. In these simulations, much of the computational workload is devoted to the time integration of the systems of ordinary differential equations that arise from the myocardial cell models. For such time integration, a well-established top choice is the Rush–Larsen (RL) method, which partitions the myocardial cell models according to the gating and non-gating equations and treats them with the exponential Euler method and the forward Euler method, respectively. The partitioning strategy of the RL method is based on previous work by Moore and Ramon, with the main difference being that the Moore–Ramon (MR) method integrates the non-gating equations with Heun’s method, a two-stage, second-order explicit Runge–Kutta (ERK2) method. Although the RL method is less computationally expensive per step than the MR method, it should not be a foregone conclusion that the RL is more efficient. In this paper, we demonstrate that in the MR method typically outperforms the RL method in terms of efficiency. Furthermore, two new families of numerical methods are proposed based on the same partitioning strategy but integrating the non-gating equations with other ERK2 methods and multi-stage, first-order Runge–Kutta–Chebyshev methods, respectively. We show that the RL method is outperformed on 34 out of 36 cell models tested.

Suggested Citation

  • Spiteri, Raymond J. & Guo, Wenxian, 2020. "Efficient partitioned numerical integrators for myocardial cell models," Applied Mathematics and Computation, Elsevier, vol. 366(C).
  • Handle: RePEc:eee:apmaco:v:366:y:2020:i:c:s0096300319307301
    DOI: 10.1016/j.amc.2019.124738
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2019.124738?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:366:y:2020:i:c:s0096300319307301. 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.