Stochastic Galerkin and Monte-Carlo methods for parabolic problems: Numerical performance of variational matrix-free approximations
Moataz Dawor, Nils Margenberg, Markus Bause

TL;DR
This paper compares stochastic Galerkin and Monte-Carlo methods for parabolic problems with randomness, demonstrating the efficiency and accuracy of the Galerkin approach using a matrix-free implementation.
Contribution
It introduces a variational stochastic Galerkin discretization combined with efficient GMRES-GMG solvers and compares it to Monte-Carlo methods within a unified framework.
Findings
Stochastic Galerkin method shows superior performance over Monte-Carlo.
Numerical results confirm convergence of discretizations and solver statistics.
Matrix-free implementation enhances computational efficiency.
Abstract
Stochastic Galerkin methods offer unexplored potential for the numerical simulation of parabolic problems with random variables, in particular if they are combined with variational discretizations of the space and time variables. Due to the high dimensionality, the solution of the arising algebraic systems do not become feasible without efficient solvers, preconditioners, and software architectures. A stochastic Galerkin discretization with an embedded slabwise finite element approximation of the space and time variables is proposed and analyzed numerically. For solving the linear systems, GMRES iterations are block-preconditioned by a geometric multigrid (GMG) technique using a local Vanka smoother for the space-time subsystems. Monte-Carlo methods are also used for solving random parabolic problems and studied here for the purpose of comparison. The Monte-Carlo approach is built on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
