Neural Networks-based Random Vortex Methods for Modelling Incompressible Flows
Vladislav Cherepanov, Sebastian W. Ertel

TL;DR
This paper presents a neural network-based method for simulating 2D incompressible flows, extending Deep Random Vortex Methods by eliminating the need for the Biot--Savart kernel and ensuring physical constraints.
Contribution
It introduces a novel neural network approach that enforces physical properties and integrates with traditional PDE solvers for efficient flow simulation.
Findings
Accurately models 2D incompressible flows with physical constraints
Enforces boundary conditions and incompressibility strictly
Demonstrates effective incorporation of measurement data
Abstract
In this paper we introduce a novel Neural Networks-based approach for approximating solutions to the (2D) incompressible Navier--Stokes equations, which is an extension of so called Deep Random Vortex Methods (DRVM), that does not require the knowledge of the Biot--Savart kernel associated to the computational domain. Our algorithm uses a Neural Network (NN), that approximates the vorticity based on a loss function that uses a computationally efficient formulation of the Random Vortex Dynamics. The neural vorticity estimator is then combined with traditional numerical PDE-solvers, which can be considered as a final implicit linear layer of the network, for the Poisson equation to compute the velocity field. The main advantage of our method compared to the standard DRVM and other NN-based numerical algorithms is that it strictly enforces physical properties, such as incompressibility or…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFluid Dynamics and Turbulent Flows · Flow Measurement and Analysis · Model Reduction and Neural Networks
MethodsLinear Layer
