Truncation preconditioners for stochastic Galerkin finite element discretizations
Alex Bespalov, Daniel Loghin, Rawin Youngnoi

TL;DR
This paper introduces and analyzes truncation preconditioners for stochastic Galerkin finite element methods, demonstrating their spectral optimality and efficiency in solving large coupled linear systems for parametric PDEs.
Contribution
The paper extends mean-based preconditioners by incorporating additional matrix components and provides spectral analysis and numerical validation of their effectiveness.
Findings
Truncation preconditioners are spectrally optimal for SGFEM matrices.
Numerical results show truncation preconditioners reduce iteration counts.
Truncation preconditioners outperform mean-based and Kronecker preconditioners.
Abstract
Stochastic Galerkin finite element method (SGFEM) provides an efficient alternative to traditional sampling methods for the numerical solution of linear elliptic partial differential equations with parametric or random inputs. However, computing stochastic Galerkin approximations for a given problem requires the solution of large coupled systems of linear equations. Therefore, an effective and bespoke iterative solver is a key ingredient of any SGFEM implementation. In this paper, we analyze a class of truncation preconditioners for SGFEM. Extending the idea of the mean-based preconditioner, these preconditioners capture additional significant components of the stochastic Galerkin matrix. Focusing on the parametric diffusion equation as a model problem and assuming affine-parametric representation of the diffusion coefficient, we perform spectral analysis of the preconditioned matrices…
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.
