Field conserving adaptive mesh refinement (AMR) scheme on massively parallel adaptive octree meshes
Abstract
Adaptive mesh refinement (AMR) is widely used to efficiently resolve localized features in time-dependent partial differential equations (PDEs) by selectively refining and coarsening the mesh. However, in long-horizon simulations, repeated intergrid interpolations can introduce systematic drift in conserved quantities, especially for variational discretizations with continuous basis functions. While interpolation from parent-to-child during refinement in continuous Galerkin (CG) discretizations is naturally conservative, the standard injection-based child-to-parent coarsening interpolation is generally not. We propose a simple, scalable field-conserving coarsening operator for parallel, octree-based AMR. The method enforces discrete global conservation during coarsening by first computing field conserving coarse-element values at quadrature points and then recovering coarse nodal degrees of freedom via an projection (mass-matrix solve), which simultaneously controls the error. We evaluate the approach on mass-conserving phase-field models, including the Cahn--Hilliard and Cahn--Hilliard--Navier--Stokes systems, and compare against injection in terms of conservation error, solution quality, and computational cost.
Keywords
Cite
@article{arxiv.2602.07817,
title = {Field conserving adaptive mesh refinement (AMR) scheme on massively parallel adaptive octree meshes},
author = {Kumar Saurabh and Makrand A. Khanwale and Masado Ishii and Hari Sundar and Baskar Ganapathysubramanian},
journal= {arXiv preprint arXiv:2602.07817},
year = {2026}
}
Comments
22 pages