Global sensitivity analysis by polynomial dimensional decomposition

https://doi.org/10.1016/j.ress.2011.03.002Get rights and content

Abstract

This paper presents a polynomial dimensional decomposition (PDD) method for global sensitivity analysis of stochastic systems subject to independent random input following arbitrary probability distributions. The method involves Fourier-polynomial expansions of lower-variate component functions of a stochastic response by measure-consistent orthonormal polynomial bases, analytical formulae for calculating the global sensitivity indices in terms of the expansion coefficients, and dimension-reduction integration for estimating the expansion coefficients. Due to identical dimensional structures of PDD and analysis-of-variance decomposition, the proposed method facilitates simple and direct calculation of the global sensitivity indices. Numerical results of the global sensitivity indices computed for smooth systems reveal significantly higher convergence rates of the PDD approximation than those from existing methods, including polynomial chaos expansion, random balance design, state-dependent parameter, improved Sobol's method, and sampling-based methods. However, for non-smooth functions, the convergence properties of the PDD solution deteriorate to a great extent, warranting further improvements. The computational complexity of the PDD method is polynomial, as opposed to exponential, thereby alleviating the curse of dimensionality to some extent.

Introduction

Mathematical modeling of complex systems often requires sensitivity analysis to determine how an output variable of interest is influenced by individual or subsets of input variables. A traditional local sensitivity analysis entails gradients or derivatives, often invoked in design optimization, describing changes in the model response due to the local variation of input. Depending on the model output, obtaining gradients or derivatives, if they exist, can be simple or difficult. In contrast, a global sensitivity analysis (GSA), increasingly becoming mainstream, characterizes how the global variation of input, due to its uncertainty, impacts the overall uncertain behavior of the model. In other words, GSA constitutes the study of how the output uncertainty from a mathematical model is divvied up, qualitatively or quantitatively, to distinct sources of input variation in the model [1].

Almost all GSA are based on the second-moment properties of random output, for which there exist a multitude of methods or techniques for calculating the global sensitivity indices. Prominent among them are a random balance design (RBD) method [2], which integrates its previous version [3] with a Fourier amplitude sensitivity test [4]; a state dependent parameter (SDP) meta-model [5] based on recursive filtering and smoothing estimation; and a variant of Sobol's method with an improved formula [6], [7], [8]. More recent developments on GSA include application of polynomial chaos expansion (PCE) [9] as a meta-model, commonly used for uncertainty quantification of complex systems [10]. Crestaux et al. [11] examined the PCE method for calculating sensitivity indices by comparing their convergence properties with those from standard sampling-based methods, including Monte Carlo with Latin hypercube sampling (MC-LHS) [12] and quasi-Monte Carlo (QMC) simulation [13]. Their findings reveal faster convergence of the PCE solution relative to sampling-based methods for smoothly varying model responses, but the convergence rate may degrade markedly when confronted with non-smooth systems. They also found the PCE method to be cost effective for low to moderate dimensional systems, even with smooth responses, imposing a heavy computational burden when there exist a mere ten variables or more. Indeed, computational research on GSA is far from complete and, therefore, development of alternative methods for improving the accuracy or efficiency of existing methods is desirable.

This paper presents an alternative method, known as the polynomial dimensional decomposition (PDD) method, for variance-based GSA of stochastic systems subject to independent random input following arbitrary probability distributions. The method is based on (1) Fourier-polynomial expansions of lower-variate component functions of a stochastic response by measure-consistent orthonormal polynomial bases; (2) analytical formulae for calculating the global sensitivity indices in terms of the expansion coefficients; and (3) dimension-reduction integration for efficiently estimating the expansion coefficients. Section 2 reviews a generic dimensional decomposition of a multivariate function, including three distinct variants. Section 3 invokes the properties of lower-variate component functions of a dimensional decomposition, leading to a formal definition of the global sensitivity index. The Fourier-polynomial expansion, calculation of sensitivity indices, dimension-reduction integration, including the computational effort, and novelties are described in Section 4. Five numerical examples illustrate the accuracy, convergence properties, and computational efficiency of the proposed method in Section 5. Finally, conclusions are drawn in Section 6.

Section snippets

Dimensional decomposition

Let (Ω,F,P) be a complete probability space, where Ω is a sample space, F is a σfield on Ω, and P:F[0,1] is a probability measure. With BN representing the Borel σfield on RN, consider an RNvalued independent random vector X={X1,,XN}T:(Ω,F)(RN,BN), which describes statistical uncertainties in all system and input parameters of a given stochastic problem. The probability law of X is completely defined by the joint probability density function fX(x)=i=1i=Nfi(xi), where fi(xi) is the

