Better Neural PDE Solvers Through Data-Free Mesh Movers
Peiyan Hu, Yue Wang, Zhi-Ming Ma

TL;DR
This paper introduces a data-free neural mesh adapter called DMM that dynamically moves mesh nodes for PDE solving, improving accuracy without requiring optimal mesh data and handling topology changes.
Contribution
It proposes a novel data-free neural mesh adaptor that moves existing nodes based on the Monge-Ampère equation, enabling adaptive mesh refinement without expensive data.
Findings
Meshes generated by DMM have minimal interpolation error.
The MM-PDE solver with DMM improves accuracy in modeling PDE systems.
The method effectively adapts meshes for dynamic PDE solutions.
Abstract
Recently, neural networks have been extensively employed to solve partial differential equations (PDEs) in physical system modeling. While major studies focus on learning system evolution on predefined static mesh discretizations, some methods utilize reinforcement learning or supervised learning techniques to create adaptive and dynamic meshes, due to the dynamic nature of these systems. However, these approaches face two primary challenges: (1) the need for expensive optimal mesh data, and (2) the change of the solution space's degree of freedom and topology during mesh refinement. To address these challenges, this paper proposes a neural PDE solver with a neural mesh adapter. To begin with, we introduce a novel data-free neural mesh adaptor, called Data-free Mesh Mover (DMM), with two main innovations. Firstly, it is an operator that maps the solution to adaptive meshes and is…
Peer Reviews
Decision·ICLR 2024 poster
The application of adaptive meshes will improve the accuracy.
- The efficiency of DMM requires further comprehensive demonstration. - The contribution of this work appears to be incremental, as the core neural PDE solver used is essentially the message passing neural PDE solver developed by Brandstetter et al.
A detailed explanation was provided for the framework, with plenty of background information. The method applies well in practice, and the appendix provides enough technical detail on results in the main paper.
1. Runtimes should be mentioned for the proposed model, especially when comparing with equivalent methods such as GNN, CNN, FNO and LAMP. How much overhead does DMM require, and what number of extra trainable parameters are we talking about in practice? 2. When training the DMM separately, how well is the physics loss being minimized? It is important to know to what extent the equations need to be satisfied until we see an improvement in MM-PDE. 3. A sentence of explanation should be added when
- The idea to design a neural PDE solver with mesh movement method is novel. - The Monge-Amp`ere equation motivated physics loss for mesh mover training is intuitive. - The use of BFGS for memory intensive training and the sampling method for Monge-Ampere equation are sound. - The background part is informative and help understand the proposed method.
- One essential challenge for r-adaptive (i.e., mesh movement) based mesh adaptive methods is mesh tangling. The mesh tangling happens when the mesh have elements with negative Jacobian-determinant, or in other words, the edges of mesh nodes come across each other after being moved. Although the optimal-transport based Monge-Amp`ere mesh movement method is designed to alleviate the mesh tangling issue, it is hard to guarantee tangling-free especially for a learned model, which only has a soft ph
Code & Models
Videos
Taxonomy
TopicsModel Reduction and Neural Networks · Lattice Boltzmann Simulation Studies · Advanced Numerical Analysis Techniques
MethodsFocus
