2002
DOI: 10.1109/tbme.2002.804597
|View full text |Cite
|
Sign up to set email alerts
|

Computational techniques for solving the bidomain equations in three dimensions

Abstract: The bidomain equations are the most complete description of cardiac electrical activity. Their numerical solution is, however, computationally demanding, especially in three dimensions, because of the fine temporal and spatial sampling required. This paper methodically examines computational performance when solving the bidomain equations. Several techniques to speed up this computation are examined in this paper. The first step was to recast the equations into a parabolic part and an elliptic part. The parabo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
157
0

Year Published

2004
2004
2018
2018

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 204 publications
(157 citation statements)
references
References 18 publications
0
157
0
Order By: Relevance
“…The monodomain equation for impulse propagation, ƒ⅐G si ƒV m ϭ ␤ sv (C m dV m ͞dt ϩ I ion ), was solved by using a Galerkin finite element method and a linear triangular discretization with internodal distance of 100 m (24). For validation of the interpolation method, a meandering spiral wave was simulated on a 20-mm circular substrate by using the Karma action potential model (25).…”
Section: Methodsmentioning
confidence: 99%
“…The monodomain equation for impulse propagation, ƒ⅐G si ƒV m ϭ ␤ sv (C m dV m ͞dt ϩ I ion ), was solved by using a Galerkin finite element method and a linear triangular discretization with internodal distance of 100 m (24). For validation of the interpolation method, a meandering spiral wave was simulated on a 20-mm circular substrate by using the Karma action potential model (25).…”
Section: Methodsmentioning
confidence: 99%
“…This process of code platform development in parallel by multiple groups has led to a wide range of numerical techniques and solution strategies [13]. Furthermore, each software code is designed for a specific purpose, with customized input and output file formats, specific mesh structures and numerical schemes for the governing equations.…”
Section: Introductionmentioning
confidence: 99%
“…Previous works have considered several variants of these splitting and/or uncoupling techniques. In particular, the uncoupled approach has been considered in [1,22,35,36,45,47,[51][52][53][54]. The splitting of reaction and diffusion terms has been considered in [35,53,54], while a three steps Strang splitting, with reaction -diffusion -reaction steps, has been considered in [22,47,51].…”
Section: Time Discretizationmentioning
confidence: 99%
“…Many different preconditioners have been proposed in order to devise efficient iterative solvers for the linear systems deriving from both the splitting techniques: Symmetric Successive Over Relaxation [32], block diagonal or triangular [6,17,33,34,52], optimized Schwarz [18], multigrid [1,[33][34][35]46,54], multilevel Schwarz [29,30,40,42].…”
Section: Introductionmentioning
confidence: 99%