Optimized Semi-implicit Methods for Modeling Cardiac Propagation

被引:0
|
作者
Khan, Riasat [1 ]
Ng, Kwong T. [2 ]
机构
[1] North South Univ, Dept Elect & Comp Engn, Dhaka, Bangladesh
[2] New Mexico State Univ, Dept Elect & Comp Engn, Las Cruces, NM 88003 USA
来源
APPLIED COMPUTATIONAL ELECTROMAGNETICS SOCIETY JOURNAL | 2019年 / 34卷 / 10期
关键词
Derivative-free optimization method; monodomain model; operator split method; pattern search algorithm; semi-implicit scheme; MONODOMAIN;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Computer simulation of cardiac electrophysiology is now considered a powerful tool for exploring the causes of cardiac arrhythmias Cardiac electric propagation has been studied using the monodomain model to describe wave propagation of action potential in the heart. The governing nonlinear reaction-diffusion partial differential equation is solved with the semi-implicit (implicit-explicit) method that does not have the stability limit of the explicit time-stepping scheme. Both first order and second order semi-implicit techniques for temporal discretization are considered in this paper. Second order finite difference technique is used to discretize the spatial derivatives. An explicit finite difference scheme with 512X512 nodes and 0.1 us time step is used as the benchmark for error calculation. APPSPACK, a parallel pattern search optimization software, is used to obtain the optimal semi-implicit parameters that give the lowest root-meansquare error. Results are presented for the semi-implicit techniques with or without the operator split or protective zone method. They demonstrate that the optimized second order semi-implicit method gives the best overall performance.
引用
收藏
页码:1616 / 1619
页数:4
相关论文
共 50 条
  • [21] SEMI-IMPLICIT REDUCED MAGNETOHYDRODYNAMICS
    KRESS, ME
    RIEDEL, KS
    JOURNAL OF COMPUTATIONAL PHYSICS, 1989, 83 (01) : 237 - 239
  • [22] Implicit and semi-implicit second-order time stepping methods for the Richards equation
    Keita, Sana
    Beljadid, Abdelaziz
    Bourgault, Yves
    ADVANCES IN WATER RESOURCES, 2021, 148
  • [23] SEMI-IMPLICIT METHODS BASED ON INFLOW IMPLICIT AND OUTFLOW EXPLICIT TIME DISCRETIZATION OF ADVECTION
    Frolkovic, Peter
    PROCEEDINGS OF THE CONFERENCE ALGORITMY 2016, 2016, : 165 - 174
  • [24] On the efficiency of semi-implicit and semi-Lagrangian spectral methods for the calculation of incompressible flows
    Xu, CJ
    Pasquetti, R
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, 2001, 35 (03) : 319 - 340
  • [25] Semi-implicit methods for advection equations with explicit forms of numerical solution
    Peter Frolkovič
    Svetlana Krišková
    Michaela Rohová
    Michal Žeravý
    Japan Journal of Industrial and Applied Mathematics, 2022, 39 : 843 - 867
  • [26] Numerical Analysis of Memristor-Based Circuits with Semi-Implicit Methods
    Butusov, Denis N.
    Ostrovskii, Valerii Y.
    Pesterev, Dmitrii O.
    PROCEEDINGS OF THE 2017 IEEE RUSSIA SECTION YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING CONFERENCE (2017 ELCONRUS), 2017, : 271 - 276
  • [27] Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations
    Bu, Sunyoung
    Huang, Jingfang
    Minion, Michael L.
    PROCEEDINGS OF THE 15TH AMERICAN CONFERENCE ON APPLIED MATHEMATICS AND PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL AND INFORMATION SCIENCES 2009, VOLS I AND II, 2009, : 95 - +
  • [28] NON-LINEAR CONTRACTIVITY OF A CLASS OF SEMI-IMPLICIT MULTISTEP METHODS
    STREHMEL, K
    WEINER, R
    COMPUTING, 1983, 31 (04) : 371 - 381
  • [29] Second-order semi-implicit projection methods for micromagnetics simulations
    Xie, Changjian
    Garcia-Cervera, Carlos J.
    Wang, Cheng
    Zhou, Zhennan
    Chen, Jingrun
    JOURNAL OF COMPUTATIONAL PHYSICS, 2020, 404 (404)
  • [30] Semi-implicit methods for advection equations with explicit forms of numerical solution
    Frolkovic, Peter
    Kriskova, Svetlana
    Rohova, Michaela
    Zeravy, Michal
    JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2022, 39 (03) : 843 - 867