Goal-Oriented Adaptivity for Multilevel Stochastic Galerkin FEM with Nonlinear Goal Functionals

This paper is concerned with the numerical approximation of quantities of interest associated with solutions to parametric elliptic PDEs. The key novelty of this work is in its focus on the quantities of interest represented by continuously Gâteaux differentiable <i>nonlinear </i>functionals. We consider a class of parametric elliptic PDEs where the underlying differential operator has affine dependence on a countably infinite number of uncertain parameters. We design a goal-oriented adaptive algorithm for approximating nonlinear functionals of solutions to this class of parametric PDEs. In the algorithm, the approximations of parametric solutions to the primal and dual problems are computed using the <i>multilevel </i>stochastic Galerkin finite element method (SGFEM), and the adaptive refinement process is guided by reliable spatial and parametric error reduction indicators. We prove that the proposed algorithm generates multilevel SGFEM approximations for which the estimates of the error in the goal functional converge to zero. Numerical experiments for a selection of test problems and nonlinear quantities of interest illustrate and underpin our theoretical findings.

Publication Details

Journal
SIAM Journal on Scientific Computing
Published
2026-02-18
DOI
https://doi.org/10.1137/23m1597678
Primary Topic
Probabilistic and Robust Engineering Design
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Goal-Oriented Adaptivity for Multilevel Stochastic Galerkin FEM with Nonlinear Goal Functionals

SIAM Journal on Scientific Computing
Probabilistic and Robust Engineering Design
article

Goal-Oriented Adaptivity for Multilevel Stochastic Galerkin FEM with Nonlinear Goal Functionals

article en

Abstract

This paper is concerned with the numerical approximation of quantities of interest associated with solutions to parametric elliptic PDEs. The key novelty of this work is in its focus on the quantities of interest represented by continuously Gâteaux differentiable <i>nonlinear </i>functionals. We consider a class of parametric elliptic PDEs where the underlying differential operator has affine dependence on a countably infinite number of uncertain parameters. We design a goal-oriented adaptive algorithm for approximating nonlinear functionals of solutions to this class of parametric PDEs. In the algorithm, the approximations of parametric solutions to the primal and dual problems are computed using the <i>multilevel </i>stochastic Galerkin finite element method (SGFEM), and the adaptive refinement process is guided by reliable spatial and parametric error reduction indicators. We prove that the proposed algorithm generates multilevel SGFEM approximations for which the estimates of the error in the goal functional converge to zero. Numerical experiments for a selection of test problems and nonlinear quantities of interest illustrate and underpin our theoretical findings.

SIAM Journal on Scientific ComputingVol. 48(1)
Istituto Nazionale di Alta Matematica "Francesco Severi", European Commission, Austrian Science Fund, Universität Wien, Erwin Schrödinger International Institute for Mathematics and Physics, Gruppo Nazionale per il Calcolo Scientifico, Engineering and Physical Sciences Research Council
Openalex Percentile: Top 54%
Probabilistic and Robust Engineering Design
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.