Recent Developments in Spectral Stochastic Methods for the Numerical Solution of Stochastic Partial Differential Equations

Abstract

Uncertainty quantication appears today as a crucial point in numerous branches of science and engineering. In the last two decades, a growing interest has been devoted to a new family of methods, called spectral stochastic methods, for the propagation of uncertainties through physical models governed by stochastic partial dierential equations. These approaches rely on a fruitful marriage of probability theory and approximation theory in functional analysis. This paper provide a review of some recent developments in computational stochastic methods, with a particular emphasis on spectral stochastic approaches. After a review of dierent choices for the functional representation of random variables, we provide an overview of various numerical methods for the computation of these functional representations: projection, collocation, Galerkin approaches... A detailed presentation of Galerkin-type spectral stochastic approaches and related computational issues is provided. Recent developments on model reduction techniques in the context of spectral stochastic methods are also discussed. The aim of these techniques is to circumvent several drawbacks of spectral stochastic approaches (computing time, memory requirements, intrusive character) and to allow their use for large scale applications. We particularly focus on model reduction techniques based on spectral decomposition techniques and their generalizations.

Stochastic modeling of uncertainties in computational structural dynamics—Recent theoretical advances

“…These last two decades, a growing interest has been devoted to spectral stochastic methods, which provide an explicit representation of the random model output as a function of the basic random parameters modeling the input uncertainties [63,64,97,98,99]. An approximation of the random model output is sought on suitable functional approximation bases.…”

Proper Generalized Decomposition based dynamic data-driven control of thermal processes

“…The foundations and some recent advances in the proper generalized decomposition based discretization strategies can be found in [1][2][3][4][5][6][7][8][9][10][11][12][19][20][21][22][23][24][25][26][27][28][29][30][31][32]35] and the references therein.…”

Convergence results on greedy algorithms for high-dimensional eigenvalue problems

“…In this article, we focus on an approach introduced by Ladevèze [8], Chinesta [9], Nouy [10] and coauthors in different contexts, relying on the use of greedy algorithms [11]. This class of methods is also called Progressive Generalized Decomposition [12] in the literature.…”