Scalable approximation and solvers for ionic electrodiffusion in cellular geometries
Pietro Benedusi, Ada J. Ellingsrud, Halvor Herlyng, Marie E. Rognes
TL;DR
The paper tackles scalable simulation of ionic electrodiffusion in highly detailed brain tissue by formulating the KNP-EMI model with explicit intracellular and extracellular compartments and membrane coupling. It introduces a monolithic, variational finite element discretization with an implicit-explicit time scheme and a block-diagonal AMG-preconditioned GMRES solver, enabling robust performance up to $10^8$ degrees of freedom on large HPC resources. Key contributions include a detailed solver strategy, a four-model benchmark suite spanning idealized and image-based geometries, and comprehensive numerical experiments demonstrating near-optimal strong and weak scalability. The work enables high-fidelity, large-scale in-silico investigations of ion dynamics in brain tissue and provides open-source tooling for future benchmarks and extensions.
Abstract
The activity and dynamics of excitable cells are fundamentally regulated and moderated by extracellular and intracellular ion concentrations and their electric potentials. The increasing availability of dense reconstructions of excitable tissue at extreme geometric detail pose a new and clear scientific computing challenge for computational modelling of ion dynamics and transport. In this paper, we design, develop and evaluate a scalable numerical algorithm for solving the time-dependent and nonlinear KNP-EMI equations describing ionic electrodiffusion for excitable cells with an explicit geometric representation of intracellular and extracellular compartments and interior interfaces. We also introduce and specify a set of model scenarios of increasing complexity suitable for benchmarking. Our solution strategy is based on an implicit-explicit discretization and linearization in time, a mixed finite element discretization of ion concentrations and electric potentials in intracellular and extracellular domains, and an algebraic multigrid-based, inexact block-diagonal preconditioner for GMRES. Numerical experiments with up to $10^8$ unknowns per time step and up to 256 cores demonstrate that this solution strategy is robust and scalable with respect to the problem size, time discretization and number of cores.
