Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 5 min ago
PreprintarXiv licencearXiv

Deep learning methods for stochastic Galerkin approximations of random domain problems

Abstract

This work considers strong and weak stochastic Galerkin approximations of random domain problems for the elliptic random partial differential equation (PDE). The random domain problems are realized by sufficiently regular random domain mapping, allowing a transformation on deterministic reference domain. A traditional numerical method for solving the resulting high-dimensional coupled stochastic Galerkin systems is replaced by deep learning techniques. We compare a physics-informed neural network approach, based on the strong stochastic Galerkin residual, with a Deep Ritz approach, based on the weak stochastic Galerkin system, reformulated as Ritz energy minimization. The neural networks serve as surrogates for the deterministic spectral coefficients of the respective stochastic Galerkin solution. The stochastic parameters are not used as neural network input parameters and the stochastic domain is not sampled during training. The efficiency of the methods is demonstrated on a randomly stretched interval and a randomly deformed annulus in two spatial dimensions.

Related

  1. Stochastic Galerkin Method for Fractional Boundary Value Problems: Convergence Analysis and Numerical Treatment
    Abhishek Kumar Singh, Dhyan Divakar Laad, Vaibhav Mehandiratta +1
    arXivPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingarXiv
  2. Trace Inverse Estimates and Kernel-based Nitsche Galerkin Methods for Elliptic Interface Problems
    Leevan Ling, Shu Ma, Weifeng Qiu +1
    arXivPreprintCC BY-NC-SA 4.0Full textNumerical analysis & scientific computingarXiv
  3. Numerical Methods for Dynamical Low-Rank Approximations of Stochastic Differential Equations -- Part II: Stochastic discretization
    Yoshihito Kazashi, Fabio Nobile, Fabio Zoccolan
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Stability and Error Analysis of Multistep IMEX Local Discontinuous Galerkin Methods for One-Dimensional Nonlinear Fourth-Order Evolution Problems
    Amjad G. Alharbi, Tarek Aboelenen
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  5. Last-Iterate Convergence of Stochastic Gradient Methods for Unbounded Problems
    Kevin Kurian Thomas Vaidyan, Ahmet Alacaoglu, Michael P. Friedlander
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
BibTeX
@misc{musco2026deep,
  title = {{Deep learning methods for stochastic Galerkin approximations of random domain problems}},
  author = {Fabio Musco and Andrea Barth},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32508},
  eprint = {2609.32508},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32508},
}
RIS
TY  - UNPB
TI  - Deep learning methods for stochastic Galerkin approximations of random domain problems
AU  - Fabio Musco
AU  - Andrea Barth
PY  - 2026
DA  - 2026/09/26
PB  - arXiv
DO  - 10.48550/arxiv.2609.32508
UR  - https://arxiv.org/abs/2609.32508
AB  - This work considers strong and weak stochastic Galerkin approximations of random domain problems for the elliptic random partial differential equation (PDE). The random domain problems are realized by sufficiently regular random domain mapping, allowing a transformation on deterministic reference domain. A traditional numerical method for solving the resulting high-dimensional coupled stochastic Galerkin systems is replaced by deep learning techniques. We compare a physics-informed neural network approach, based on the strong stochastic Galerkin residual, with a Deep Ritz approach, based on the weak stochastic Galerkin system, reformulated as Ritz energy minimization. The neural networks serve as surrogates for the deterministic spectral coefficients of the respective stochastic Galerkin solution. The stochastic parameters are not used as neural network input parameters and the stochastic domain is not sampled during training. The efficiency of the methods is demonstrated on a randomly stretched interval and a randomly deformed annulus in two spatial dimensions.
ER  -