paper-with-me

홈 › Papers

UGrid: An Efficient-And-Rigorous Neural Multigrid Solver for Linear PDEs

2024-08-09 · Xi Han, Fei Hou, Hong Qin

Numerical solvers of Partial Differential Equations (PDEs) are of fundamental significance to science and engineering. To date, the historical reliance on legacy techniques has circumscribed possible integration of big data knowledge and exhibits sub-optimal efficiency for certain PDE formulations, while data-driven neural methods typically lack mathematical guarantee of convergence and correctness. This paper articulates a mathematically rigorous neural solver for linear PDEs. The proposed UGrid solver, built upon the principled integration of U-Net and MultiGrid, manifests a mathematically rigorous proof of both convergence and correctness, and showcases high numerical accuracy, as well as strong generalization power to various input geometry/values and multiple PDE formulations. In addition, we devise a new residual loss metric, which enables unsupervised training and affords more stability and a larger solution space over the legacy losses.

📄 PDF Abstract BibTeX arXiv:2408.04846

Code (1)

axihixa/ugrid 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Concatenated Skip Connection A Concatenated Skip Connection is a type of skip connection that seeks to reuse features by concatenating them to new layers, allowing more information to be retained from…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
U-Net 설명 없음

Similar Papers 제목 키워드 기반

Learning to Optimize Multigrid PDE Solvers

2019-02-25 · Daniel Greenfeld, Meirav Galun, Ron Kimmel, Irad Yavneh 외

Constructing fast numerical solvers for partial differential equations (PDEs) is crucial for many scientific disciplines. A leading technique for solving large-scale PDEs is using multigrid methods. At the core of a mult…

NSPOD: Accelerating Krylov solvers via DeepONet-learned POD subspaces

2026-05-08 · Francesc Levrero-Florencio, Youngkyu Lee, Jay Pathak, George Em Karniadakis arxiv

The convergence of Krylov-based linear iterative solvers applied to parametric partial differential equations (PDEs) is often highly sensitive to the domain, its discretization, the location/values of the applied Dirichl…

Automating the Design of Multigrid Methods with Evolutionary Program Synthesis

2023-12-22 · Jonas Schmitt

Many of the most fundamental laws of nature can be formulated as partial differential equations (PDEs). Understanding these equations is, therefore, of exceptional importance for many branches of modern science and engin…

Code GenerationProgram Synthesis

Mechanistic PDE Networks for Discovery of Governing Equations

2025-02-25 · Adeel Pervez, Efstratios Gavves, Francesco Locatello

We present Mechanistic PDE Networks -- a model for discovery of governing partial differential equations from data. Mechanistic PDE Networks represent spatiotemporal data as space-time dependent linear partial differenti…

GPU

Gamblets for opening the complexity-bottleneck of implicit schemes for hyperbolic and parabolic ODEs/PDEs with rough coefficients

2016-06-24 · Houman Owhadi, Lei Zhang

Implicit schemes are popular methods for the integration of time dependent PDEs such as hyperbolic and parabolic PDEs. However the necessity to solve corresponding linear systems at each time step constitutes a complexit…