An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiology

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Feder, Marco, Africa, Pasquale Claudio
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911642333216768
author Feder, Marco
Africa, Pasquale Claudio
author_facet Feder, Marco
Africa, Pasquale Claudio
contents This work presents a novel agglomeration-based multilevel preconditioner designed to accelerate the convergence of iterative solvers for linear systems arising from the discontinuous Galerkin discretization of the monodomain model in cardiac electrophysiology. The proposed approach exploits general polytopic grids at coarser levels, obtained through the agglomeration of elements from an initial, potentially fine, mesh. By leveraging a robust and efficient agglomeration strategy, we construct a nested hierarchy of grids suitable for multilevel solver frameworks. The effectiveness and performance of the methodology are assessed through a series of numerical experiments on two- and three-dimensional domains, involving different ionic models and realistic unstructured geometries. The results demonstrate strong solver effectiveness and favorable scalability with respect to both the polynomial degree of the discretization and the number of levels selected in the multigrid preconditioner.
format Preprint
id arxiv_https___arxiv_org_abs_2602_16312
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiology
Feder, Marco
Africa, Pasquale Claudio
Numerical Analysis
This work presents a novel agglomeration-based multilevel preconditioner designed to accelerate the convergence of iterative solvers for linear systems arising from the discontinuous Galerkin discretization of the monodomain model in cardiac electrophysiology. The proposed approach exploits general polytopic grids at coarser levels, obtained through the agglomeration of elements from an initial, potentially fine, mesh. By leveraging a robust and efficient agglomeration strategy, we construct a nested hierarchy of grids suitable for multilevel solver frameworks. The effectiveness and performance of the methodology are assessed through a series of numerical experiments on two- and three-dimensional domains, involving different ionic models and realistic unstructured geometries. The results demonstrate strong solver effectiveness and favorable scalability with respect to both the polynomial degree of the discretization and the number of levels selected in the multigrid preconditioner.
title An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiology
topic Numerical Analysis
url https://arxiv.org/abs/2602.16312