No abstract

In this work, a parallel three-dimensional solver for numerical simulations in computational electrocardiology is introduced and studied. The solver is based on the anisotropic Bidomain cardiac model, consisting of a system of two degenerate parabolic reaction–diffusion equations describing the intra and extracellular potentials of the myocardial tissue. This model includes intramural fiber rotation and anisotropic conductivity coefficients that can be fully orthotropic or axially symmetric around the fiber direction. The solver also includes the simpler anisotropic Monodomain model, consisting of only one reaction–diffusion equation. These cardiac models are coupled with a membrane model for the ionic currents, consisting of a system of ordinary differential equations that can vary from the simple FitzHugh–Nagumo (FHN) model to the more complex phase-I Luo–Rudy model (LR1). The solver employs structured isoparametric Q1finite elements in space and a semi-implicit adaptive method in time. Parallelization and portability are based on the PETSc parallel library. Large-scale computations with up to O(107) unknowns have been run on parallel computers, simulating excitation and repolarization phenomena in three-dimensional domains.

No abstract

SUMMARYA model for the active deformation of cardiac tissue considering orthotropic constitutive laws is introduced and studied. In particular, the passive mechanical properties of the myocardium are described by the Holzapfel-Ogden relation, whereas the activation model is based on the concept of active strain. There, an incompatible intermediate configuration is considered, which entails a multiplicative decomposition between active and passive deformation gradients. The underlying Euler-Lagrange equations for minimizing the total energy are written in terms of these deformation factors, where the active part is assumed to depend, at the cell level, on the electrodynamics and on the specific orientation of the cardiomyocytes. The active strain formulation is compared with the classical active stress model from both numerical and modeling perspectives. The well-posedness of the linear system derived from a generic Newton iteration of the original problem is analyzed, and different mechanical activation functions are considered. Taylor-Hood and MINI finite elements are used in the discretization of the overall mechanical problem. The results of several numerical experiments show that the proposed formulation is mathematically consistent and is able to represent the main features of the phenomenon, while allowing savings in computational costs. Copyright

A Balancing Domain Decomposition by Constraints (BDDC) preconditioner for Isogeometric Analysis of scalar elliptic problems is constructed and analyzed by introducing appropriate discrete norms. A main result of this work is the proof that the proposed isogeometric BDDC preconditioner is scalable in the number of subdomains and quasi-optimal in the ratio of subdomain and element sizes. Another main result is the numerical validation of the theoretical convergence rate estimates by carrying out several two- and three-dimensional tests on serial and parallel computers. These numerical experiments also illustrate the preconditioner performance with respect to the polynomial degree and the regularity of the NURBS basis functions, as well as its robustness with respect to discontinuities of the coefficient of the elliptic problem across subdomain boundaries.

Balancing Neumann-Neumann methods are introduced and studied for incompressible Stokes equations discretized with mixed finite or spectral elements with discontinuous pressures. After decomposing the original domain of the problem into nonoverlapping subdomains, the interior unknowns, which are the interior velocity component and all except the constant-pressure component, of each subdomain problem are implicitly eliminated. The resulting saddle point Schur complement is solved with a Krylov space method with a balancing NeumannNeumann preconditioner based on the solution of a coarse Stokes problem with a few degrees of freedom per subdomain and on the solution of local Stokes problems with natural and essential boundary conditions on the subdomains. This preconditioner is of hybrid form in which the coarse problem is treated multiplicatively while the local problems are treated additively. The condition number of the preconditioned operator is independent of the number of subdomains and is bounded from above by the product of the square of the logarithm of the local number of unknowns in each subdomain and a factor that depends on the inverse of the inf-sup constants of the discrete problem and of the coarse subproblem. Numerical results show that the method is quite fast; they are also fully consistent with the theory.

Adaptive numerical methods in space and time are introduced and studied for multiscale cardiac reaction-diffusion models in three dimensions. The evolution of a complete heartbeat, from the excitation to the recovery phase, is simulated with both the anisotropic Bidomain and Monodomain models, coupled with either a variant of the simple FitzHugh-Nagumo model or the more complex phase-I Luo-Rudy ionic model. The simulations are performed with the kardos library, that employs adaptive finite elements in space and adaptive linearly implicit methods in time. The numerical results show that this adaptive method successfully solves these complex cardiac reaction-diffusion models on three-dimensional domains of moderate sizes. By automatically adapting the spatial meshes and time steps to the proper scales in each phase of the heartbeat, the method accurately resolves the evolution of the intra-and extra-cellular potentials, gating variables and ion concentrations during the excitation, plateau and recovery phases.Keywords: reaction-diffusion equations, cardiac Bidomain and Monodomain models, adaptive finite elements, adaptive time integration Recent advances in contemporary cardiac electrophysiology are progressively revealing the complex multiscale structure of the bioelectrical activity of the

In this paper, we study some additive Schwarz methods (ASM) for the p-version finite element method. We consider linear, scalar, self adjoint, second order elliptic problems and quadrilateral elements in the finite element discretization. We prove a constant bound, independent of the degree p and the number of subdomains N, for the condition number of the ASM iteration operator. This optimal result is obtained first in dimension two. It is then generalized to dimension n and to a variant of the method on the interface. Numerical experiments confirming these results are reported. As is the case for other additive Schwarz methods, our algorithms are highly parallel and scalable.