Multi-GPU Acceleration of Interface Problems in FEniCS, with Application to Cardiac Modeling
Abstract
GPU acceleration of finite element assembly is well established for standard formulations, but mixed-dimensional problems, in which volumetric subdomains are coupled via lower-dimensional interfaces, remain unsupported in automated frameworks such as FEniCS. We extend cuDOLFINx, a GPU-enabled extension of the DOLFINx finite element framework, to assemble such interface problems on GPUs while preserving the high-level FEniCS programming model. Combined with GPU-resident Krylov solvers and algebraic multigrid preconditioning, this enables end-to-end GPU execution of the EMI (Extracellular--Membrane--Intracellular) model, an elliptic interface problem from cardiac modeling in which many intracellular subdomains are coupled through membranes. We compare the GPU implementation against a CPU-based one through strong and weak scaling experiments on regular and realistic 3D cardiac geometries with up to 8000 cells and 22 million degrees of freedom. In terms of assembly, a single GH200 node is roughly equivalent to two 144-core CPU nodes in strong scaling, and to two to three nodes in weak scaling, depending on geometry. For the linear solver, performance depends on geometry, preconditioning, and problem scale. On the regular geometry, GPU advantages emerge mainly at larger problem sizes and node counts. On the realistic geometry, with the same algebraic multigrid preconditioner for both architectures, the GPU is faster at all tested scales. The implementation is available as open-source software and applies to other problems with interface coupling.
Related
- A nonmonotone globalization framework for Anderson acceleration for contractive and nonexpansive fixed point problems
- Acceleration for Affine-coupling problems
- Mixed-Precision GPU Acceleration for Large-Scale Minimum Enclosing Ball Problems
- An Immersed Interface Method for Parabolic Interface Problems with Nonlinear Jump Conditions
- A Reduced Coupling-Space Multigrid Schur Preconditioner for Fictitious-Domain Interface Problems
BibTeX
@misc{centofanti2026multigpu,
title = {{Multi-GPU Acceleration of Interface Problems in FEniCS, with Application to Cardiac Modeling}},
author = {Edoardo Centofanti and Benjamin Pachev and Joshua Steyer and James D. Trotter and Pietro Benedusi},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.03181},
eprint = {2611.03181},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.03181},
}
RIS
TY - UNPB
TI - Multi-GPU Acceleration of Interface Problems in FEniCS, with Application to Cardiac Modeling
AU - Edoardo Centofanti
AU - Benjamin Pachev
AU - Joshua Steyer
AU - James D. Trotter
AU - Pietro Benedusi
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.03181
UR - https://arxiv.org/abs/2611.03181
AB - GPU acceleration of finite element assembly is well established for standard formulations, but mixed-dimensional problems, in which volumetric subdomains are coupled via lower-dimensional interfaces, remain unsupported in automated frameworks such as FEniCS. We extend cuDOLFINx, a GPU-enabled extension of the DOLFINx finite element framework, to assemble such interface problems on GPUs while preserving the high-level FEniCS programming model. Combined with GPU-resident Krylov solvers and algebraic multigrid preconditioning, this enables end-to-end GPU execution of the EMI (Extracellular--Membrane--Intracellular) model, an elliptic interface problem from cardiac modeling in which many intracellular subdomains are coupled through membranes. We compare the GPU implementation against a CPU-based one through strong and weak scaling experiments on regular and realistic 3D cardiac geometries with up to 8000 cells and 22 million degrees of freedom. In terms of assembly, a single GH200 node is roughly equivalent to two 144-core CPU nodes in strong scaling, and to two to three nodes in weak scaling, depending on geometry. For the linear solver, performance depends on geometry, preconditioning, and problem scale. On the regular geometry, GPU advantages emerge mainly at larger problem sizes and node counts. On the realistic geometry, with the same algebraic multigrid preconditioner for both architectures, the GPU is faster at all tested scales. The implementation is available as open-source software and applies to other problems with interface coupling.
ER -