E($3$) Equivariant Graph Neural Networks for Particle-Based Fluid Mechanics
We contribute to the vastly growing field of machine learning for engineering systems by demonstrating that equivariant graph neural networks have the potential to learn more accurate dynamic-interaction models than their non-equivariant counterparts. We benchmark two well-studied fluid flow systems, namely the 3D decaying Taylor-Green vortex and the 3D reverse Poiseuille flow, and compare equivariant graph neural networks to their non-equivariant counterparts on different performance measures, such as kinetic energy or Sinkhorn distance. Such measures are typically used in engineering to validate numerical solvers. Our main findings are that while being rather slow to train and evaluate, equivariant models learn more physically accurate interactions. This indicates opportunities for future work towards coarse-grained models for turbulent flows, and generalization across system dynamics and parameters.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Lagrangian Fluid Mechanics with E($3$)-Equivariant Graph Neural Networks
We contribute to the vastly growing field of machine learning for engineering systems by demonstrating that equivariant graph neural networks have the potential to learn more accurate dynamic-interaction models than thei…
Coherent structure coloring: identification of coherent structures from sparse data using graph theory
We present a frame-invariant method for detecting coherent structures from Lagrangian flow trajectories that can be sparse in number, as is the case in many fluid mechanics applications of practical interest. The method,…
LagrangeBench: A Lagrangian Fluid Mechanics Benchmarking Suite
Machine learning has been successfully applied to grid-based PDE modeling in various scientific applications. However, learned PDE solvers based on Lagrangian particle discretizations, which are the preferred approach to…
BenchmarkingEquivariant Graph Mechanics Networks with Constraints
Learning to reason about relations and dynamics over multiple interacting objects is a challenging topic in machine learning. The challenges mainly stem from that the interacting systems are exponentially-compositional, …
Constrained Graph Mechanics Networks
Learning to reason about relations and dynamics over multiple interacting objects is a prevailing yet challenging topic in machine learning. The challenges mainly stem from that interacting systems are of combinatorial …