Matrix-Free Local Multigrid for C1 Hermite Discretizations on GPUs
Abstract
I present a matrix-free local multigrid method for C1 tensor-product Hermite discretizations on adaptively refined Cartesian meshes, using the clamped biharmonic problem as the model problem. Extending a cell-wise primal-dual formulation to Hermite elements, I enforce continuity through a constraint operator that is never formed. At refinement edges, geometric prolongation supplies both the trace and its normal derivative, so the local V-cycle needs no edge operator and no hanging-node machinery. For the cubic element, an even-odd decomposition based on the signed reflection symmetry of the Hermite basis, applied along two axes, splits the element matrix into four dense 16×16 blocks and reaches 85% of peak memory bandwidth. Chebyshev-Jacobi and vertex-patch smoothers both preserve conformity by construction. In three dimensions on one NVIDIA A100 in double precision, conjugate gradients preconditioned by the Chebyshev-Jacobi V-cycle need five or six iterations on uniform meshes and solve at up to 4.23 million cells per second. On locally refined meshes the count rises to at most sixteen, ordered by the fraction of cells on a refinement edge and nearly equal for both smoothers.
Related
- Mixed-Precision Coalesced Matrix-Free Multigrid with Vertex-Patch Smoothing
- The stability barrier of a class of Hermite-type discretizations of advection equations
- Finite Local Rings Free of Rank Three over Zpn: Radical Filtrations, Matrix Models, and the Frobenius Property
- On the Gram matrix of standard inner products of asymmetrically-weighted Hermite functions
- Constructing free subgroups of matrix groups
BibTeX
@misc{wichrowski2026matrixfree,
title = {{Matrix-Free Local Multigrid for $C^1$ Hermite Discretizations on GPUs}},
author = {Michał Wichrowski},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.30308},
eprint = {2610.30308},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.30308},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Matrix-Free Local Multigrid for C^1 Hermite Discretizations on GPUs
AU - Michał Wichrowski
PY - 2026
DA - 2026/10/21
PB - arXiv
DO - 10.48550/arxiv.2610.30308
UR - https://arxiv.org/abs/2610.30308
AB - I present a matrix-free local multigrid method for C^1 tensor-product Hermite discretizations on adaptively refined Cartesian meshes, using the clamped biharmonic problem as the model problem. Extending a cell-wise primal-dual formulation to Hermite elements, I enforce continuity through a constraint operator that is never formed. At refinement edges, geometric prolongation supplies both the trace and its normal derivative, so the local V-cycle needs no edge operator and no hanging-node machinery. For the cubic element, an even-odd decomposition based on the signed reflection symmetry of the Hermite basis, applied along two axes, splits the element matrix into four dense 16×16 blocks and reaches 85% of peak memory bandwidth. Chebyshev-Jacobi and vertex-patch smoothers both preserve conformity by construction. In three dimensions on one NVIDIA A100 in double precision, conjugate gradients preconditioned by the Chebyshev-Jacobi V-cycle need five or six iterations on uniform meshes and solve at up to 4.23 million cells per second. On locally refined meshes the count rises to at most sixteen, ordered by the fraction of cells on a refinement edge and nearly equal for both smoothers.
ER -