Self-Supervised Coarsening of Unstructured Grid with Automatic Differentiation
Due to the high computational load of modern numerical simulation, there is a demand for approaches that would reduce the size of discrete problems while keeping the accuracy reasonable. In this work, we present an original algorithm to coarsen an unstructured grid based on the concepts of differentiable physics. We achieve this by employing k-means clustering, autodifferentiation and stochastic minimization algorithms. We demonstrate performance of the designed algorithm on two PDEs: a linear parabolic equation which governs slightly compressible fluid flow in porous media and the wave equation. Our results show that in the considered scenarios, we reduced the number of grid points up to 10 times while preserving the modeled variable dynamics in the points of interest. The proposed approach can be applied to the simulation of an arbitrary system described by evolutionary partial differential equations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Optimization-Based Algebraic Multigrid Coarsening Using Reinforcement Learning
Large sparse linear systems of equations are ubiquitous in science and engineering, such as those arising from discretizations of partial differential equations. Algebraic multigrid (AMG) methods are one of the most comm…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Graph coarsening: From scientific computing to machine learning
The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of thi…
BIG-bench Machine LearningUnsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
Hierarchical abstractions are a methodology for solving large-scale graph problems in various disciplines. Coarsening is one such approach: it generates a pyramid of graphs whereby the one in the next level is a structur…
Graph ClassificationGL-Coarsener: A Graph representation learning framework to construct coarse grid hierarchy for AMG solvers
In many numerical schemes, the computational complexity scales non-linearly with the problem size. Solving a linear system of equations using direct methods or most iterative methods is a typical example. Algebraic multi…
ClusteringGraph Representation LearningRepresentation LearningPhysics-Informed Coarsening for Multigrid Graph Neural Surrogates
Learning-based surrogates for partial differential equations have recently matched the accuracy of classical solvers while achieving orders-of-magnitude speedups, predominantly in fluid settings and structured geometries…
Graph Neural Network