LGNAJul 5, 2024

G-Adaptivity: optimised graph-based mesh relocation for finite element methods

arXiv:2407.04516v35 citationsh-index: 49
Originality Highly original
AI Analysis

This work addresses the computational bottleneck of mesh relocation in finite element simulations, offering a more efficient and accurate approach for engineers and scientists, though it is incremental as it builds on prior ML methods.

The paper tackles the problem of optimizing mesh point locations in finite element methods to improve solution accuracy at a given computational cost, by training a graph neural network to directly minimize the FE solution error, resulting in lower error and faster performance compared to classical and prior ML methods.

We present a novel, and effective, approach to achieve optimal mesh relocation in finite element methods (FEMs). The cost and accuracy of FEMs is critically dependent on the choice of mesh points. Mesh relocation (r-adaptivity) seeks to optimise the mesh geometry to obtain the best solution accuracy at given computational budget. Classical r-adaptivity relies on the solution of a separate nonlinear "meshing" PDE to determine mesh point locations. This incurs significant cost at remeshing, and relies on estimates that relate interpolation- and FEM-error. Recent machine learning approaches have focused on the construction of fast surrogates for such classical methods. Instead, our new approach trains a graph neural network (GNN) to determine mesh point locations by directly minimising the FE solution error from the PDE system Firedrake to achieve higher solution accuracy. Our GNN architecture closely aligns the mesh solution space to that of classical meshing methodologies, thus replacing classical estimates for optimality with a learnable strategy. This allows for rapid and robust training and results in an extremely efficient and effective GNN approach to online r-adaptivity. Our method outperforms both classical, and prior ML, approaches to r-adaptive meshing. In particular, it achieves lower FE solution error, whilst retaining the significant speed-up over classical methods observed in prior ML work.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes