Solving and learning advective multiscale Darcian dynamics with the Neural Basis Method
Yuhe Wang, Min Wang
TL;DR
This work reframes physics-informed PDE solving as a projection-based procedure by introducing the Neural Basis Method (NBM), which builds a physics-conforming neural basis via a fixed-parameter dual-layer network and enforces PDEs through a weighted least-squares residual, yielding a stable, interpretable certificate of error. The approach is demonstrated on advective multiscale Darcian dynamics, combining a mixed Darcy–flow formulation with energy-consistent weighting and upwind-stabilized transport, achieving spectral-like accuracy and substantial speedups in parametric settings (NBM-OL). A key innovation is the physics-conforming neural vector basis, built from a Helmholtz-type decomposition to preserve mass conservation and improve stability, with extensions to 3D. The framework further provides an operator-learning pathway (NBM-OL) to map parametric inputs—such as permeability fields and boundary fluxes—to reduced coordinates, enabling robust in-distribution generalization, strong out-of-distribution robustness, and orders-of-magnitude speedups over conventional finite-volume solvers for many-query tasks in subsurface flow and transport.
Abstract
Physics-governed models are increasingly paired with machine learning for accelerated predictions, yet most "physics--informed" formulations treat the governing equations as a penalty loss whose scale and meaning are set by heuristic balancing. This blurs operator structure, thereby confounding solution approximation error with governing-equation enforcement error and making the solving and learning progress hard to interpret and control. Here we introduce the Neural Basis Method, a projection-based formulation that couples a predefined, physics-conforming neural basis space with an operator-induced residual metric to obtain a well-conditioned deterministic minimization. Stability and reliability then hinge on this metric: the residual is not merely an optimization objective but a computable certificate tied to approximation and enforcement, remaining stable under basis enrichment and yielding reduced coordinates that are learnable across parametric instances. We use advective multiscale Darcian dynamics as a concrete demonstration of this broader point. Our method produce accurate and robust solutions in single solves and enable fast and effective parametric inference with operator learning.
