Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Label-free learning of elliptic partial differential equation solvers with generalizability across boundary value problems (2301.13165v2)

Published 30 Dec 2022 in math.NA and cs.NA

Abstract: Traditional, numerical discretization-based solvers of partial differential equations (PDEs) are fundamentally agnostic to domains, boundary conditions and coefficients. In contrast, machine learnt solvers have a limited generalizability across these elements of boundary value problems. This is strongly true in the case of surrogate models that are typically trained on direct numerical simulations of PDEs applied to one specific boundary value problem. In a departure from this direct approach, the label-free machine learning of solvers is centered on a loss function that incorporates the PDE and boundary conditions in residual form. However, their generalization across boundary conditions is limited and they remain strongly domain-dependent. Here, we present a framework that generalizes across domains, boundary conditions and coefficients simultaneously with learning the PDE in weak form. Our work explores the ability of simple, convolutional neural network (CNN)-based encoder-decoder architectures to learn to solve a PDE in greater generality than its restriction to a particular boundary value problem. In this first communication, we consider the elliptic PDEs of Fickean diffusion, linear and nonlinear elasticity. Importantly, the learning happens independently of any labelled field data from either experiments or direct numerical solutions. Extensive results for these problem classes demonstrate the framework's ability to learn PDE solvers that generalize across hundreds of thousands of domains, boundary conditions and coefficients, including extrapolation beyond the learning regime. Once trained, the machine learning solvers are orders of magnitude faster than discretization-based solvers. We place our work in the context of recent continuous operator learning frameworks, and note extensions to transfer learning, active learning and reinforcement learning.

Citations (6)

Summary

We haven't generated a summary for this paper yet.