58.6NAMay 4
An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiologyMarco Feder, Pasquale Claudio Africa
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.
55.3NAMar 13
Augmented Lagrangian preconditioners for fictitious domain formulations of elliptic interface problemsMichele Benzi, Marco Feder, Luca Heltai et al.
We present a novel augmented Lagrangian (AL) preconditioner for the solution of linear systems arising from finite element discretizations of elliptic interface problems with jump coefficients. The method is based on the Fictitious Domain with Distributed Lagrange Multipliers formulation and it is designed to improve the convergence of the Flexible Generalized Minimal Residual (FGMRES) method in the presence of large coefficient jumps. To reduce the computational cost, we also introduce a cheaper block-triangular variant of the preconditioner. We prove eigenvalue clustering for the ideal AL preconditioner and study the limiting behavior of the spectrum for the modified variant in terms of parameters and the size of the jumps. Numerical experiments on different immersed geometries confirm mesh-independent iteration counts and robustness over large coefficient jumps, with substantial reductions in wall-clock time for the modified approach.