Introduction to generalized Polynomial Chaos (gPC)#

The primary focus of this tutorial rests on spectral methods, which are based on the determination of a functional dependence between the probabilistic in- and output of a system by means of a series of suitable selected functionals. The practical realization of spectral methods can be further subdivided into intrusive and non-intrusive approaches. Intrusive approaches are based on Galerkin methods, where the governing equations have to be modified to incorporate the probabilistic character of the model parameters. This includes the determination of the stochastic weak form of the problem according to the given uncertainties (Le Maitre, 2010). On the contrary, non-intrusive approaches are based on a reduced sampling of the probability space without any modification of the deterministic solvers. Those methods are more flexible and thus more suitable for universal application. Typical applications can be found in the fields of computational fluid dynamics (Knio and Le Maitre, 2006; Xiu, 2003; Hosder et al., 2006), heat transfer (Wan et al., 2004; Xiu and Karniadakis, 2003), multibody dynamics (Sandu et al., 2006a, Sandu et al. 2006b), robust design optimization (Zein, 2013) or in biomedical engineering (Saturnino et al., 2019; Weise et al. 2015; Codecasa et al., 2016). During the last years, spectral approaches are becoming increasingly popular. However, those are not a reference tool yet and still unknown for many people. For that reason, particular emphasis is placed to describe the method and to further elucidate the principle by means of examples.

The gPC expansion#

The basic concept of the gPC is to find a functional dependence between the random variables \({\xi}\) and the solutions \(y(\mathbf{r},{\xi})\) by means of an orthogonal polynomial basis \(\Psi({\xi})\). In its general form, it is given by:

\[y(\mathbf{r},{\xi}) = \sum_{\mathbf{\alpha}\in\mathcal{A}(\mathbf{p})} u_{\mathbf{\alpha}}(\mathbf{r}) \Psi_{\mathbf{\alpha}}({\xi}).\]

The terms are indexed by the multi-index \(\mathbf{\alpha}=(\alpha_0,...,\alpha_{d-1})\), which is a d-tuple of non-negative integers \(\mathbf{\alpha}\in\mathbb{N}_0^d\). The sum is carried out over the multi-indices, contained in the set \(\mathcal{A}(\mathbf{p})\). The composition of the set depends on the type of expansion and is parameterized by a parameter vector \(\mathbf{p}\), which will be explained in a later part of this section.

The function \(\Psi_{\mathbf{\alpha}}({\xi})\) are the joint polynomial basis functions of the gPC. They are composed of polynomials \(\psi_{\alpha_i}(\xi_i)\).

\[\Psi_{\mathbf{\alpha}}({\xi}) = \prod_{i=1}^{d} \psi_{\alpha_i}(\xi_i)\]

The polynomials \(\psi_{\alpha_i}(\xi_i)\) are defined for each random variable separately according to the corresponding pdf \(p_i(\xi_i)\). They have to be chosen to ensure orthogonality. The set of polynomials for an optimal basis of continuous probability distributions is derived from the Askey scheme (Askey and Wilson, 1985). The index of the polynomials denotes its order (or degree). In this way, the multi-index \(\mathbf{\alpha}\) corresponds to the order of the individual basis functions forming the joint basis function.

Type

Distribution

Orthogonal polynomials

Range

continuous

uniform

Legendre

\((a,b)\)

continuous

beta

Jacobi

\((a,b)\)

continuous

gaussian

Hermite

\((-\infty,+\infty)\)

continuous

gamma

Laguerre

\((0,+\infty)\)

discrete

poisson

Charlier

\((0,1,...)\)

References#

Total running time of the script: ( 0 minutes 0.000 seconds)

Gallery generated by Sphinx-Gallery