Learning quantities of interest from parametric PDEs: An efficient neural-weighted Minimal Residual approach
arXiv:2304.01722 · doi:10.1016/j.camwa.2024.04.006
Abstract
The efficient approximation of parametric PDEs is of tremendous importance in science and engineering. In this paper, we show how one can train Galerkin discretizations to efficiently learn quantities of interest of solutions to a parametric PDE. The central component in our approach is an efficient neural-network-weighted Minimal-Residual formulation, which, after training, provides Galerkin-based approximations in standard discrete spaces that have accurate quantities of interest, regardless of the coarseness of the discrete space.
References in corpus (8)
- DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operators
- A comprehensive study of non-adaptive and residual-based adaptive sampling for physics-informed neural networks
- Efficient training of physics-informed neural networks via importance sampling
- Lift & Learn: Physics-informed machine learning for large-scale nonlinear dynamical systems
- Solving parametric PDE problems with artificial neural networks
- On quadrature rules for solving Partial Differential Equations using Neural Networks
- Data-Driven Finite Elements Methods: Machine Learning Acceleration of Goal-Oriented Computations
- Neural Control of Discrete Weak Formulations: Galerkin, Least-Squares and Minimal-Residual Methods with Quasi-Optimal Weights