Unstructured to structured: geometric multigrid on complex geometries via domain remapping
Abstract
For domains that are easily represented by structured meshes, robust geometric multigrid solvers can quickly provide the numerical solution to many discretized elliptic PDEs. However, for complicated domains with unstructured meshes, constructing suitable hierarchies of meshes becomes challenging. We propose a framework for mapping computations from such complex domains to regular computational domains via diffeomorphisms, enabling the use of robust geometric-style multigrid. This mapping facilitates regular memory accesses during solves, improving efficiency and scalability, especially on massively parallel processors such as GPUs. Moreover, we show that the diffeomorphic mapping itself may be approximately learned using an invertible neural network, facilitating automated application to geometries where no analytic mapping is readily available.
Cite
@article{arxiv.2509.08109,
title = {Unstructured to structured: geometric multigrid on complex geometries via domain remapping},
author = {Nicolas Nytko and Scott MacLachlan and J. David Moulton and Luke N. Olson and Andrew Reisner and Matthew West},
journal= {arXiv preprint arXiv:2509.08109},
year = {2025}
}