Convergence of adaptive stochastic Galerkin FEM
Abstract: We propose and analyze novel adaptive algorithms for the numerical solution of elliptic partial differential equations with parametric uncertainty. Four different marking strategies are employed for refinement of stochastic Galerkin finite element approximations. The algorithms are driven by the energy error reduction estimates derived from two-level a posteriori error indicators for spatial approximations and hierarchical a posteriori error indicators for parametric approximations. The focus of this work is on the mathematical foundation of the adaptive algorithms in the sense of rigorous convergence analysis. In particular, we prove that the proposed algorithms drive the underlying energy error estimates to zero.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.