Efficient adaptive multilevel stochastic Galerkin approximation using implicit a posteriori error estimation
Adam J. Crowder, Catherine E. Powell, Alex Bespalov

TL;DR
This paper introduces an efficient adaptive multilevel stochastic Galerkin method for elliptic PDEs with infinitely many parameters, using implicit a posteriori error estimation to guide adaptive enrichment without tuning parameters.
Contribution
The paper presents a novel adaptive SGFEM algorithm with multilevel structure and implicit error estimation, improving efficiency and practicality in high-dimensional parameter spaces.
Findings
Error decay rate matches finite element method for parameter-free problems
Algorithm adaptively activates parameters based on error estimates
Numerical experiments confirm optimal performance
Abstract
Partial differential equations (PDEs) with inputs that depend on infinitely many parameters pose serious theoretical and computational challenges. Sophisticated numerical algorithms that automatically determine which parameters need to be activated in the approximation space in order to estimate a quantity of interest to a prescribed error tolerance are needed. For elliptic PDEs with parameter-dependent coefficients, stochastic Galerkin finite element methods (SGFEMs) have been well studied. Under certain assumptions, it can be shown that there exists a sequence of SGFEM approximation spaces for which the energy norm of the error decays to zero at a rate that is independent of the number of input parameters. However, it is not clear how to adaptively construct these spaces in a practical and computationally efficient way. We present a new adaptive SGFEM algorithm that tackles elliptic…
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.
