An R-tree-based agglomeration multigrid preconditioner makes PCG for the DG monodomain model converge in 6-13 iterations per time step across p=1..3, with 3-7.5x total-time speedups over AMG at high polynomial degree.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiology
An R-tree-based agglomeration multigrid preconditioner makes PCG for the DG monodomain model converge in 6-13 iterations per time step across p=1..3, with 3-7.5x total-time speedups over AMG at high polynomial degree.