Global sensitivity analysis using complex linear models

A global sensitivity analysis of complex computer codes is usually performed by calculating the Sobol indices. The indices are estimated using Monte Carlo methods. The Monte Carlo simulations are time-consuming even if the computer response is replaced by a metamodel. This paper proposes a new method for calculating sensitivity indices that overcomes the Monte Carlo estimation. The method assumes a discretization of the domain of simulation and uses the expansion of the computer response on an orthogonal basis of complex functions to built a metamodel. This metamodel is then used to derive an analytical estimation of the Sobol indices. This approach is successfully tested on analytical functions and is compared with two alternative methods.

[1]  Dick den Hertog,et al.  Space-Filling Latin Hypercube Designs for Computer Experiments (Replaced by CentER DP 2008-104) , 2006 .

[2]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[3]  Bruno Sudret,et al.  Global sensitivity analysis using polynomial chaos expansions , 2008, Reliab. Eng. Syst. Saf..

[4]  M. E. Johnson,et al.  Minimax and maximin distance designs , 1990 .

[5]  Eva Riccomagno,et al.  Experimental Design and Observation for Large Systems , 1996, Journal of the Royal Statistical Society: Series B (Methodological).

[6]  Runze Li,et al.  Design and Modeling for Computer Experiments (Computer Science & Data Analysis) , 2005 .

[7]  A. Saltelli,et al.  A quantitative model-independent method for global sensitivity analysis of model output , 1999 .

[8]  I. Sobol.  Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates , 2001 .

[9]  Rainer Schwabe,et al.  Lattices and dual lattices in optimal experimental design for Fourier models , 1998 .

[10]  Thomas Hochkirchen.  Design and Modeling for Computer Experiments by K.-T. Fang, R. Li and A. Sudjianto , 2006 .

[11]  André Kobilinsky,et al.  Complex linear models and cyclic designs , 1990 .

[12]  Runze Li,et al.  Design and Modeling for Computer Experiments , 2005 .

[13]  Thomas J. Santner,et al.  Design and analysis of computer experiments , 1998 .

[14]  Thomas J. Santner,et al.  The Design and Analysis of Computer Experiments , 2003, Springer Series in Statistics.

[15]  H. Wynn,et al.  Lattice-based D-optimum design for Fourier regression , 1997 .

[16]  R. A. Bailey,et al.  Factorial Design and Abelian Groups , 1985 .

[17]  Jean-Paul Chilès,et al.  Wiley Series in Probability and Statistics , 2012 .

[18]  Dick den Hertog,et al.  Space-filling Latin hypercube designs for computer experiments , 2008 .