Variance decomposition

The ADD in Eq. (3) can be written more explicitly asy(X)=y0+i=1Nyi(Xi)+i1=1N1i2=i1+1Nyi1i2(Xi1,Xi2)++i1=1Ns+1is=is1+1Nyi1is(Xi1,,Xis)++y12N(X1,,XN),where the constant y0 and component functions yi1is(xi1,,xis), 1i1<<isN, s=1,,N, are obtained from y0RNy(x)fX(x)dx,yi(xi)RN1y(x)jifj(xj)dxjy0,yi1i2(xi1,xi2)RN2y(x)j[i1,i2]fj(xj)dxjyi1(xi1)yi2(xi2)y0,yi1is(xi1,,xis)RNsy(x)j[i1,,is]fj(xj)dxjj1<<js1{i1,,is}yj1js1(xj1,,xjs1)j1<<js2{i1,,is}yj

Fourier-polynomial expansion

Defined on the product probability triple (×p=1p=sΩip,×p=1p=sFip,×p=1p=sPip), 1sN, denote the space of square integrable s-variate component functions of y byL2(×p=1p=sΩip,×p=1p=sFip,×p=1p=sPip)yi1is(Xi1,,Xis):Rsyi1is2(xi1,,xis)×p=1sfip(xip)dxip<,which is a Hilbert space. Since the joint density of {Xi1,,Xis}T is separable (independence), the tensor product p=1sψipjp(Xip)=ψi1j1(Xi1)ψisjs(Xis) constitutes an orthonormal polynomial basis in L2. Therefore, there exists a

Numerical examples

Five numerical examples involving four well-known mathematical functions from the literature and an industrial-scale solid-mechanics problem are presented to illustrate the proposed PDD method for calculating the global sensitivity indices. The mathematical functions selected are smooth or non-smooth, permit exact solutions of the sensitivity indices, and have been studied using a number of existing methods, facilitating a critical evaluation of the PDD method developed. Whenever possible, the

Conclusions

A PDD method was developed for GSA of stochastic systems subject to independent random input following arbitrary probability distributions. The method is based on Fourier-polynomial expansions of lower-variate component functions of a stochastic response by measure-consistent orthonormal polynomial bases, analytical formulae for calculating the global sensitivity indices in terms of the expansion coefficients, and dimension-reduction integration for efficiently estimating the expansion

Acknowledgment

The author would like to acknowledge financial support from the U.S. National Science Foundation under Grant no. CMMI-0653279.

References (35)

  • I.M. Sobol

    Theorems and examples on high dimensional model representations

    Reliability Engineering and System Safety

    (2003)
  • A. Saltelli et al.

    About the use of rank transformation in sensitivity analysis of model output

    Reliability Engineering and System Safety

    (1995)
  • D. Gatelli et al.

    Calculating first-order sensitivity measures: a benchmark of some recent methodologies

    Reliability Engineering and System Safety

    (2009)
  • A. Saltelli et al.

    Global sensitivity analysis: the primer

    (2008)
  • F.E. Satterthwaite

    Random balance experimentation

    Technometrics

    (1959)
  • I.M. Sobol

    Sensitivity analysis for nonlinear mathematical models

    Mathematical Modelling & Computational Experiment

    (1993)
  • R.G. Ghanem et al.

    Stochastic finite elements: a spectral approach

    (1991)
  • Cited by (57)

    • A hybrid Gaussian process model for system reliability analysis

      2020, Reliability Engineering and System Safety
    • An adaptive least-squares global sensitivity method and application to a plasma-coupled combustion prediction with parametric correlation

      2018, Journal of Computational Physics
      Citation Excerpt :

      Compared to a projection approach [16–18], where each polynomial coefficient is obtained by computing a multi-dimensional integral, the LSR approach is more flexible (in choosing sampling points), which seems to be generally advantageous for problems involving a potentially large number of uncertain parameters. In contrast to the Blatman and Sudret [14] approach, Tang et al. [19] used ANOVA expansion and Polynomial Dimensional Decomposition (PDD) [20–24] to represent the expansion's component subspace functions. The main challenge, and motivation for improving PDD methods, is reducing the required number of samples, which corresponds to the cost of the method.

    View all citing articles on Scopus
    View full text