<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing with OASIS Tables v3.0 20080202//EN" "journalpub-oasis3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:oasis="http://docs.oasis-open.org/ns/oasis-exchange/table" xml:lang="en" dtd-version="3.0">
  <front>
    <journal-meta><journal-id journal-id-type="publisher">GMD</journal-id><journal-title-group>
    <journal-title>Geoscientific Model Development</journal-title>
    <abbrev-journal-title abbrev-type="publisher">GMD</abbrev-journal-title><abbrev-journal-title abbrev-type="nlm-ta">Geosci. Model Dev.</abbrev-journal-title>
  </journal-title-group><issn pub-type="epub">1991-9603</issn><publisher>
    <publisher-name>Copernicus Publications</publisher-name>
    <publisher-loc>Göttingen, Germany</publisher-loc>
  </publisher></journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.5194/gmd-11-3131-2018</article-id><title-group><article-title>Fast sensitivity analysis methods for computationally expensive models with
multi-dimensional output</article-title><alt-title>Computationally expensive models with multi-dimensional output</alt-title>
      </title-group><?xmltex \runningtitle{Computationally expensive models with multi-dimensional output}?><?xmltex \runningauthor{E. Ryan et al.}?>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes" rid="aff1">
          <name><surname>Ryan</surname><given-names>Edmund</given-names></name>
          <email>edmund.ryan@lancaster.ac.uk</email>
        <ext-link>https://orcid.org/0000-0002-7003-9707</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Wild</surname><given-names>Oliver</given-names></name>
          
        <ext-link>https://orcid.org/0000-0002-6227-7035</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff2">
          <name><surname>Voulgarakis</surname><given-names>Apostolos</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff3">
          <name><surname>Lee</surname><given-names>Lindsay</given-names></name>
          
        <ext-link>https://orcid.org/0000-0002-8029-6328</ext-link></contrib>
        <aff id="aff1"><label>1</label><institution>Lancaster Environment Centre, Lancaster University, Lancaster, UK</institution>
        </aff>
        <aff id="aff2"><label>2</label><institution>Department of Physics, Imperial College London, London, UK</institution>
        </aff>
        <aff id="aff3"><label>3</label><institution>School of Earth and Environment, University of Leeds, Leeds, UK</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">Edmund Ryan (edmund.ryan@lancaster.ac.uk)</corresp></author-notes><pub-date><day>3</day><month>August</month><year>2018</year></pub-date>
      
      <volume>11</volume>
      <issue>8</issue>
      <fpage>3131</fpage><lpage>3146</lpage>
      <history>
        <date date-type="received"><day>30</day><month>October</month><year>2017</year></date>
           <date date-type="rev-request"><day>13</day><month>November</month><year>2017</year></date>
           <date date-type="rev-recd"><day>30</day><month>May</month><year>2018</year></date>
           <date date-type="accepted"><day>6</day><month>June</month><year>2018</year></date>
      </history>
      <permissions>
        
        
      <license license-type="open-access"><license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p></license></permissions><self-uri xlink:href="https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018.html">This article is available from https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018.html</self-uri><self-uri xlink:href="https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018.pdf">The full text article is available as a PDF file from https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018.pdf</self-uri>
      <abstract>
    <p id="d1e121">Global sensitivity analysis (GSA) is a powerful approach in identifying which
inputs or parameters most affect a model's output. This determines
which inputs to include when performing model calibration or uncertainty
analysis. GSA allows quantification of the sensitivity index (SI) of a
particular input – the percentage of the total variability in the output
attributed to the changes in that input – by averaging over the other inputs
rather than fixing them at specific values. Traditional methods of computing
the SIs using the Sobol and extended Fourier Amplitude
Sensitivity Test (eFAST) methods involve running a
model thousands of times, but this may not be feasible for computationally
expensive Earth system models. GSA methods that use a statistical emulator in
place of the expensive model are popular, as they require far fewer model
runs. We performed an eight-input GSA, using the Sobol and eFAST methods, on
two computationally expensive atmospheric chemical transport models using
emulators that were trained with 80 runs of the models. We considered two
methods to further reduce the computational cost of GSA: (1) a
dimension reduction approach and (2) an emulator-free approach. When
the output of a model is multi-dimensional, it is common practice to build a
separate emulator for each dimension of the output space. Here, we used
principal component analysis (PCA) to reduce the output dimension, built an
emulator for each of the transformed outputs, and then computed SIs of the
reconstructed output using the Sobol method. We considered the global
distribution of the annual column mean lifetime of atmospheric methane, which
requires <inline-formula><mml:math id="M1" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 2000 emulators without PCA but only 5–40 emulators
with PCA. We also applied an emulator-free method using a generalised
additive model (GAM) to estimate the SIs using only the training runs.
Compared to the emulator-only methods, the emulator–PCA and GAM methods
accurately estimated the SIs of the <inline-formula><mml:math id="M2" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 2000 methane lifetime
outputs but were on average 24 and 37 times faster, respectively.</p>
  </abstract>
    </article-meta>
  </front>
<body>
      

<sec id="Ch1.S1" sec-type="intro">
  <title>Introduction</title>
      <p id="d1e145">Sensitivity analysis is a powerful tool for understanding the behaviour of a
numerical model. It allows quantification of the sensitivity in the model
outputs to changes in each of the model inputs. If the inputs are fixed
values such as model parameters, then sensitivity analysis allows study of
how the uncertainty in the model outputs can be attributed to the
uncertainty in these inputs. Sensitivity analysis is important for a number
of reasons: (i) to identify which parameters contribute the largest
uncertainty to the model outputs, (ii) to prioritise estimation of model
parameters from observational data, (iii) to understand the potential of
observations as a model constraint and (iv) to diagnose differences in
behaviour between different models.</p>
<sec id="Ch1.S1.SS1">
  <title>Different approaches for sensitivity analysis</title>
      <?pagebreak page3132?><p id="d1e153">By far, the most common types of sensitivity analysis are those performed
one at a time (OAT) and locally. OAT sensitivity analysis involves running a
model a number of times, varying each input in turn, whilst fixing other
inputs at their nominal values. For example, Wild (2007) showed that the
tropospheric ozone budget was highly sensitive to differences in global
<inline-formula><mml:math id="M3" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">NO</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> emissions from lightning. The observation-based range of 3–8 TgN yr<inline-formula><mml:math id="M4" display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> in the
magnitude of these emissions could result in a 10 % difference in
predicted tropospheric ozone burden. OAT sensitivity analysis is used in a
variety of research fields including environmental science  (Bailis et
al., 2005; Campbell et al., 2008; de Gee et al., 2008; Saltelli and Annoni,
2010), medicine  (Coggan et al., 2005; Stites et al., 2007; Wu et al.,
2013), economics  (Ahtikoski et al., 2008) and physics  (Hill et al.,
2012). While the ease of implementing OAT sensitivity analysis is appealing,
a major drawback of this approach is that it assumes that the model response
to different inputs is independent, which in most cases is unjustified
(Saltelli and Annoni, 2010) and can result in biased results  (Carslaw
et al., 2013).</p>
      <p id="d1e179">Global sensitivity analysis (GSA) overcomes this OAT issue by quantifying
the sensitivity of each input variable by averaging over the other inputs
rather than fixing them at nominal values. However, the number of
sensitivity analysis studies using this global method has been very small.
Ferretti et al. (2016) found that out of around 1.75 million research
articles surveyed up to 2014, only 1 in 20 of studies mentioning
“sensitivity analysis” also use or refer to “global sensitivity analysis”. A
common type of GSA is the variance-based method, which operates by
apportioning the variance of the model's output into different sources of
variation in the inputs. More specifically, it quantifies the sensitivity of
a particular input – the percentage of the total variability in the output
attributed to the changes in that input – by averaging over the other
inputs rather than fixing them at specific values. The Fourier Amplitude
Sensitivity Test (FAST) was one of the first of these variance-based methods
(Cukier et al., 1973). The classical FAST method uses spectral analysis
to apportion the variance, after first exploring the input space using
sinusoidal functions of different frequencies for each input factor or
dimension  (Saltelli et al., 2012). Modified versions of FAST include the
extended FAST (eFAST) method which improves its computational efficiency
(Saltelli et al., 1999) and the random-based-design (RBD) FAST method
which samples from the input space more efficiently  (Tarantola et al.,
2006). Another widely used GSA method is the Sobol method  (Homma and
Saltelli, 1996; Saltelli, 2002; Sobol, 1990), which has been found to
outperform FAST  (Saltelli, 2002). Most applications of the Sobol and FAST
methods involve a small number of input factors. However, Mara and
Tarantola (2008) carried out a 100-input sensitivity analysis using the RBD version
of FAST and a modified version of the Sobol method and found that both
methods gave estimates of the sensitivity indices (SIs) that were close to the known analytical
solutions. A downside to the Sobol method is that a large number of runs of
the model typically need to be carried out. For the model used in Mara and
Tarantola (2008), 10 000 runs were required for the Sobol method but only
1000 were needed for FAST.</p>
</sec>
<sec id="Ch1.S1.SS2">
  <title>Emulators and meta-models</title>
      <p id="d1e188">If a model is computationally expensive, carrying out 1000 simulations may
not be feasible. A solution is to use a surrogate function for the model
called a meta-model that maps the same set of inputs to the same set of
outputs but is computationally much faster. Thus, much less time is
required to perform GSA using the meta-model than using the slow-running
model. A meta-model can be any function that maps the inputs of a model to
its outputs, e.g. linear or quadratic functions, splines, neural networks.
A neural network, for example, works well if there are discontinuities
in the input–output mapping, but such a method can require thousands of runs
of the computationally expensive model to train it (particularly
if the output is highly multi-dimensional) which will likely be too
time-consuming. Here, we use a statistical emulator because it requires far
fewer training runs and it has two useful properties. First, an emulator is
an interpolating function which means that at inputs of the expensive model that are
used to train the emulator, the resulting outputs of the emulator must
exactly match those of the expensive model  (Iooss and Lemaître, 2015).
Secondly, for inputs that the emulator is not trained at, a probability
distribution of the outputs that represents their uncertainty is given  (O'Hagan, 2006).
The vast majority of emulators are based on Gaussian process (GP) theory due
to its attractive properties  (Kennedy and O'Hagan, 2000; O'Hagan, 2006;
Oakley and O'Hagan, 2004), which make GP emulators easy to implement while
providing accurate representations of the computationally expensive model
(e.g. Chang et al., 2015; Gómez-Dans et al., 2016; Kennedy et al.,
2008; Lee et al., 2013). A GP is a multivariate normal distribution applied
to a function rather than a set of variables. The original GP emulator in a
Bayesian setting was developed by Currin et al. (1991) (for a basic
overview, see also O'Hagan, 2006) and is mathematically equivalent to the
kriging interpolation methods used in geostatistics  (e.g. Cressie,
1990; Ripley, 2005). Kriging regression has been used as an emulator method
since the 1990s  (Koehler and Owen, 1996; Welch et al., 1992). More
recently, there has been considerable interest in using this kriging emulator
approach for practical purposes such as GSA or inverse modelling
(Marrel et al., 2009; Roustant et al., 2012). Examples of its
application can be found in atmospheric modelling  (Carslaw et al.,
2013; Lee et al., 2013), medicine (Degroote et al., 2012) and electrical
engineering  (Pistone and Vicario, 2013).</p>
      <p id="d1e191">For GSA studies involving multi-dimensional output, a traditional approach
is to apply a separate GP emulator for each dimension of the output space.
However, if the output consists of many thousands of points on a spatial map
or time series  (Lee et al., 2013), then the need to use thousands of
emulators can impose substantial computational constraints even using the
FAST methods. A solution is to adopt a GSA method that does not rely on an
emulator but is based on generalised additive modelling  (Mara and
Tarantola, 2008;<?pagebreak page3133?> Strong et al., 2014, 2015b) or on a partial
least squares approach  (Chang et al., 2015; Sobie, 2009). A separate
generalised additive model (GAM) can be built for each input against the
output of the expensive model, and the sensitivity of the output to changes
in each input is then computed using these individual GAM models. Partial
least squares (PLS) is an extension of the more traditional multivariate
linear regression where the number of samples (i.e. model runs in this
context) can be small, and they may even be less that the number of inputs
(Sobie, 2009).</p>
      <p id="d1e194">An alternative way of reducing the computational constraints is to use
principal component analysis (PCA) to reduce the dimensionality of the
output. This means that we require far fewer emulators to represent the
outputs, reducing the GSA calculations by a large margin, although there is
some loss of detail. This emulator–PCA hybrid approach has been successfully
used in radiative transfer models  (Gómez-Dans et al., 2016), a very
simple chemical reaction model  (Saltelli et al., 2012) and general
circulation models  (Sexton et al., 2012). While we hypothesise that both
emulator-free and PCA-based methods are suited to large-scale GSA problems
(e.g. those involving more than 20 input factors), a focus of our work is to
determine the accuracy of these methods for a smaller-scale GSA study.</p>
</sec>
<sec id="Ch1.S1.SS3">
  <title>Aims of this study</title>
      <p id="d1e203">Recent research comparing different GSA methods based on Gaussian process
emulators has been limited in application to relatively simple models and
low-dimensional output  (Mara and Tarantola, 2008). Using two
computationally expensive models of global atmospheric chemistry and
transport – namely the Frontier Research System for Global Change/University
of California at Irvine (FRSGC/UCI) and Goddard Institute for Space Studies
(GISS) models – we compare the accuracy and
efficiency of global sensitivity analysis using emulators and emulator-free
methods, and we investigate the benefits of using PCA to reduce the number
of emulators needed. We compare and contrast a number of ways of computing
the first-order sensitivity indices for the expensive atmospheric models:
(i) the Sobol method using an emulator, (ii) the extended FAST method using
an emulator, (iii) generalised additive modelling, (iv) a partial least
squares approach and (v) an emulator–PCA hybrid approach. Hereafter, we refer
to (i) and (ii) as emulator-based GSA methods and (iii) and (iv) as
emulator-free GSA methods.</p>
</sec>
</sec>
<sec id="Ch1.S2">
  <title>Materials and methods</title>
<sec id="Ch1.S2.SS1">
  <title>Atmospheric chemistry models</title>
      <p id="d1e218">Global atmospheric chemistry and transport models simulate the composition
of trace gases in the atmosphere (e.g. <inline-formula><mml:math id="M5" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">O</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M6" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, CO, <inline-formula><mml:math id="M7" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">SO</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>) at a
given spatial resolution (latitude <inline-formula><mml:math id="M8" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> longitude <inline-formula><mml:math id="M9" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> altitude).
The evolution in atmospheric composition over time is controlled
by a range of different dynamical and chemical processes, our understanding
of which remains incomplete. Trace gases are emitted from anthropogenic
sources (e.g. NO from traffic and industry) and from natural sources (e.g.
isoprene from vegetation, NO from lightning), they may undergo chemical
transformation (e.g. formation of <inline-formula><mml:math id="M10" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">O</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>) and transport (e.g. convection
or boundary layer mixing), and they may be removed through wet or dry deposition.
Global sensitivity analysis is needed to understand the sensitivity of our
simulations of atmospheric composition and its evolution to assumptions
about these governing processes.</p>
      <p id="d1e280">In this study, we performed GSA on two such
atmospheric models. We used the FRSGC/UCI chemistry transport model (CTM)
(Wild et al., 2004; Wild and Prather, 2000) and the GISS general circulation model
(GCM) (Schmidt et al., 2014; Shindell et al., 2006). We used results from 104
model runs carried out with both of these models from a comparative GSA
study  (Wild et al., 2018). This involved varying eight inputs or
parameters over specified ranges using a maximin Latin hypercube design:
global surface <inline-formula><mml:math id="M11" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">NO</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> emissions (30–50 TgN yr<inline-formula><mml:math id="M12" display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>), global lightning <inline-formula><mml:math id="M13" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">NO</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>
emissions (2–8 TgN yr<inline-formula><mml:math id="M14" display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>), global isoprene emissions (200–800 TgC yr<inline-formula><mml:math id="M15" display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>), dry
deposition rates (model value <inline-formula><mml:math id="M16" display="inline"><mml:mo>±</mml:mo></mml:math></inline-formula>80 %), wet deposition rates (model
value <inline-formula><mml:math id="M17" display="inline"><mml:mo>±</mml:mo></mml:math></inline-formula>80 %), humidity (model value <inline-formula><mml:math id="M18" display="inline"><mml:mo>±</mml:mo></mml:math></inline-formula>50 %), cloud optical
depth (model value <inline-formula><mml:math id="M19" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 0.1–10) and boundary layer mixing (model
value <inline-formula><mml:math id="M20" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 0.01–100). For this study, we focus on a single model
output, namely the global distribution of tropospheric columns of mean methane (<inline-formula><mml:math id="M21" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>) lifetime at the annual timescale. The <inline-formula><mml:math id="M22" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> lifetime is an important
indicator of the amount of highly reactive hydroxyl radical in the
troposphere  (Voulgarakis et al., 2013), and we choose this output
because of its contrasting behaviour in the two models. The native spatial
resolution of the models is 2.8<inline-formula><mml:math id="M23" display="inline"><mml:msup><mml:mi/><mml:mo>∘</mml:mo></mml:msup></mml:math></inline-formula> <inline-formula><mml:math id="M24" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 2.8<inline-formula><mml:math id="M25" display="inline"><mml:msup><mml:mi/><mml:mo>∘</mml:mo></mml:msup></mml:math></inline-formula> for
FRSGC and 2.5<inline-formula><mml:math id="M26" display="inline"><mml:msup><mml:mi/><mml:mo>∘</mml:mo></mml:msup></mml:math></inline-formula> <inline-formula><mml:math id="M27" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 2.0<inline-formula><mml:math id="M28" display="inline"><mml:msup><mml:mi/><mml:mo>∘</mml:mo></mml:msup></mml:math></inline-formula> for GISS, but we combine
neighbouring grid points so that both models have a comparable resolution of
5–6<inline-formula><mml:math id="M29" display="inline"><mml:msup><mml:mi/><mml:mo>∘</mml:mo></mml:msup></mml:math></inline-formula>, giving a total of 2048 grid points for FRSGC/UCI and 2160
grid points for GISS.</p>
</sec>
<sec id="Ch1.S2.SS2">
  <title>Global sensitivity analysis using the Sobol and extended FAST methods</title>
      <?pagebreak page3134?><p id="d1e466">For brevity and generality, we hereafter refer to each of the atmospheric
chemical transport models as a simulator. A common way of conducting global
sensitivity analysis for each point in the output space of the simulator –
where the output consists of, for example, a spatial map or a time series –
is to compute the first-order sensitivity indices (SIs) using variance-based
decomposition; this apportions the variance in simulator output (a scalar)
to different sources of variation in the different model inputs. Assuming
the input variables are independent of one another – which they are for this study – the first-order SI, corresponding to the <inline-formula><mml:math id="M30" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th input variable
(<inline-formula><mml:math id="M31" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, ..., <inline-formula><mml:math id="M32" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>) and the <inline-formula><mml:math id="M33" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th point in the output space, is given
by
            <disp-formula id="Ch1.E1" content-type="numbered"><mml:math id="M34" display="block"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mtext>Var</mml:mtext><mml:mfenced close="]" open="["><mml:mrow><mml:mi>E</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi mathvariant="normal">|</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:mtext>Var</mml:mtext><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>×</mml:mo><mml:mn mathvariant="normal">100</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where <inline-formula><mml:math id="M35" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the <inline-formula><mml:math id="M36" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th column of the <inline-formula><mml:math id="M37" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> matrix
<inline-formula><mml:math id="M38" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula>
(i.e. a matrix with <inline-formula><mml:math id="M39" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> rows and <inline-formula><mml:math id="M40" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula> columns) which
stores the <inline-formula><mml:math id="M41" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> samples of <inline-formula><mml:math id="M42" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>-dimensional inputs, and <inline-formula><mml:math id="M43" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the <inline-formula><mml:math id="M44" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th
column of the <inline-formula><mml:math id="M45" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math></inline-formula> matrix which stores the corresponding <inline-formula><mml:math id="M46" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula>
sets of <inline-formula><mml:math id="M47" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula>-dimensional outputs (Table 1). We multiply by 100 so that the SI
is given as a percentage. The notation given by Var<inline-formula><mml:math id="M48" display="inline"><mml:mrow><mml:mo>(</mml:mo><mml:mo>⋅</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and
<inline-formula><mml:math id="M49" display="inline"><mml:mrow><mml:mi>E</mml:mi><mml:mo>(</mml:mo><mml:mo>⋅</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the mathematical operations that compute the variance
and expectation. The simplest way of computing <inline-formula><mml:math id="M50" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is by brute force,
but this is also the most computationally intensive  (Saltelli et al., 2008).</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T1" specific-use="star"><caption><p id="d1e718">Summary of algebraic terms used in this study that are common to all
of most of the statistical methods described in this study. For brevity, the
terms that are specific to a particular method are not listed
here.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="2">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="justify" colwidth="395pt"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Symbol</oasis:entry>
         <oasis:entry colname="col2">Description</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M51" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">The first-order sensitivity index corresponding to the <inline-formula><mml:math id="M52" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th input variable (<inline-formula><mml:math id="M53" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, ..., <inline-formula><mml:math id="M54" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>) and the <inline-formula><mml:math id="M55" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th point in the output space</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M56" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">In general, <inline-formula><mml:math id="M57" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of executions of the simulator required to compute the sensitivity indices. For this study, <inline-formula><mml:math id="M58" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of executions of the “emulator” required to compute the sensitivity indices since the simulator is computationally too slow to run. For the Sobol and eFAST methods, <inline-formula><mml:math id="M59" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1000</mml:mn></mml:mrow></mml:math></inline-formula>–10 000 (for this study, we used <inline-formula><mml:math id="M60" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> 000 for Sobol and <inline-formula><mml:math id="M61" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula> for eFAST). For the GAM and PLS methods, we believe <inline-formula><mml:math id="M62" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>&lt;</mml:mo><mml:mn mathvariant="normal">100</mml:mn></mml:mrow></mml:math></inline-formula> is sufficient (for this study, we used <inline-formula><mml:math id="M63" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">80</mml:mn></mml:mrow></mml:math></inline-formula>)</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M64" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">The number of input variables/the dimension of the input space</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M65" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">The number of output variables/the dimension of the output space</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M66" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">The number of executions of the simulator required to train an emulator (for this study, <inline-formula><mml:math id="M67" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">80</mml:mn></mml:mrow></mml:math></inline-formula>)</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M68" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">Apart from Eq. (1), <inline-formula><mml:math id="M69" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> refers to the <inline-formula><mml:math id="M70" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>×</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> matrix which stores the <inline-formula><mml:math id="M71" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> sets of <inline-formula><mml:math id="M72" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>-dimensional inputs that are used for two purposes: (i) in the calculations to train the emulators that are used to replace the simulator (see Sect. 2.3) and (ii) in the calculation of the sensitivity indices using the sensitivity analysis methods that do not require an emulator (namely GAM and PLS). For Eq. (1), <inline-formula><mml:math id="M73" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> also refers to the <inline-formula><mml:math id="M74" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> matrix to compute the SIs if the simulator is computationally cheap to run.</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M75" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">A column vector represented by the <inline-formula><mml:math id="M76" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th column of matrix <inline-formula><mml:math id="M77" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> (<inline-formula><mml:math id="M78" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, ..., <inline-formula><mml:math id="M79" display="inline"><mml:mrow><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M80" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">The row vector represented by the <inline-formula><mml:math id="M81" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th row of matrix <inline-formula><mml:math id="M82" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> (<inline-formula><mml:math id="M83" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, ..., <inline-formula><mml:math id="M84" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M85" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">The <inline-formula><mml:math id="M86" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math></inline-formula> matrix which stores the <inline-formula><mml:math id="M87" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> sets of <inline-formula><mml:math id="M88" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula>-dimensional simulator outputs (corresponding to the <inline-formula><mml:math id="M89" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> sets of inputs stored in <inline-formula><mml:math id="M90" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula>) that are used as part of the calculation to compute the sensitivity indices</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"><inline-formula><mml:math id="M91" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">The <inline-formula><mml:math id="M92" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th column of matrix <inline-formula><mml:math id="M93" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula> (<inline-formula><mml:math id="M94" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, ..., <inline-formula><mml:math id="M95" display="inline"><mml:mrow><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M96" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">The simulator output after the simulator has been run at the <inline-formula><mml:math id="M97" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>-dimensional input given by <inline-formula><mml:math id="M98" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math id="M99" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, ..., <inline-formula><mml:math id="M100" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

<sec id="Ch1.S2.SS2.SSS1">
  <title>The Sobol method</title>
      <p id="d1e1291">The Sobol method, developed in the 1990s, is much faster than brute force at
computing the terms in Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>), in part because it requires fewer
executions of the simulator  (Homma and Saltelli, 1996; Saltelli, 2002;
Saltelli et al., 2008; Sobol, 1990). The method operates by first generating
a <inline-formula><mml:math id="M101" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> matrix (i.e. a matrix with <inline-formula><mml:math id="M102" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> rows and 2<inline-formula><mml:math id="M103" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula> columns) of random
numbers from a space-filling sampling design (e.g. a maximin Latin hypercube
design), where <inline-formula><mml:math id="M104" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of sets of inputs and <inline-formula><mml:math id="M105" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula> is the number of input
variables. The inputs are on the normalised scale so that each element of a
<inline-formula><mml:math id="M106" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>-dimensional input lies between 0 and 1. Typical values for <inline-formula><mml:math id="M107" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> are
1000–10 000. The matrix is split in half to form two new matrices, <inline-formula><mml:math id="M108" display="inline"><mml:mi mathvariant="bold">A</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M109" display="inline"><mml:mi mathvariant="bold">B</mml:mi></mml:math></inline-formula>,
each of size <inline-formula><mml:math id="M110" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>. To compute the <inline-formula><mml:math id="M111" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th SI (1 <inline-formula><mml:math id="M112" display="inline"><mml:mrow><mml:mo>≤</mml:mo><mml:mi>i</mml:mi><mml:mo>≤</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, we define
two new matrices, <inline-formula><mml:math id="M113" display="inline"><mml:mi mathvariant="bold">Ci</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M114" display="inline"><mml:mi mathvariant="bold">Di</mml:mi></mml:math></inline-formula>, where <inline-formula><mml:math id="M115" display="inline"><mml:mi mathvariant="bold">Ci</mml:mi></mml:math></inline-formula> is formed by taking the <inline-formula><mml:math id="M116" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th column from
<inline-formula><mml:math id="M117" display="inline"><mml:mi mathvariant="bold">A</mml:mi></mml:math></inline-formula> and the remaining columns from <inline-formula><mml:math id="M118" display="inline"><mml:mi mathvariant="bold">B</mml:mi></mml:math></inline-formula>, and <inline-formula><mml:math id="M119" display="inline"><mml:mi mathvariant="bold">Di</mml:mi></mml:math></inline-formula> is formed by taking the <inline-formula><mml:math id="M120" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th column
from <inline-formula><mml:math id="M121" display="inline"><mml:mi mathvariant="bold">B</mml:mi></mml:math></inline-formula> and the remaining columns from <inline-formula><mml:math id="M122" display="inline"><mml:mi mathvariant="bold">A</mml:mi></mml:math></inline-formula>. We then execute the simulator –
denoted by <inline-formula><mml:math id="M123" display="inline"><mml:mi>f</mml:mi></mml:math></inline-formula> – at each set of inputs given by the rows of matrices
<inline-formula><mml:math id="M124" display="inline"><mml:mi mathvariant="bold">A</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M125" display="inline"><mml:mi mathvariant="bold">B</mml:mi></mml:math></inline-formula>,
<inline-formula><mml:math id="M126" display="inline"><mml:mi mathvariant="bold">Ci</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M127" display="inline"><mml:mi mathvariant="bold">Di</mml:mi></mml:math></inline-formula>. This gives vectors
<inline-formula><mml:math id="M128" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math id="M129" display="inline"><mml:mi mathvariant="bold">A</mml:mi></mml:math></inline-formula>),
<inline-formula><mml:math id="M130" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math id="M131" display="inline"><mml:mi mathvariant="bold">B</mml:mi></mml:math></inline-formula>),
<inline-formula><mml:math id="M132" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math id="M133" display="inline"><mml:mi mathvariant="bold">Ci</mml:mi></mml:math></inline-formula>) and
<inline-formula><mml:math id="M134" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math id="M135" display="inline"><mml:mi mathvariant="bold">Di</mml:mi></mml:math></inline-formula>). Vectors
<inline-formula><mml:math id="M136" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M137" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>
are then substituted into
Eq. (<xref ref-type="disp-formula" rid="Ch1.E2"/>):

                  <disp-formula specific-use="align" content-type="numbered"><mml:math id="M138" display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mover accent="true"><mml:mtext>Var</mml:mtext><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mfenced close="]" open="["><mml:mrow><mml:mover accent="true"><mml:mi>E</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi mathvariant="normal">|</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:mover accent="true"><mml:mtext>Var</mml:mtext><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>×</mml:mo><mml:mn mathvariant="normal">100</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mlabeledtr id="Ch1.E2"><mml:mtd/><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msup><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mn mathvariant="bold">2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mn mathvariant="bold">2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>×</mml:mo><mml:mn mathvariant="normal">100</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr></mml:mtable></mml:math></disp-formula>

              where <inline-formula><mml:math id="M139" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, and
<inline-formula><mml:math id="M140" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> and
<inline-formula><mml:math id="M141" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> are the
<inline-formula><mml:math id="M142" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th elements of <inline-formula><mml:math id="M143" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and
<inline-formula><mml:math id="M144" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (equivalent formula for <inline-formula><mml:math id="M145" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>). For all <inline-formula><mml:math id="M146" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula> input variables, the
total number of simulator runs is <inline-formula><mml:math id="M147" display="inline"><mml:mrow><mml:mn mathvariant="normal">12</mml:mn><mml:mo>×</mml:mo><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>. Saltelli (2002)
and Tarantola et al. (2006) suggested using eight variants of
Eq. (<xref ref-type="disp-formula" rid="Ch1.E2"/>), using different combinations of
<inline-formula><mml:math id="M148" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M149" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M150" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and
<inline-formula><mml:math id="M151" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (Appendix A). Lilburne and
Tarantola (2009) proposed using the average of these eight SI estimates as they
deemed this to be more accurate than a single estimate. We used this approach
by Lilburne and Tarantola (2009) for this study.</p>
</sec>
<sec id="Ch1.S2.SS2.SSS2">
  <title>The extended FAST  method</title>
      <p id="d1e2043">An alternative and even faster way of estimating the terms in Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>)
is to use the eFAST method, first developed by Saltelli et al. (1999)
and widely used since (Carslaw et al., 2013; Koehler and Owen, 1996;
Queipo et al., 2005; Saltelli et al., 2008; Vanuytrecht et al., 2014; Vu-Bac
et al., 2015). A multi-dimensional Fourier transformation of the simulator
<inline-formula><mml:math id="M152" display="inline"><mml:mi>f</mml:mi></mml:math></inline-formula> allows a variance-based decomposition that samples the input space along a
curve defined by
              <disp-formula id="Ch1.E3" content-type="numbered"><mml:math id="M153" display="block"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfenced close=")" open="("><mml:mrow><mml:mtext>sin</mml:mtext><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="italic">ω</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
            where <inline-formula><mml:math id="M154" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>=</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, ..., <inline-formula><mml:math id="M155" display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>) refers to a general point in the input space that
has been sampled, <inline-formula><mml:math id="M156" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>∈</mml:mo><mml:mi>R</mml:mi></mml:mrow></mml:math></inline-formula> is a variable over the range (<inline-formula><mml:math id="M157" display="inline"><mml:mrow><mml:mo>-</mml:mo><mml:mi mathvariant="normal">∞</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M158" display="inline"><mml:mrow><mml:mi mathvariant="normal">∞</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M159" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the <inline-formula><mml:math id="M160" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th transformation function (Appendix A), and <inline-formula><mml:math id="M161" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ω</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>
is the <inline-formula><mml:math id="M162" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th user-specified frequency corresponding to each input.
Varying <inline-formula><mml:math id="M163" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula> allows a multi-dimensional exploration of the input space due to
the <inline-formula><mml:math id="M164" display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>s being simultaneously varied. Depending on the simulator, we
typically require <inline-formula><mml:math id="M165" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1000</mml:mn></mml:mrow></mml:math></inline-formula>–10 000 samples from the input space. After
applying the simulator <inline-formula><mml:math id="M166" display="inline"><mml:mi>f</mml:mi></mml:math></inline-formula>, the resulting scalar output – denoted generally
by <inline-formula><mml:math id="M167" display="inline"><mml:mi>y</mml:mi></mml:math></inline-formula> –  produces different periodic functions based on different <inline-formula><mml:math id="M168" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ω</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.
If the output <inline-formula><mml:math id="M169" display="inline"><mml:mi>y</mml:mi></mml:math></inline-formula> is sensitive to changes in the <inline-formula><mml:math id="M170" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th input factor, the
periodic function of <inline-formula><mml:math id="M171" display="inline"><mml:mi>y</mml:mi></mml:math></inline-formula> corresponding to frequency <inline-formula><mml:math id="M172" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ω</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> will have
a high amplitude.</p>
      <p id="d1e2280">More specifically, we express the model <inline-formula><mml:math id="M173" display="inline"><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mfenced open="(" close=")"><mml:mi>s</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mfenced close=")" open="("><mml:mi>s</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mfenced open="(" close=")"><mml:mi>s</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:msub><mml:mfenced close=")" open="("><mml:mi>s</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> as a Fourier series:
              <disp-formula id="Ch1.E4" content-type="numbered"><mml:math id="M174" display="block"><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mfenced close=")" open="("><mml:mi>s</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi mathvariant="normal">∞</mml:mi></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mtext>cos</mml:mtext><mml:mfenced open="(" close=")"><mml:mrow><mml:mi>j</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:msub><mml:mi>B</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi>sin⁡</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:mi>j</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e2397">Using a domain of frequencies given by <inline-formula><mml:math id="M175" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mi>Z</mml:mi><mml:mo>=</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mo>-</mml:mo><mml:mi mathvariant="normal">∞</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">∞</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, the Fourier
coefficients <inline-formula><mml:math id="M176" display="inline"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M177" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are defined by

                  <disp-formula id="Ch1.E5" content-type="numbered"><mml:math id="M178" display="block"><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><?xmltex \hack{\hbox\bgroup\fontsize{9}{9}\selectfont$\displaystyle}?><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mi mathvariant="italic">π</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∫</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mi mathvariant="italic">π</mml:mi></mml:mrow><mml:mi mathvariant="italic">π</mml:mi></mml:munderover><mml:mi>f</mml:mi><mml:mfenced close=")" open="("><mml:mi>s</mml:mi></mml:mfenced><mml:mi>cos⁡</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:mi>j</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfenced><mml:mo>.</mml:mo><mml:mi mathvariant="normal">d</mml:mi><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>B</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mi mathvariant="italic">π</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∫</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mi mathvariant="italic">π</mml:mi></mml:mrow><mml:mi mathvariant="italic">π</mml:mi></mml:munderover><mml:mi>f</mml:mi><mml:mfenced close=")" open="("><mml:mi>s</mml:mi></mml:mfenced><mml:mi>sin⁡</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:mi>j</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfenced><mml:mo>.</mml:mo><mml:mi mathvariant="normal">d</mml:mi><mml:mi>s</mml:mi><?xmltex \hack{$\egroup}?><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <?pagebreak page3135?><p id="d1e2576">With <inline-formula><mml:math id="M179" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ω</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> stated in Eq. (<xref ref-type="disp-formula" rid="Ch1.E3"/>), the variance of model output
attributed to changes in the <inline-formula><mml:math id="M180" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th input variable for the <inline-formula><mml:math id="M181" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th point in the
output space (numerator of Eq. 1) is defined as
              <disp-formula id="Ch1.E6.1" content-type="subnumberedon"><mml:math id="M182" display="block"><mml:mrow><mml:mover accent="true"><mml:mtext>Var</mml:mtext><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mfenced close="]" open="["><mml:mrow><mml:mover accent="true"><mml:mi>E</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi mathvariant="normal">|</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>q</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>∈</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:msup><mml:mi>Z</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msup></mml:mrow></mml:munder><mml:msubsup><mml:mi>A</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:msub><mml:mi mathvariant="italic">ω</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>B</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:msub><mml:mi mathvariant="italic">ω</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
            where <inline-formula><mml:math id="M183" display="inline"><mml:mrow><mml:msup><mml:mi>Z</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> is the set of all integers except zero. The total variance
(denominator of Eq. 1) is
              <disp-formula id="Ch1.E6.2" content-type="subnumberedoff"><mml:math id="M184" display="block"><mml:mrow><mml:mover accent="true"><mml:mtext>Var</mml:mtext><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi>Z</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msup></mml:mrow></mml:munder><mml:msubsup><mml:mi>A</mml:mi><mml:mi>k</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>B</mml:mi><mml:mi>k</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e2750">Further details of eFAST are given in Saltelli et al. (1999). The
differences between the original and the extended versions of the FAST method
are given in Appendix A.</p>
</sec>
</sec>
<sec id="Ch1.S2.SS3">
  <title>Gaussian process emulators</title>
      <p id="d1e2760">When the simulator is computationally expensive to run – like the atmospheric chemical
transport models used here – we substitute it with an emulator which is a
surrogate of the expensive simulator but much faster to run. If we are
confident that the emulator is accurate, then we can compute the first-order
SIs from the Sobol and eFAST methods using the outputs of the emulator
rather than the simulator. Mathematically, an emulator is a statistical
model that mimics the input–output relationship of a simulator. As stated in
the introduction, an emulator is an interpolating function at model outputs it is
trained at and gives a probability distribution and other outputs
(O'Hagan, 2006).</p>
      <?pagebreak page3136?><p id="d1e2763">An emulator is trained using <inline-formula><mml:math id="M185" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> sets of <inline-formula><mml:math id="M186" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>-dimensional inputs denoted by
<inline-formula><mml:math id="M187" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M188" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, ..., <inline-formula><mml:math id="M189" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M190" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> sets of one-dimensional outputs from the
simulator given by <inline-formula><mml:math id="M191" display="inline"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M192" display="inline"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>,
..., <inline-formula><mml:math id="M193" display="inline"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>N</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>N</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>; <inline-formula><mml:math id="M194" display="inline"><mml:mi>f</mml:mi></mml:math></inline-formula> represents the simulator and for our study <inline-formula><mml:math id="M195" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">80</mml:mn></mml:mrow></mml:math></inline-formula> (see
Sect. 2.6). The most common form of an emulator is a GP since it has attractive mathematical properties that allow an
analytical derivation of the mean and variance of the emulated output (given
by <inline-formula><mml:math id="M196" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>f</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for a general input <inline-formula><mml:math id="M197" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula>). A notable exception is Goldstein and
Rougier (2006), who used a non-GP emulator based on a Bayes linear
approach. More formally, a GP is an extension of the multivariate Gaussian
distribution to infinitely many variables  (Rasmussen, 2006). The
multivariate Gaussian distribution is specified by a mean vector <inline-formula><mml:math id="M198" display="inline"><mml:mi mathvariant="bold-italic">μ</mml:mi></mml:math></inline-formula> and
covariance matrix <inline-formula><mml:math id="M199" display="inline"><mml:mi mathvariant="bold">Σ</mml:mi></mml:math></inline-formula>. A GP has a mean function which is
typically
given by <inline-formula><mml:math id="M200" display="inline"><mml:mrow><mml:mi>m</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and covariance function given by <inline-formula><mml:math id="M201" display="inline"><mml:mrow><mml:mi>c</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M202" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>) <inline-formula><mml:math id="M203" display="inline"><mml:mo>=</mml:mo></mml:math></inline-formula>
cov(<inline-formula><mml:math id="M204" display="inline"><mml:mrow><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M205" display="inline"><mml:mrow><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>)), where <inline-formula><mml:math id="M206" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M207" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>
are two different <inline-formula><mml:math id="M208" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>-dimensional inputs. For the
latter, we used a Matern (5/2) function  (Roustant et al., 2012), which is
given by

                <disp-formula specific-use="align" content-type="numbered"><mml:math id="M209" display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mi>c</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:mfenced></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mo>=</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>+</mml:mo><mml:msqrt><mml:mn mathvariant="normal">5</mml:mn></mml:msqrt><mml:mfenced close=")" open="("><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mfenced open="|" close="|"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>-</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:mfenced></mml:mrow><mml:mi mathvariant="bold-italic">θ</mml:mi></mml:mfrac></mml:mstyle></mml:mfenced><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">5</mml:mn><mml:mn mathvariant="normal">3</mml:mn></mml:mfrac></mml:mstyle><mml:msup><mml:mfenced open="(" close=")"><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mfenced open="|" close="|"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>-</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:mfenced></mml:mrow><mml:mi mathvariant="bold-italic">θ</mml:mi></mml:mfrac></mml:mstyle></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mlabeledtr id="Ch1.E7"><mml:mtd/><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mo>×</mml:mo><mml:mtext>exp</mml:mtext><mml:mfenced close=")" open="("><mml:mrow><mml:mo>-</mml:mo><mml:msqrt><mml:mn mathvariant="normal">5</mml:mn></mml:msqrt><mml:mfenced close=")" open="("><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mfenced close="|" open="|"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>-</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:mfenced></mml:mrow><mml:mi mathvariant="bold-italic">θ</mml:mi></mml:mfrac></mml:mstyle></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr></mml:mtable></mml:math></disp-formula>

            where <inline-formula><mml:math id="M210" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula> denotes the standard deviation and <inline-formula><mml:math id="M211" display="inline"><mml:mi mathvariant="bold-italic">θ</mml:mi></mml:math></inline-formula> is the vector of range
parameters (sometimes called length scales). These emulator parameters are normally
estimated using maximum likelihood  (see Bastos and O'Hagan, 2009, for
details). GP emulators for uncertainty quantification were originally
developed within a Bayesian framework  (Currin et al., 1991; Kennedy and
O'Hagan, 2000; O'Hagan, 2006; Oakley and O'Hagan, 2004).</p>
      <p id="d1e3208">Developed around the same time, the kriging interpolation methods used in
geostatistics are mathematically equivalent to the GP methods developed by
Currin et al. (1991) (e.g. Cressie, 1990; Ripley, 2005). Kriging-based
emulators have been used for 25 years  (Koehler and Owen, 1996; Welch et
al., 1992), with recent implementations including the DICE-Kriging R
packages used for GSA and inverse modelling  (Marrel et al., 2009;
Roustant et al., 2012). Since the latter approach is computationally faster,
we adopted the DICE-Kriging version of the GP emulator for this study. For
the statistical theory behind both emulator versions and descriptions of
related R packages, see Hankin (2005) and Roustant et al. (2012).</p>
</sec>
<sec id="Ch1.S2.SS4">
  <title>Emulator-free global sensitivity analysis</title>
      <p id="d1e3217">For GSA studies involving highly multi-dimensional output, the time to
compute the SIs can be significantly reduced by employing an emulator-free
GSA approach. In this study, we consider two such methods using (i) GAM and (ii) a PLS
regression approach. For both the GAM and PLS methods, we used <inline-formula><mml:math id="M212" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> simulator
runs to compute the sensitivity indices (Table 1), and for our study these
were the same <inline-formula><mml:math id="M213" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">80</mml:mn></mml:mrow></mml:math></inline-formula> runs that were used to train the emulators described
in Sect. 2.3. In the descriptions of these two sensitivity analysis
methods (Sect. 2.4.1 and  2.4.2), we thus use
<inline-formula><mml:math id="M214" display="inline"><mml:mrow><mml:mi mathvariant="bold">X</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M215" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula> to denote
the matrices that store <inline-formula><mml:math id="M216" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> sets of <inline-formula><mml:math id="M217" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>-dimensional inputs and <inline-formula><mml:math id="M218" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula>-dimensional
outputs.</p>
<sec id="Ch1.S2.SS4.SSS1">
  <title>The generalised additive modelling method</title>
      <p id="d1e3313">A GAM is a generalised linear model where the
predictor variables are represented by smooth functions  (Wood, 2017). The
general form of a GAM is

                  <disp-formula id="Ch1.E8" specific-use="align" content-type="subnumberedsingle"><mml:math id="M219" display="block"><mml:mtable displaystyle="true"><mml:mlabeledtr id="Ch1.E8.1"><mml:mtd/><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mfenced open="(" close=")"><mml:mi mathvariant="bold">X</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:mi mathvariant="italic">ε</mml:mi></mml:mrow></mml:mtd></mml:mlabeledtr><mml:mlabeledtr id="Ch1.E8.2"><mml:mtd/><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mi>g</mml:mi><mml:mfenced close=")" open="("><mml:mi mathvariant="bold">X</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:mi>s</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>+</mml:mo><mml:mi>s</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr></mml:mtable></mml:math></disp-formula>

              where <inline-formula><mml:math id="M220" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi mathvariant="normal">i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the <inline-formula><mml:math id="M221" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th column of input
matrix <inline-formula><mml:math id="M222" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> (<inline-formula><mml:math id="M223" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, ..., <inline-formula><mml:math id="M224" display="inline"><mml:mrow><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>;
<inline-formula><mml:math id="M225" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the <inline-formula><mml:math id="M226" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th column of output
matrix <inline-formula><mml:math id="M227" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula> (<inline-formula><mml:math id="M228" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, ..., <inline-formula><mml:math id="M229" display="inline"><mml:mrow><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> since we construct a separate GAM for
each point in the output space (i.e. for each latitude–longitude point in
our case); <inline-formula><mml:math id="M230" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>(</mml:mo><mml:mo>.</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the smoothing function such as a cubic spline; and
<inline-formula><mml:math id="M231" display="inline"><mml:mi mathvariant="italic">ε</mml:mi></mml:math></inline-formula> is a zero-mean normally distributed error term with constant
variance. If we wish to include second-order terms in <inline-formula><mml:math id="M232" display="inline"><mml:mrow><mml:mi>g</mml:mi><mml:mfenced close=")" open="("><mml:mi mathvariant="bold">X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula>, we would add <inline-formula><mml:math id="M233" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:mi>s</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>+</mml:mo><mml:mi>s</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mi mathvariant="normal">p</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> to the right-hand side of Eq. (8b). A GAM it is not an
emulator as defined by O'Hagan (2006) because the fitted values of the
GAM are not exactly equal to the outputs of the training data (Simon N. Wood,
personal communication, 23 May 2017).
It is still a meta-model and we could use it as a
surrogate of the computationally expensive simulator in order to perform variance-based
sensitivity analysis using, for example, the Sobol or extended FAST method.
However, we have found that the number of runs of the simulator to train it
in order for it to be an accurate surrogate for the simulator is too many (i.e.
too computationally burdensome). Instead, it is possible to obtain accurate
estimates of the first-order SIs by using a GAM to estimate the components
of Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>) directly (Stanfill et al., 2015; Strong et al., 2014, 2015b). To compute the <inline-formula><mml:math id="M234" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th first-order SI (<inline-formula><mml:math id="M235" display="inline"><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>≤</mml:mo><mml:mi>i</mml:mi><mml:mo>≤</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>,
we first recognise that taking the expectation of Eq. (8a) leads to
<inline-formula><mml:math id="M236" display="inline"><mml:mrow><mml:mi>E</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold">X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The
expression for <inline-formula><mml:math id="M237" display="inline"><mml:mrow><mml:mi>E</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi mathvariant="normal">|</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> is thus the marginal
distribution of <inline-formula><mml:math id="M238" display="inline"><mml:mrow><mml:mi>E</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>.
We could fit the full model and then compute this marginal distribution
following Stanfill et al. (2015). However, an easier and quicker way is to
fit a GAM to the (<inline-formula><mml:math id="M239" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M240" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> “data” where
<inline-formula><mml:math id="M241" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and
<inline-formula><mml:math id="M242" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are defined above. Then,
<inline-formula><mml:math id="M243" display="inline"><mml:mrow><mml:mi>E</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi mathvariant="normal">|</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> consists of the fitted
values of this reduced model  (Strong et al., 2015b). Thus, Var<inline-formula><mml:math id="M244" display="inline"><mml:mrow><mml:mfenced open="[" close="]"><mml:mrow><mml:mi>E</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi mathvariant="normal">|</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> (numerator of
equation 1) is determined by computing the variance of the <inline-formula><mml:math id="M245" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> points from this
fitted GAM model. In other words,
              <disp-formula id="Ch1.E9" content-type="numbered"><mml:math id="M246" display="block"><mml:mrow><mml:mover accent="true"><mml:mtext>Var</mml:mtext><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mfenced close="]" open="["><mml:mrow><mml:mover accent="true"><mml:mi>E</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi mathvariant="normal">|</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mtext>var</mml:mtext><mml:mfenced open="(" close=")"><mml:mrow><mml:mi>s</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
            where <inline-formula><mml:math id="M247" display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the element
from the <inline-formula><mml:math id="M248" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>th row and <inline-formula><mml:math id="M249" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th column of matrix <inline-formula><mml:math id="M250" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula>. Finally, the denominator term of
Eq. (1) is computed by taking the variance of the <inline-formula><mml:math id="M251" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> samples of the outputs
from the computationally expensive simulator that are stored in <inline-formula><mml:math id="M252" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
</sec>
<sec id="Ch1.S2.SS4.SSS2">
  <title>The partial least squares method</title>
      <?pagebreak page3137?><p id="d1e3934">The PLS method is the only one of the four GSA
methods considered here that is not variance-based  (Chang et al., 2015).
Multivariate linear regression (MLR) is a commonly used tool to represent a
set of outputs or response variables (<inline-formula><mml:math id="M253" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula>) based on a set of inputs or
predictor variables (<inline-formula><mml:math id="M254" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula>), where <inline-formula><mml:math id="M255" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M256" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula> are matrices (Table 1). MLR is only
appropriate to use when the different inputs (columns in <inline-formula><mml:math id="M257" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula>) are independent
and not excessive in number. In many situations, such as GSA studies, there
can be a large number of input variable and/or they could be highly
correlated with each other  (Sobie, 2009). PLS is an extension of MLR
which is able to deal with these more challenging multivariate modelling
problems  (Wold et al., 2001). The main reason for choosing PLS over
other applicable regression approaches is that it has been shown to give
similar estimates of the sensitivity indices to a variance-based GSA
approach  (Chang et al., 2015). Thus, for sensitivity analysis problems
when the inputs are correlated, this PLS method could be considered an
alternative to the variance-based GAM method which assumes that the inputs
are independent. Mathematically, PLS operates by projecting <inline-formula><mml:math id="M258" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M259" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula> into new
spaces, determined by maximising the covariance between the projections of
<inline-formula><mml:math id="M260" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M261" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula> (see Sect. S1 in the Supplement for details). PLS regression
is then performed where the regression coefficients represent the
sensitivity indices (given as a percentage). When <inline-formula><mml:math id="M262" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>&gt;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, it is
standard to estimate the PLS regression coefficients using the traditional
multivariate linear regression. Thus, the <inline-formula><mml:math id="M263" display="inline"><mml:mrow><mml:mi>p</mml:mi><mml:mo>×</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math></inline-formula> matrix of sensitivity indices
(<inline-formula><mml:math id="M264" display="inline"><mml:mrow><mml:mi>S</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> can be computed using the following formula:
              <disp-formula id="Ch1.E10" content-type="numbered"><mml:math id="M265" display="block"><mml:mrow><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:msup><mml:mi mathvariant="bold">X</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">X</mml:mi></mml:mrow></mml:mfenced><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi mathvariant="bold">X</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">Y</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="Ch1.S2.SS5">
  <title>Principal component analysis</title>
      <p id="d1e4077">As an alternative approach for speeding up the sensitivity analysis
calculations, we computed the SIs from the Sobol GSA method using a hybrid
approach involving PCA to reduce the
dimensionality of the output space, and then used separate Gaussian process
emulators for each of the transformed outputs  (Gómez-Dans et al.,
2016; Saltelli et al., 2012; Sexton et al., 2012). After performing the
emulator runs, we then reconstruct the emulator output on the original
output space, from which we compute the sensitivity indices.</p>
      <p id="d1e4080">PCA transforms the outputs onto a projected space with maximal variance.
Mathematically, we obtain the matrix of transformed outputs
<inline-formula><mml:math id="M266" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">Y</mml:mi><mml:mtext>(PC)</mml:mtext></mml:msup></mml:mrow></mml:math></inline-formula> by
            <disp-formula id="Ch1.E11" content-type="numbered"><mml:math id="M267" display="block"><mml:mrow><mml:msup><mml:mi mathvariant="bold">Y</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mi mathvariant="bold">YA</mml:mi><mml:mo>∗</mml:mo></mml:msup><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where <inline-formula><mml:math id="M268" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula> is the <inline-formula><mml:math id="M269" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>×</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math></inline-formula> matrix of training outputs from the simulator
(see Sect. 2.3), and <inline-formula><mml:math id="M270" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mo>∗</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is a matrix whose
columns are orthogonal to one another and whose <inline-formula><mml:math id="M271" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th column
(<inline-formula><mml:math id="M272" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi>i</mml:mi><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is chosen
such that
var<inline-formula><mml:math id="M273" display="inline"><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold">Y</mml:mi><mml:msubsup><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi>i</mml:mi><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is maximised subject to the constraint
<inline-formula><mml:math id="M274" display="inline"><mml:mrow><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi>i</mml:mi><mml:mo>∗</mml:mo></mml:msubsup></mml:mrow></mml:mfenced><mml:mi>T</mml:mi></mml:msup><mml:msubsup><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi>i</mml:mi><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>. The vector
<inline-formula><mml:math id="M275" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mo>∗</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> is called the
first principal component (PC1), and we define <inline-formula><mml:math id="M276" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> to be the
principle eigenvalue of <inline-formula><mml:math id="M277" display="inline"><mml:mrow><mml:mi>S</mml:mi><mml:mo>=</mml:mo></mml:mrow></mml:math></inline-formula> var (<inline-formula><mml:math id="M278" display="inline"><mml:mi>Y</mml:mi></mml:math></inline-formula>) which is the largest variance of the outputs
<inline-formula><mml:math id="M279" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula> with respect to PC1. The second, third, fourth columns, etc.
of <inline-formula><mml:math id="M280" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">A</mml:mi><mml:mo>*</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> are
referred to as PC2, PC3, PC4, etc. with <inline-formula><mml:math id="M281" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M282" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M283" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, etc. representing the second, third, fourth, etc. largest
variance of <inline-formula><mml:math id="M284" display="inline"><mml:mi mathvariant="bold">Y</mml:mi></mml:math></inline-formula>, respectively. PC1 contains the most information in the
output, followed by PC2, then PC3, etc. The number of principal components
required is commonly determined by plotting the following points: (1,
<inline-formula><mml:math id="M285" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, (2, <inline-formula><mml:math id="M286" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, (3, <inline-formula><mml:math id="M287" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, ..., and
identifying the point where the line begins to flatten out. This is
equivalent to choosing a cutoff when most of the variance is explained. In
this study, we included the first <inline-formula><mml:math id="M288" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> principal components such that
99 % of the variance is explained. The 99 % threshold was also necessary
for this study to ensure that the reconstructed emulator output accurately
approximated the simulator output for the validation runs (Fig. 2). While we
found the 99 % threshold was necessary, other studies may find that a
lower threshold (e.g. 95 %) is sufficient.</p>
      <p id="d1e4392">This technique of reducing the dimension of the output space from <inline-formula><mml:math id="M289" display="inline"><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mo>∼</mml:mo><mml:mn mathvariant="normal">2000</mml:mn></mml:mrow></mml:math></inline-formula>
spatially varying points to the first <inline-formula><mml:math id="M290" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> principal
components (e.g. <inline-formula><mml:math id="M291" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:math></inline-formula> for the FRSGC model; see Sect. 2.6)
means that the number of required emulator runs to compute the sensitivity
indices from the Sobol method is reduced by a factor of <inline-formula><mml:math id="M292" display="inline"><mml:mrow><mml:mi>m</mml:mi><mml:mo>/</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>
(<inline-formula><mml:math id="M293" display="inline"><mml:mo lspace="0mm">=</mml:mo></mml:math></inline-formula> <inline-formula><mml:math id="M294" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 400 using above <inline-formula><mml:math id="M295" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M296" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> values). However, after
having generated the <inline-formula><mml:math id="M297" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> sets of output vectors for the Sobol method
(<inline-formula><mml:math id="M298" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M299" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M300" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M301" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>; see
Sect. 2.2), we need to reconstruct the <inline-formula><mml:math id="M302" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula> sets of output vectors which
are required to compute the sensitivity indices for each of the <inline-formula><mml:math id="M303" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula> points in
the output space. To do this, we first set the elements of the <inline-formula><mml:math id="M304" display="inline"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>)th,
<inline-formula><mml:math id="M305" display="inline"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:math></inline-formula>)th, ..., <inline-formula><mml:math id="M306" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula> columns of the matrix <inline-formula><mml:math id="M307" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">A</mml:mi><mml:mo>∗</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> (Eq. 11) to
zero and call this new matrix
<inline-formula><mml:math id="M308" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold">A</mml:mi><mml:mi mathvariant="normal">sample</mml:mi><mml:mo>∗</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula>. We also
form a <inline-formula><mml:math id="M309" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math></inline-formula> matrix
<inline-formula><mml:math id="M310" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold">Y</mml:mi><mml:mi mathvariant="normal">sample</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>
whose first <inline-formula><mml:math id="M311" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> columns are vectors storing the emulator outputs
corresponding to the first <inline-formula><mml:math id="M312" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mtext>pc</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> principal components, while the elements
of the remaining columns are set to zero. Recall that
<inline-formula><mml:math id="M313" display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold">Y</mml:mi><mml:mi mathvariant="normal">sample</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is
different from <inline-formula><mml:math id="M314" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">Y</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> where the latter
has <inline-formula><mml:math id="M315" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> rows (80 for this study) which correspond to the number of simulator
runs required to train the emulators, whereas the number of samples <inline-formula><mml:math id="M316" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> (<inline-formula><mml:math id="M317" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> 000 for this study) refers to the number of emulator runs needed to
estimate the sensitivity indices. The <inline-formula><mml:math id="M318" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math></inline-formula> matrix
<inline-formula><mml:math id="M319" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">Y</mml:mi><mml:mi mathvariant="normal">sample</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> of the reconstructed
<inline-formula><mml:math id="M320" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula>-dimensional outputs is computed using
            <disp-formula id="Ch1.E12" content-type="numbered"><mml:math id="M321" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold">Y</mml:mi><mml:mi mathvariant="normal">sample</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mi mathvariant="bold">Y</mml:mi><mml:mi mathvariant="normal">sample</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">PC</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup><mml:msup><mml:mfenced open="(" close=")"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold">A</mml:mi><mml:mi mathvariant="normal">sample</mml:mi><mml:mo>∗</mml:mo></mml:msubsup></mml:mrow></mml:mfenced><mml:mi>T</mml:mi></mml:msup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e4829">We use this formula to compute the
<inline-formula><mml:math id="M322" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M323" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M324" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and
<inline-formula><mml:math id="M325" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> vectors from Sect. 2.2
and the resulting sensitivity indices using Eq. (2) from the Sobol method
(Sect. 2.2).</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F1"><caption><p id="d1e4879">Flowchart for order of tasks to complete in order to perform
GSA on a computationally expensive model. The
ranges on the inputs, on which its design is based, are determined by
expert elicitation. For approach 1, each dimension (dim.) of the output
consists of a different spatial or temporal point of the same variable
(<inline-formula><mml:math id="M326" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> lifetime for this study). For approach 2, a PC is a linear combination of the different dimensions of the output,
where <inline-formula><mml:math id="M327" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> is chosen such that the first <inline-formula><mml:math id="M328" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> PCs explain 99 % of the variance of
the output.</p></caption>
          <?xmltex \igopts{width=213.395669pt}?><graphic xlink:href="https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018-f01.pdf"/>

        </fig>

<?xmltex \hack{\newpage}?>
</sec>
<?pagebreak page3138?><sec id="Ch1.S2.SS6">
  <title>Experimental setup</title>
      <p id="d1e4921">The sequence of tasks to complete when performing global sensitivity
analysis is shown schematically in Fig. 1. The choice of inputs (e.g.
parameters) to include in the sensitivity analysis will depend upon which
have the greatest effects, based on expert knowledge of the model and field
of study. Expert judgement is also needed to define the ranges of these
inputs. A space-filling design such as maximin Latin hypercube sampling or sliced Latin
hypercube sampling  (Ba et al., 2015) is required in order to sample from
the input space with the minimum sufficient number of model runs. We used
<inline-formula><mml:math id="M329" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> 000 for the Sobol method and <inline-formula><mml:math id="M330" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula> for the eFAST method, but <inline-formula><mml:math id="M331" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">80</mml:mn></mml:mrow></mml:math></inline-formula>
for the GAM and PLS methods. The third stage is to run the model
at the set of input points specified by the space-filling sampling design.</p>
      <p id="d1e4964">If we are employing an emulator, the next stage is to build the emulator using
the training runs. The number of training runs (<inline-formula><mml:math id="M332" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is determined by <inline-formula><mml:math id="M333" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn><mml:mo>×</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M334" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula> is the number of input variables  (Loeppky et al.,
2009). We also need to perform runs of the computationally expensive
simulator to validate the emulators. For this study, we ran the simulators with an
additional set of inputs for validation. Comparing the emulator outputs with the simulator outputs using the validation inputs is
usually sufficient, but more sophisticated diagnostics can also be carried
out if needed  (Bastos and O'Hagan, 2009). If employing the emulator-free
approach, validation is also needed because we are using a statistical
model to infer the SIs. Such a validation is not a central part of our
results but is included in the Supplement (Fig. S2). For the
emulator–PCA hybrid approach (Fig. 1), we found that the first 5 (for
FRSGC) and 40 (for GISS) principal components were required to account for
99 % of the variance. This means that only 5–40 emulators are required to
generate a global map in place of <inline-formula><mml:math id="M335" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 2000 needed if each grid
point is emulated separately, thus providing large computational savings.</p>
      <p id="d1e5007">The final stage is to compute the first-order SIs for all the inputs; these
quantify the sensitivity of the output to changes in each input. The SIs are
also known as the main effects. The eFAST, Sobol and GAM approaches can also
be used to compute the total effects, defined as the sum of the
sensitivities of the output to changes in input <inline-formula><mml:math id="M336" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> on its own and interacting
with other inputs. For this study, we do not consider total effects as the
sum of the main effects was close to 100 % in each case.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F2"><caption><p id="d1e5019">Annual column mean <inline-formula><mml:math id="M337" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> lifetime calculated by the FRSGC and
GISS chemistry models from each of 24 validation runs (<inline-formula><mml:math id="M338" display="inline"><mml:mi>x</mml:mi></mml:math></inline-formula> axis) versus that
predicted by the emulator (<inline-formula><mml:math id="M339" display="inline"><mml:mi>y</mml:mi></mml:math></inline-formula> axis). In each plot, the <inline-formula><mml:math id="M340" display="inline"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> and median
absolute difference (MAD) are given as metrics for the accuracy of the
emulator predictions. Each validation run contains <inline-formula><mml:math id="M341" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 2000
different output values, corresponding to different latitude–longitude grid
squares.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018-f02.png"/>

        </fig>

</sec>
</sec>
<sec id="Ch1.S3">
  <title>Results</title>
<sec id="Ch1.S3.SS1">
  <title>Validation of the emulators</title>
      <p id="d1e5083">Since the emulators we employed are based on a scalar output, we built a
separate emulator for each of the <inline-formula><mml:math id="M342" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 2000 model grid points to
represent the spatial distribution of the <inline-formula><mml:math id="M343" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> lifetimes. At the 24 sets
of inputs set aside for emulator validation, the predicted outputs from the
emulators compared extremely well with the corresponding outputs from both
chemistry models (Fig. 2a, b, <inline-formula><mml:math id="M344" display="inline"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.9996</mml:mn></mml:mrow></mml:math></inline-formula>–0.9999, median absolute
difference of 0.1–0.18 years). When PCA is used to reduce the output
dimension from <inline-formula><mml:math id="M345" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 2000 to 5–40 (depending on the chemistry
model), the accuracy of the predicted outputs was not as good (Fig. 2c, d,
<inline-formula><mml:math id="M346" display="inline"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.9759</mml:mn></mml:mrow></mml:math></inline-formula>–0.9991, median absolute difference of 0.94–3.44 years) but was
still sufficient for this study.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F3" specific-use="star"><caption><p id="d1e5143">The sensitivity indices (percentage of the total variance in a
given output) for the four dominant inputs, with the output given as the annual column mean <inline-formula><mml:math id="M347" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>
lifetime from the FRSGC chemistry transport model. The rows show the results
from five different methods for performing sensitivity analysis (SA), whose
formulae for computing the SIs are given by Eqs. (1, 2) and Sect. 2.3
(Sobol method and emulator), Eqs. (1, 6a–b), Sect. 2.3 (eFAST method
and emulator), Eqs. (1, 9) (GAM method), Eq. (10) (PLS method),
Eqs. (1, 2), Sect. 2.3 and 2.5 (Sobol method, emulator and PCA).</p></caption>
          <?xmltex \igopts{width=369.885827pt}?><graphic xlink:href="https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018-f03.png"/>

        </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F4" specific-use="star"><caption><p id="d1e5165">The sensitivity indices (percentage of the total variance in a
given output) for the four dominant inputs, with the output given as the annual column mean <inline-formula><mml:math id="M348" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>
lifetime from the GISS chemistry model. See caption for Fig. 3 for
further details about the five methods used.</p></caption>
          <?xmltex \igopts{width=369.885827pt}?><graphic xlink:href="https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018-f04.png"/>

        </fig>

</sec>
<sec id="Ch1.S3.SS2">
  <title>Comparison of sensitivity indices</title>
      <p id="d1e5191">As expected, the two emulator-based global sensitivity analysis (GSA) approaches
(eFAST and Sobol) produced almost identical global maps of first-order
SIs (%) of <inline-formula><mml:math id="M349" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> lifetime; see Figs. 3 and 4.
The statistics (mean, 95th percentile and 99th percentile) of the
differences in SIs between the two GSA methods over all eight inputs at 2000
output points for the FRSGC and GISS models are shown in Fig. 5 (M1 versus M2).</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F5" specific-use="star"><caption><p id="d1e5207">Statistics (mean, 95th percentile and 99th percentile) of the
distribution of differences in sensitivity indices (SIs) between pairs of
methods. For each comparison, the <inline-formula><mml:math id="M350" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 16 000 pairs of SIs are made up of
<inline-formula><mml:math id="M351" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 2000 pairs of SIs for each of the eight inputs.</p></caption>
          <?xmltex \igopts{width=369.885827pt}?><graphic xlink:href="https://gmd.copernicus.org/articles/11/3131/2018/gmd-11-3131-2018-f05.png"/>

        </fig>

      <?pagebreak page3140?><p id="d1e5230">Our results show that the GAM emulator-free GSA method produces very similar
estimates of the SIs to the emulator-based methods
(Figs. 3, 4; row a vs. c for Sobol versus GAM).
The 95th and 99th percentiles of differences of the
emulator-based methods (e.g. Sobol) versus GAM are 5  and 9 % for
FRSGC, and 7 and 10 % for GISS (Fig. 5, M1 versus M3). For both models,
the PLS non-emulator-based method produced SIs that were significantly
different from those using the eFAST and Sobol methods (Figs. 3, 4; row a
vs. d for Sobol vs. PLS). For FRSGC, the mean and 95th percentile of the differences in SIs
for the Sobol versus PLS methods are around 21  and 31 %, while
for GISS the corresponding values are around 14  and 23 % (Fig. 5, M1 versus M4).
Thus, our results indicate that the PLS method is not suitable
for use as an emulator-free approach to estimating the SIs.</p>
      <p id="d1e5233">The global map of SIs using the emulator–PCA hybrid approach compared well
to those from the emulator-only approach (Figs. 3, 4; row a vs. e). The
95th and 99th percentiles of differences between the two
approaches were 6  and 10 %, respectively, for FRSGC (Fig. 5a, M1 versus M5)
and 3  and 5 %, respectively, for GISS (Fig. 5b, M1 versus M5). These
are both higher than the corresponding values for the emulator-only methods
(Fig. 5, M1 versus M2; <inline-formula><mml:math id="M352" display="inline"><mml:mo>&lt;</mml:mo></mml:math></inline-formula> 2 and <inline-formula><mml:math id="M353" display="inline"><mml:mo>&lt;</mml:mo></mml:math></inline-formula> 3 %, respectively).
These higher values for the emulator–PCA hybrid approach are also reflected
in the poorer estimates of the validation outputs using this approach versus
the emulator-only approach (Fig. 2). Such poorer estimates are expected
because the PCA-transformed outputs only explain 99 % of the variance of
the untransformed outputs used in the emulator-only approach.</p>
</sec>
</sec>
<sec id="Ch1.S4">
  <title>Discussion</title>
<sec id="Ch1.S4.SS1">
  <title>Comparison of sensitivity indices </title>
      <p id="d1e5262">Our results align with the consensus that the eFAST method or other modified
versions of the FAST method (e.g. RBD-FAST) produce very similar SIs to the
Sobol method. Mathematically, the two methods are equivalent (Saltelli
et al., 2012) and when the analytical (true) values of the SIs can be
computed, both methods are able to accurately estimate these values
(Iooss and Lemaître, 2015; Mara and Tarantola, 2008). However, many
studies have noted that the Sobol method requires more simulator (or emulator)
runs to compute the SIs. Saltelli et al. (2012) state that
<inline-formula><mml:math id="M354" display="inline"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">2</mml:mn><mml:mi>k</mml:mi></mml:mfrac></mml:mstyle><mml:mo>×</mml:mo><mml:mn mathvariant="normal">100</mml:mn></mml:mrow></mml:math></inline-formula> (%) more model runs are required for the Sobol
method compared to eFAST, where <inline-formula><mml:math id="M355" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula> is the number of input factors (e.g. if
<inline-formula><mml:math id="M356" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">8</mml:mn></mml:mrow></mml:math></inline-formula>, then 25 % more runs are needed for Sobol). Mara and Tarantola (2008)
found that the Sobol method required <inline-formula><mml:math id="M357" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 10 000 runs
of their model to achieve the same level of aggregated absolute error to
that of FAST, which only needed 1000 runs. This is comparable to our
analysis where the Sobol method required 18 000 runs of the emulator but
only 1000 runs were needed for the eFAST method.</p>
      <p id="d1e5307">Given recent interest in applying GAMs to
perform GSA  (Strong et al., 2015a, b, 2014), only
Stanfill et al. (2015) have compared how they perform against other
variance-based approaches. The authors found that first-order SIs estimated
from the original FAST method were very close to the true values using 600
executions of the model, whereas the GAM approach only required 90–150 model
runs. This is roughly consistent with our results, as we estimated the SIs
using 80 runs of the chemistry models for GAM and 1000 runs of the emulator
for the eFAST method.</p>
      <p id="d1e5310">There are a limited number of studies comparing the accuracy of the SIs of
the GAM method amongst different models, as in our study. Stanfill et
al. (2015) found that the GAM method was accurate at estimating SIs based on
a simple model (three to four parameters) as well as a more complex one (10
parameters). However, if more models of varying complexity and type (e.g.
process versus empirical) were to apply the GAM approach, we expect that
while GAM would work well for some models, for others the resulting SIs
may be substantially different from those produced using the more traditional
Sobol or eFAST methods. Saltelli et al. (1993) suggests that the
performance of a GSA method can be model dependent, especially when the
model is linear versus non-linear or monotonic versus non-monotonic, or if
transformations are applied on the output (e.g. logarithms) or not. This is
particularly true for GSA methods based on correlation or regression
coefficients  (Saltelli et al., 1999), which might explain why the SIs
calculated from the PLS method in our analysis also disagreed with those of
the eFAST/Sobol methods for the FRSGC versus GISS models. Not all GSA
methods are model dependent; for example, the eFAST method is not
(Saltelli et al., 1999).</p>
</sec>
<sec id="Ch1.S4.SS2">
  <title>Principal component analysis</title>
      <p id="d1e5319">For both chemistry models, using PCA to significantly
reduce the number of emulators needed resulted in SIs very<?pagebreak page3141?> similar to those
calculated using an emulator-only approach. For the GISS model, this was
encouraging given that the spread of points and their bias in the emulator
versus simulator scatter plot were noticeably larger than those of the FRSGC model
(Fig. 2c, d). If we had increased the number of principle components so
that 99.9 % of the variance in the output was captured rather than
99 %, following Verrelst et al. (2016), then we would expect less bias in the
validation plot for GISS. However, the poor validation plots did not
translate into poorly estimated SIs for the emulator–PCA approach. On the
contrary, the estimated SIs for GISS are consistent with the estimated SIs
using either emulator-only approach (Fig. 5).</p>
      <p id="d1e5322">The use of PCA in variance-based global sensitivity analysis studies is
relatively new but has great potential for application in other settings. De
Lozzo and Marrel (2017) used an atmospheric gas dispersion model to
simulate the evolution and spatial distribution of a radioactive gas into
the atmosphere following a chemical leak. The authors used principal
component analysis to reduce the dimension of the spatio-temporal output map
of gas concentrations to speed up the computation of the Sobol sensitivity
indices for each of the <inline-formula><mml:math id="M358" display="inline"><mml:mo>∼</mml:mo></mml:math></inline-formula> 19 000 points in the output space.
This emulator–PCA hybrid approach was also used to estimate the Sobol
sensitivity indices corresponding to a flood forecasting model that
simulates the water level of a river at 14 different points along its
length (Roy et al., 2017). Using a crop model to simulate a variable
related to nitrogen content of a crop over a growing season of 170 days,
Lamboni et al. (2011) using PCA to reduce the dimension of the output
space. However, unlike other comparable studies, the computed
sensitivity indices corresponded to the principal components, i.e. to a
linear combination of the 170 output values. This is permissible if
the principal components can be interpreted in some physical sense. For
Lamboni et al. (2011), the first PC approximately
corresponded to mean nitrogen content over the whole growing season, while
the second PC was the difference in nitrogen content between the first and
second halves of the growing season.</p>
</sec>
<sec id="Ch1.S4.SS3">
  <title>Scientific context of this study</title>
      <p id="d1e5338">Our work extends the work of Wild et al. (2018) who used the same
training inputs and the same atmospheric chemical transport models (FRSGC
and GISS) but different outputs. Instead of using highly multi-dimensional
output of tropospheric methane lifetime values at different spatial
locations, Wild et al. (2018) used a one-dimensional output of
global tropospheric methane lifetime. Using the eFAST method, the authors
found that global methane lifetime was most sensitive to change in the
humidity input for the FRSGC model, while for the GISS model the surface <inline-formula><mml:math id="M359" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">NO</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>
and the lightning <inline-formula><mml:math id="M360" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">NO</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> inputs were most important for predicting methane
lifetime at the global scale, followed by the isoprene, the boundary
layer mixing and the humidity inputs (Wild et al., 2018). As expected, our results
indicated that these same inputs explained most of the variance in the
outputs for the different spatial locations. However, while the humidity
SI for GISS was very low at the global scale (SI of 5 %),
out study found that the SIs for humidity were very high (50–60 %)
for the higher-latitude regions (Fig. 4).</p>
</sec>
<sec id="Ch1.S4.SS4">
  <title>Implications for large-scale sensitivity analysis studies</title>
      <p id="d1e5369">GSA studies for computationally expensive models involving a small number of inputs (e.g.
<inline-formula><mml:math id="M361" display="inline"><mml:mo>&lt;</mml:mo></mml:math></inline-formula> 10) are useful and straightforward to implement  (Lee et al.,
2012). However, the inferences made are limited due to the large number of
parameters on which these models depend and the number of processes that
they simulate. Hence, interest is growing in carrying out large-scale GSA
studies involving a high number of inputs to improve understanding of an
individual model  (e.g. Lee et al., 2013) or to diagnose
differences between models  (Wild et al., 2018). For GSA studies
when the number of inputs is small, our study has demonstrated that the GAM
approach is a good candidate for carrying out emulator-free GSA since it
calculates very similar SIs without the computational demands of emulation.
A caveat is that the performance of GAM may depend on the behaviour of the
model; although we have found it is a good GSA method for our models (FRSGC
and GISS) and output (<inline-formula><mml:math id="M362" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CH</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> lifetimes), its suitability may not be as good
in all situations.</p>
</sec>
</sec>
<sec id="Ch1.S5" sec-type="conclusions">
  <title>Conclusions</title>
      <p id="d1e5398">GSA is a powerful tool for understanding model
behaviour, for diagnosing differences between models and for determining
which parameters to choose for model calibration. In this study, we compared
different methods for computing first-order sensitivity indices for
computationally expensive models based on modelled spatial distributions of
CH<inline-formula><mml:math id="M363" display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:math></inline-formula> lifetimes. We have demonstrated that the more established
emulator-based methods (eFAST and Sobol) can be used to efficiently derive
meaningful sensitivity indices for multi-dimensional output from atmospheric
chemistry transport models. We have shown that an emulator-free method based
on a GAM and an emulator–PCA hybrid method
produce first-order sensitivity indices that are consistent with the
emulator-only methods. For a reasonably smooth system with few parameters,
as investigated here, the GAM and PCA methods are viable and effective
options for GSA, and are robust over models that exhibit distinctly
different responses. Moreover, the computational benefit of these
alternative methods is apparent, with the GAM approach allowing calculation
of variance-based sensitivity indices 22–56 times faster (or 37 times faster
on average) compared to the eFAST or Sobol methods. Using the Sobol method,
the emulator–PCA hybrid approach is 19–28 times faster (or 24 times faster
on<?pagebreak page3142?> average) at computing the sensitivity indices compared to using an emulator-only
approach depending on which chemistry model is used. Finally, we have
provided guidance on how to implement these methods in a reproducible way.</p>
</sec>

      
      </body>
    <back><notes notes-type="codedataavailability">

      <p id="d1e5414">The R code to carry out global sensitivity analysis using the methods
described in this paper is available in Sects. S2–S7 of the
Supplement. This R code as well as the R code used to validate
the emulators can also be found via <ext-link xlink:href="https://doi.org/10.5281/zenodo.1038667" ext-link-type="DOI">10.5281/zenodo.1038667</ext-link> (Ryan, 2017).</p>

      <p id="d1e5420">The inputs and outputs of the FRSGC chemistry model that were used to train
the emulators in this paper can be found via <ext-link xlink:href="https://doi.org/10.5281/zenodo.1038670" ext-link-type="DOI">10.5281/zenodo.1038670</ext-link> (Ryan and Wild, 2017).</p>
  </notes><?xmltex \hack{\clearpage}?><app-group>

<?pagebreak page3143?><app id="App1.Ch1.S1">
  <title>Further details of the Sobol and eFAST global sensitivity
analysis methods</title>
      <p id="d1e5435">For the Sobol method, Saltelli (2002) and Tarantola et al. (2006) suggest using eight
variants of Eq. (<xref ref-type="disp-formula" rid="Ch1.E2"/>), using different combinations of <inline-formula><mml:math id="M364" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M365" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>,
<inline-formula><mml:math id="M366" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M367" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> :

              <disp-formula specific-use="align"><mml:math id="M368" display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mtext>I</mml:mtext></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mrow><mml:mi>I</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mtext>III</mml:mtext></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mtext>IV</mml:mtext></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mtext>V</mml:mtext></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi>Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mtext>VI</mml:mtext></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mtext>VII</mml:mtext></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mtext>VIII</mml:mtext></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">B</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi>Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mfenced close=")" open="("><mml:mi>j</mml:mi></mml:mfenced></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mfenced close=")" open="("><mml:mi>j</mml:mi></mml:mfenced></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Ci</mml:mi><mml:mrow><mml:mfenced close=")" open="("><mml:mi>j</mml:mi></mml:mfenced></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msubsup><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mi mathvariant="normal">Di</mml:mi><mml:mrow><mml:mfenced close=")" open="("><mml:mi>j</mml:mi></mml:mfenced></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
      <p id="d1e6923"><?xmltex \hack{\newpage}?>Thus, the <inline-formula><mml:math id="M369" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th first-order Sobol SI estimate is
          <disp-formula id="App1.Ch1.Ex9"><mml:math id="M370" display="block"><mml:mrow><?xmltex \hack{\hbox\bgroup\fontsize{9}{9}\selectfont$\displaystyle}?><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mn mathvariant="normal">8</mml:mn></mml:mfrac></mml:mstyle><mml:mfenced open="(" close=")"><mml:mrow><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi mathvariant="normal">I</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mi mathvariant="normal">II</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi mathvariant="normal">III</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi mathvariant="normal">IV</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi mathvariant="normal">V</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi mathvariant="normal">VI</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mi mathvariant="normal">VII</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mi mathvariant="normal">VIII</mml:mi></mml:msup></mml:mrow></mml:mfenced><mml:mo>.</mml:mo><?xmltex \hack{$\egroup}?></mml:mrow></mml:math></disp-formula>
        The main difference between classical FAST  (Cukier et al., 1973) and
extended FAST  (Saltelli et al., 1999) when computing first-order SIs is
the choice of transformation function <inline-formula><mml:math id="M371" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>:

              <disp-formula id="App1.Ch1.E1" specific-use="align" content-type="subnumberedon"><mml:math id="M372" display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mtext>classical FAST</mml:mtext><mml:mo>:</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>v</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mi>s</mml:mi></mml:msub><mml:mi>z</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mlabeledtr id="App1.Ch1.E1.1"><mml:mtd/><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mo>(</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>v</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mi>s</mml:mi></mml:msub><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mtext>are user-specified</mml:mtext><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr></mml:mtable></mml:math></disp-formula>

          <disp-formula id="App1.Ch1.E1.2" content-type="subnumberedoff"><mml:math id="M373" display="block"><mml:mrow><mml:mtext>extended FAST</mml:mtext><mml:mo>:</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfenced open="(" close=")"><mml:mi>z</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mi mathvariant="italic">π</mml:mi></mml:mfrac></mml:mstyle><mml:mi mathvariant="normal">arcsin</mml:mi><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e7211">Using Eq. (A1b), Eq. (<xref ref-type="disp-formula" rid="Ch1.E3"/>) now becomes a straight-line equation:

              <disp-formula id="App1.Ch1.E2" content-type="numbered"><mml:math id="M374" display="block"><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mi mathvariant="italic">π</mml:mi></mml:mfrac></mml:mstyle><mml:msub><mml:mi mathvariant="italic">ω</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi>s</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p><?xmltex \hack{\clearpage}?><supplementary-material position="anchor"><p id="d1e7259">The supplement related to this article is available online at: <inline-supplementary-material xlink:href="https://doi.org/10.5194/gmd-11-3131-2018-supplement" xlink:title="pdf">https://doi.org/10.5194/gmd-11-3131-2018-supplement</inline-supplementary-material>.</p></supplementary-material>
</app>
  </app-group><notes notes-type="authorcontribution">

      <p id="d1e7270">ER and OW designed the study. ER conducted the analysis and wrote the
manuscript, and OW gave feedback during the analysis and writing phases.
OW, FO and AW provided output from the global atmospheric model runs needed
to carry out the analysis. LL advised on statistical aspects of the
analysis. All coauthors gave feedback on drafts of the manuscript.</p>
  </notes><notes notes-type="competinginterests">

      <p id="d1e7276">The authors declare that they have no conflict of
interest.</p>
  </notes><ack><title>Acknowledgements</title><p id="d1e7282">This work was supported by the Natural Environment Research Council (grant
number NE/N003411/1).<?xmltex \hack{\newline}?><?xmltex \hack{\newline}?>
Edited by: Andrea Stenke<?xmltex \hack{\newline}?>
Reviewed by: three anonymous referees</p></ack><ref-list>
    <title>References</title>

      <ref id="bib1.bib1"><label>1</label><mixed-citation>
Ahtikoski, A., Heikkilä, J., Alenius, V., and Siren, M.: Economic
viability of utilizing biomass energy from young stands – the case of
Finland, Biomass Bioenerg., 32, 988–996, 2008.</mixed-citation></ref>
      <ref id="bib1.bib2"><label>2</label><mixed-citation>
Ba, S., Myers, W. R., and Brenneman, W. A.: Optimal sliced Latin hypercube
designs, Technometrics, 57, 479–487, 2015.</mixed-citation></ref>
      <ref id="bib1.bib3"><label>3</label><mixed-citation>
Bailis, R., Ezzati, M., and Kammen, D. M.: Mortality and greenhouse gas
impacts of biomass and petroleum energy futures in Africa, Science, 308,
98–103, 2005.</mixed-citation></ref>
      <ref id="bib1.bib4"><label>4</label><mixed-citation>
Bastos, L. S. and O'Hagan, A.: Diagnostics for Gaussian process emulators,
Technometrics, 51, 425–438, 2009.</mixed-citation></ref>
      <ref id="bib1.bib5"><label>5</label><mixed-citation>
Campbell, J. E., Carmichael, G. R., Chai, T., Mena-Carrasco, M., Tang, Y.,
Blake, D., Blake, N., Vay, S. A., Collatz, G. J., and Baker, I.:
Photosynthetic control of atmospheric carbonyl sulfide during the growing
season, Science, 322, 1085–1088, 2008.</mixed-citation></ref>
      <ref id="bib1.bib6"><label>6</label><mixed-citation>
Carslaw, K., Lee, L., Reddington, C., Pringle, K., Rap, A., Forster, P.,
Mann, G., Spracklen, D., Woodhouse, M., and Regayre, L.: Large contribution
of natural aerosols to uncertainty in indirect forcing, Nature, 503, 67–71,
2013.</mixed-citation></ref>
      <ref id="bib1.bib7"><label>7</label><mixed-citation>Chang, E. T., Strong, M., and Clayton, R. H.: Bayesian sensitivity analysis
of a cardiac cell model using a Gaussian process emulator, PloS one, 10,
e0130252, <ext-link xlink:href="https://doi.org/10.1371/journal.pone.0137004" ext-link-type="DOI">10.1371/journal.pone.0137004</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bib8"><label>8</label><mixed-citation>
Coggan, J. S., Bartol, T. M., Esquenazi, E., Stiles, J. R., Lamont, S.,
Martone, M. E., Berg, D. K., Ellisman, M. H., and Sejnowski, T. J.: Evidence
for ectopic neurotransmission at a neuronal synapse, Science, 309, 446–451,
2005.</mixed-citation></ref>
      <ref id="bib1.bib9"><label>9</label><mixed-citation>
Cressie, N.: The origins of kriging, Math. Geol., 22, 239–252,
1990.</mixed-citation></ref>
      <ref id="bib1.bib10"><label>10</label><mixed-citation>
Cukier, R., Fortuin, C., Shuler, K. E., Petschek, A., and Schaibly, J.:
Study of the sensitivity of coupled reaction systems to uncertainties in
rate coefficients. I Theory, The J. Chem. Phys., 59, 3873–3878,
1973.</mixed-citation></ref>
      <ref id="bib1.bib11"><label>11</label><mixed-citation>
Currin, C., Mitchell, T., Morris, M., and Ylvisaker, D.: Bayesian prediction
of deterministic functions, with applications to the design and analysis of
computer experiments, J. Am. Stat. Assoc., 86,
953–963, 1991.</mixed-citation></ref>
      <ref id="bib1.bib12"><label>12</label><mixed-citation>
de Gee, M., Lof, M. E., and Hemerik, L.: The effect of chemical information
on the spatial distribution of fruit flies: II parameterization,
calibration, and sensitivity, B. Math. Biol., 70, 1850–1868,
2008.</mixed-citation></ref>
      <ref id="bib1.bib13"><label>13</label><mixed-citation>
Degroote, J., Couckuyt, I., Vierendeels, J., Segers, P., and Dhaene, T.:
Inverse modelling of an aneurysm's stiffness using surrogate-based
optimization and fluid-structure interaction simulations, Struct.
Multidis. Optim., 46, 457–469, 2012.</mixed-citation></ref>
      <ref id="bib1.bib14"><label>14</label><mixed-citation>
De Lozzo, M. and Marrel, A.: Sensitivity analysis with dependence and
variance-based measures for spatio-temporal numerical simulators, Stoch.
Environ. Res. Risk Assess., 31, 1437–1453, 2017.</mixed-citation></ref>
      <ref id="bib1.bib15"><label>15</label><mixed-citation>Ferretti, F., Saltelli, A., and Tarantola, S.: Trends in sensitivity
analysis practice in the last decade, Sci. Total Environ.,
568, 666–670, <ext-link xlink:href="https://doi.org/10.1016/j.scitotenv.2016.02.133" ext-link-type="DOI">10.1016/j.scitotenv.2016.02.133</ext-link>, 2016.</mixed-citation></ref>
      <ref id="bib1.bib16"><label>16</label><mixed-citation>
Goldstein, M. and Rougier, J.: Bayes linear calibrated prediction for
complex systems, J. Am. Stat. Assoc., 101,
1132–1143, 2006.</mixed-citation></ref>
      <ref id="bib1.bib17"><label>17</label><mixed-citation>
Gómez-Dans, J. L., Lewis, P. E., and Disney, M.: Efficient Emulation of
Radiative Transfer Codes Using Gaussian Processes and Application to Land
Surface Parameter Inferences, Remote Sens., 8, 1–32, 2016.</mixed-citation></ref>
      <ref id="bib1.bib18"><label>18</label><mixed-citation>
Hankin, R. K.: Introducing BACCO, an R package for Bayesian analysis of
computer code output, J. Stat. Softw., 14, 1–21, 2005.</mixed-citation></ref>
      <ref id="bib1.bib19"><label>19</label><mixed-citation>Hill, T. C., Ryan, E., and Williams, M.: The use of <inline-formula><mml:math id="M375" display="inline"><mml:mrow class="chem"><mml:msub><mml:mi mathvariant="normal">CO</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> flux time series for
parameter and carbon stock estimation in carbon cycle research, Global
Change Biol., 18, 179–193, 2012.</mixed-citation></ref>
      <ref id="bib1.bib20"><label>20</label><mixed-citation>
Homma, T. and Saltelli, A.: Importance measures in global sensitivity
analysis of nonlinear models, Reliab. Eng. Syst. Safe.,
52, 1–17, 1996.</mixed-citation></ref>
      <ref id="bib1.bib21"><label>21</label><mixed-citation>
Iooss, B. and Lemaître, P.: A review on global sensitivity analysis
methods, in: Uncertainty Management in Simulation-Optimization of Complex
Systems, Operations Research/Computer Science Interfaces Series, Vol 59.
Springer, Boston, MA, 2015.</mixed-citation></ref>
      <ref id="bib1.bib22"><label>22</label><mixed-citation>
Kennedy, M., Anderson, C., O'Hagan, A., Lomas, M., Woodward, I., Gosling, J.
P., and Heinemeyer, A.: Quantifying uncertainty in the biospheric carbon
flux for England and Wales, J. Royal Stat. Soc.
A , 171, 109–135, 2008.</mixed-citation></ref>
      <ref id="bib1.bib23"><label>23</label><mixed-citation>
Kennedy, M. C. and O'Hagan, A.: Predicting the output from a complex
computer code when fast approximations are available, Biometrika, 87, 1–13,
2000.</mixed-citation></ref>
      <ref id="bib1.bib24"><label>24</label><mixed-citation>
Koehler, J. and Owen, A.: 9 Computer experiments, Handbook of Statistics,
13, 261–308, 1996.</mixed-citation></ref>
      <ref id="bib1.bib25"><label>25</label><mixed-citation>
Lamboni, M., Monod, H., and Makowski, D.: Multivariate sensitivity analysis
to measure global contribution of input factors in dynamic models,
Reliab. Eng. Syst. Safe., 96, 450–459, 2011.</mixed-citation></ref>
      <ref id="bib1.bib26"><label>26</label><mixed-citation>Lee, L. A., Carslaw, K. S., Pringle, K. J., and Mann, G. W.: Mapping the
uncertainty in global CCN using emulation, Atmos. Chem. Phys., 12, 9739–9751,
<ext-link xlink:href="https://doi.org/10.5194/acp-12-9739-2012" ext-link-type="DOI">10.5194/acp-12-9739-2012</ext-link>, 2012.</mixed-citation></ref>
      <ref id="bib1.bib27"><label>27</label><mixed-citation>Lee, L. A., Pringle, K. J., Reddington, C. L., Mann, G. W., Stier, P.,
Spracklen, D. V., Pierce, J. R., and Carslaw, K. S.: The magnitude and causes
of uncertainty in global model simulations of cloud condensation nuclei,
Atmos. Chem. Phys., 13, 8879–8914, <ext-link xlink:href="https://doi.org/10.5194/acp-13-8879-2013" ext-link-type="DOI">10.5194/acp-13-8879-2013</ext-link>,
2013.</mixed-citation></ref>
      <ref id="bib1.bib28"><label>28</label><mixed-citation>
Lilburne, L. and Tarantola, S.: Sensitivity analysis of spatial models,
Int. J. Geogr. Inform. Sci., 23, 151–168,
2009.</mixed-citation></ref>
      <?pagebreak page3145?><ref id="bib1.bib29"><label>29</label><mixed-citation>
Loeppky, J. L., Sacks, J., and Welch, W. J.: Choosing the sample size of a
computer experiment: A practical guide, Technometrics, 51, 366–376, 2009.</mixed-citation></ref>
      <ref id="bib1.bib30"><label>30</label><mixed-citation>
Mara, T. A. and Tarantola, S.: Application of global sensitivity analysis of
model output to building thermal simulations,
Building Simulation, 1, 290–302, 2008.</mixed-citation></ref>
      <ref id="bib1.bib31"><label>31</label><mixed-citation>
Marrel, A., Iooss, B., Laurent, B., and Roustant, O.: Calculations of sobol
indices for the gaussian process metamodel, Reliab. Eng.
Syst. Safe., 94, 742–751, 2009.</mixed-citation></ref>
      <ref id="bib1.bib32"><label>32</label><mixed-citation>
Oakley, J. E. and O'Hagan, A.: Probabilistic sensitivity analysis of complex
models: a Bayesian approach, J. Royal Stat. Soc.
B, 66, 751–769, 2004.</mixed-citation></ref>
      <ref id="bib1.bib33"><label>33</label><mixed-citation>
O'Hagan, A.: Bayesian analysis of computer code outputs: a tutorial,
Reliab. Eng. Syst. Safe., 91, 1290–1300, 2006.</mixed-citation></ref>
      <ref id="bib1.bib34"><label>34</label><mixed-citation>
Pistone, G. and Vicario, G.: Kriging prediction from a circular grid:
application to wafer diffusion, Appl. Stoch. Models Business
Industry, 29, 350–361, 2013.</mixed-citation></ref>
      <ref id="bib1.bib35"><label>35</label><mixed-citation>
Queipo, N. V., Haftka, R. T., Shyy, W., Goel, T., Vaidyanathan, R., and
Tucker, P. K.: Surrogate-based analysis and optimization, Prog.
Aerosp. Sci., 41, 1–28, 2005.</mixed-citation></ref>
      <ref id="bib1.bib36"><label>36</label><mixed-citation>
Rasmussen, C.  E.  and Williams, C. K. I.: Gaussian Processes for Machine
Learning, 2006, the MIT Press, ISBN 026218253X, 2006.</mixed-citation></ref>
      <ref id="bib1.bib37"><label>37</label><mixed-citation>
Ripley, B. D.: Spatial statistics, John Wiley &amp; Sons,
Hoboken, New Jersey, 2005.</mixed-citation></ref>
      <ref id="bib1.bib38"><label>38</label><mixed-citation>Roustant, O., Ginsbourger, D., and Deville, Y.: DiceKriging, DiceOptim: Two
R packages for the analysis of computer experiments by kriging-based
metamodeling and optimization, available at: <uri>https://hal.archives-ouvertes.fr/hal-00495766/document</uri> (last access:  15 June 2016),
2012.</mixed-citation></ref>
      <ref id="bib1.bib39"><label>39</label><mixed-citation>
Roy, P. T., El Moçayd, N., Ricci, S., Jouhaud, J.-C., Goutal, N., De
Lozzo, M., and Rochoux, M. C.: Comparison of Polynomial Chaos and Gaussian
Process surrogates for uncertainty quantification and correlation estimation
of spatially distributed open-channel steady flows, Stoch. Environ.
Res. Risk Assess., 2017, 1–19, 2017.</mixed-citation></ref>
      <ref id="bib1.bib40"><label>40</label><mixed-citation>Ryan, E.: Fast sensitivity analysis methods for computationally expensive models with multi-dimensional
output, <ext-link xlink:href="https://doi.org/10.5281/zenodo.1038667" ext-link-type="DOI">10.5281/zenodo.1038667</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bib41"><label>41</label><mixed-citation>Ryan, E. and Wild, O.: Data for the GSA methods paper by Ryan et al.,
<ext-link xlink:href="https://doi.org/10.5281/zenodo.1038670" ext-link-type="DOI">10.5281/zenodo.1038670</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bib42"><label>42</label><mixed-citation>
Saltelli, A.: Making best use of model evaluations to compute sensitivity
indices, Comput. Phys. Commun., 145, 280–297, 2002.</mixed-citation></ref>
      <ref id="bib1.bib43"><label>43</label><mixed-citation>
Saltelli, A., Andres, T., and Homma, T.: Sensitivity analysis of model
output: an investigation of new techniques, Comput. Stat.
Data Anal., 15, 211–238, 1993.</mixed-citation></ref>
      <ref id="bib1.bib44"><label>44</label><mixed-citation>
Saltelli, A. and Annoni, P.: How to avoid a perfunctory sensitivity
analysis, Environ. Modell. Softw., 25, 1508–1517, 2010.</mixed-citation></ref>
      <ref id="bib1.bib45"><label>45</label><mixed-citation>
Saltelli, A., Ratto, M., Andres, T., Campolongo, F., Cariboni, J., Gatelli,
D., Saisana, M., and Tarantola, S.: Global sensitivity analysis: the primer,
John Wiley &amp; Sons, 2008.</mixed-citation></ref>
      <ref id="bib1.bib46"><label>46</label><mixed-citation>
Saltelli, A., Ratto, M., Tarantola, S., and Campolongo, F.: Update 1 of:
Sensitivity analysis for chemical models, Chem. Rev., 112, PR1–PR21,
2012.</mixed-citation></ref>
      <ref id="bib1.bib47"><label>47</label><mixed-citation>
Saltelli, A., Tarantola, S., and Chan, K.-S.: A quantitative
model-independent method for global sensitivity analysis of model output,
Technometrics, 41, 39–56, 1999.</mixed-citation></ref>
      <ref id="bib1.bib48"><label>48</label><mixed-citation>
Schmidt, G. A., Kelley, M., Nazarenko, L., Ruedy, R., Russell, G. L.,
Aleinov, I., Bauer, M., Bauer, S. E., Bhat, M. K., and Bleck, R.:
Configuration and assessment of the GISS ModelE2 contributions to the CMIP5
archive, J. Adv. Model. Earth Syst., 6, 141–184, 2014.</mixed-citation></ref>
      <ref id="bib1.bib49"><label>49</label><mixed-citation>
Sexton, D. M., Murphy, J. M., Collins, M., and Webb, M. J.: Multivariate
probabilistic projections using imperfect climate models part I: outline of
methodology, Clim. Dynam., 38, 2513–2542, 2012.</mixed-citation></ref>
      <ref id="bib1.bib50"><label>50</label><mixed-citation>Shindell, D. T., Faluvegi, G., Unger, N., Aguilar, E., Schmidt,
G. A., Koch, D. M., Bauer, S. E., and Miller, R. L.: Simulations
of preindustrial, present-day, and 2100 conditions in the NASA
GISS composition and climate model G-PUCCINI, Atmos. Chem. Phys.,
6, 4427–4459, <ext-link xlink:href="https://doi.org/10.5194/acp-6-4427-2006" ext-link-type="DOI">10.5194/acp-6-4427-2006</ext-link>, 2006.</mixed-citation></ref>
      <ref id="bib1.bib51"><label>51</label><mixed-citation>
Sobie, E. A.: Parameter sensitivity analysis in electrophysiological models
using multivariable regression, Biophys. J., 96, 1264–1274, 2009.</mixed-citation></ref>
      <ref id="bib1.bib52"><label>52</label><mixed-citation>
Sobol, I. Y. M.: On sensitivity estimation for nonlinear mathematical
models, Matemat. Modeliro., 2, 112–118, 1990.</mixed-citation></ref>
      <ref id="bib1.bib53"><label>53</label><mixed-citation>
Stanfill, B., Mielenz, H., Clifford, D., and Thorburn, P.: Simple approach
to emulating complex computer models for global sensitivity analysis,
Environ. Modell. Softw., 74, 140–155, 2015.</mixed-citation></ref>
      <ref id="bib1.bib54"><label>54</label><mixed-citation>
Stites, E. C., Trampont, P. C., Ma, Z., and Ravichandran, K. S.: Network
analysis of oncogenic Ras activation in cancer, Science, 318, 463–467, 2007.</mixed-citation></ref>
      <ref id="bib1.bib55"><label>55</label><mixed-citation>
Strong, M., Oakley, J. E., and Brennan, A.: An efficient method for
computing the Expected Value of Sample Information, A non-parametric
regression approach, ScHARR working paper, 2015a.</mixed-citation></ref>
      <ref id="bib1.bib56"><label>56</label><mixed-citation>
Strong, M., Oakley, J. E., and Brennan, A.: Estimating multiparameter
partial expected value of perfect information from a probabilistic
sensitivity analysis sample a nonparametric regression approach, Med.
Decis. Mak., 34, 311–326, 2014.</mixed-citation></ref>
      <ref id="bib1.bib57"><label>57</label><mixed-citation>
Strong, M., Oakley, J. E., Brennan, A., and Breeze, P.: Estimating the
expected value of sample information using the probabilistic sensitivity
analysis sample a fast nonparametric regression-based method, Med.
Decis. Mak., 35, 570–583, 2015b.</mixed-citation></ref>
      <ref id="bib1.bib58"><label>58</label><mixed-citation>
Tarantola, S., Gatelli, D., and Mara, T. A.: Random balance designs for the
estimation of first order global sensitivity indices, Reliab.
Eng. Syst. Safe., 91, 717–727, 2006.</mixed-citation></ref>
      <ref id="bib1.bib59"><label>59</label><mixed-citation>
Vanuytrecht, E., Raes, D., and Willems, P.: Global sensitivity analysis of
yield output from the water productivity model, Environ. Modell.
Softw., 51, 323–332, 2014.</mixed-citation></ref>
      <ref id="bib1.bib60"><label>60</label><mixed-citation>
Verrelst, J., Sabater, N., Rivera, J. P., Muñoz-Marí, J., Vicent,
J., Camps-Valls, G., and Moreno, J.: Emulation of Leaf, Canopy and
Atmosphere Radiative Transfer Models for Fast Global Sensitivity Analysis,
Remote Sens., 8, 673–699, 2016.</mixed-citation></ref>
      <ref id="bib1.bib61"><label>61</label><mixed-citation>Voulgarakis, A., Naik, V., Lamarque, J.-F., Shindell, D. T., Young, P. J.,
Prather, M. J., Wild, O., Field, R. D., Bergmann, D., Cameron-Smith, P.,
Cionni, I., Collins, W. J., Dalsøren, S. B., Doherty, R. M., Eyring, V.,
Faluvegi, G., Folberth, G. A., Horowitz, L. W., Josse, B., MacKenzie, I. A.,
Nagashima, T., Plummer, D. A., Righi, M., Rumbold, S. T., Stevenson, D. S.,
Strode, S. A., Sudo, K., Szopa, S., and Zeng, G.: Analysis of present day and
future OH and methane lifetime in the ACCMIP simulations, Atmos. Chem. Phys.,
13, 2563–2587, <ext-link xlink:href="https://doi.org/10.5194/acp-13-2563-2013" ext-link-type="DOI">10.5194/acp-13-2563-2013</ext-link>, 2013.</mixed-citation></ref>
      <ref id="bib1.bib62"><label>62</label><mixed-citation>
Vu-Bac, N., Rafiee, R., Zhuang, X., Lahmer, T., and Rabczuk, T.: Uncertainty
quantification for multiscale modeling of polymer nanocomposites with
correlated parameters, Composites  B, 68, 446–464, 2015.</mixed-citation></ref>
      <?pagebreak page3146?><ref id="bib1.bib63"><label>63</label><mixed-citation>
Welch, W. J., Buck, R. J., Sacks, J., Wynn, H. P., Mitchell, T. J., and
Morris, M. D.: Screening, predicting, and computer experiments,
Technometrics, 34, 15–25, 1992.</mixed-citation></ref>
      <ref id="bib1.bib64"><label>64</label><mixed-citation>Wild, O.: Modelling the global tropospheric ozone budget: exploring the
variability in current models, Atmos. Chem. Phys., 7, 2643–2660,
<ext-link xlink:href="https://doi.org/10.5194/acp-7-2643-2007" ext-link-type="DOI">10.5194/acp-7-2643-2007</ext-link>, 2007.</mixed-citation></ref>
      <ref id="bib1.bib65"><label>65</label><mixed-citation>Wild, O., Pochanart, P., and Akimoto, H.: Trans-Eurasian transport of ozone
and its precursors, J. Geophys. Res.-Atmos., 109, D11302, <ext-link xlink:href="https://doi.org/10.1029/2003JD004501" ext-link-type="DOI">10.1029/2003JD004501</ext-link>, 2004.</mixed-citation></ref>
      <ref id="bib1.bib66"><label>66</label><mixed-citation>Wild, O. and Prather, M. J.: Excitation of the primary tropospheric chemical
mode in a global three-dimensional model, J. Geophys. Res.,
105, 24647–24660, 2000.
 </mixed-citation></ref><?xmltex \hack{\newpage}?>
      <ref id="bib1.bib67"><label>67</label><mixed-citation>
Wild, O., Ryan, E., O'Connor, F., Vougarakis, A., and Lee, L.: Reducing
Uncertainty in Model Budgets of Tropospheric Ozone and OH,
Atmos.Chem. Phys., in preparation, 2018.</mixed-citation></ref>
      <ref id="bib1.bib68"><label>68</label><mixed-citation>
Wold, S., Sjöström, M., and Eriksson, L.: PLS-regression: a basic
tool of chemometrics, Chemom. Intell. Labor. Syst., 58,
109–130, 2001.</mixed-citation></ref>
      <ref id="bib1.bib69"><label>69</label><mixed-citation>
Wood, S. N.: Generalized additive models: an introduction with R, CRC press,
New York, 2017.</mixed-citation></ref>
      <ref id="bib1.bib70"><label>70</label><mixed-citation>Wu, J., Dhingra, R., Gambhir, M., and Remais, J. V.: Sensitivity analysis of
infectious disease models: methods, advances and their application, J.
Roy. Soc. Interf., 10, <ext-link xlink:href="https://doi.org/10.1098/rsif.2012.1018" ext-link-type="DOI">10.1098/rsif.2012.1018</ext-link>, 2013.</mixed-citation></ref>

  </ref-list></back>
    <!--<article-title-html>Fast sensitivity analysis methods for computationally expensive models with multi-dimensional output</article-title-html>
<abstract-html><p>Global sensitivity analysis (GSA) is a powerful approach in identifying which
inputs or parameters most affect a model's output. This determines
which inputs to include when performing model calibration or uncertainty
analysis. GSA allows quantification of the sensitivity index (SI) of a
particular input – the percentage of the total variability in the output
attributed to the changes in that input – by averaging over the other inputs
rather than fixing them at specific values. Traditional methods of computing
the SIs using the Sobol and extended Fourier Amplitude
Sensitivity Test (eFAST) methods involve running a
model thousands of times, but this may not be feasible for computationally
expensive Earth system models. GSA methods that use a statistical emulator in
place of the expensive model are popular, as they require far fewer model
runs. We performed an eight-input GSA, using the Sobol and eFAST methods, on
two computationally expensive atmospheric chemical transport models using
emulators that were trained with 80 runs of the models. We considered two
methods to further reduce the computational cost of GSA: (1) a
dimension reduction approach and (2) an emulator-free approach. When
the output of a model is multi-dimensional, it is common practice to build a
separate emulator for each dimension of the output space. Here, we used
principal component analysis (PCA) to reduce the output dimension, built an
emulator for each of the transformed outputs, and then computed SIs of the
reconstructed output using the Sobol method. We considered the global
distribution of the annual column mean lifetime of atmospheric methane, which
requires  ∼ &thinsp;2000 emulators without PCA but only 5–40 emulators
with PCA. We also applied an emulator-free method using a generalised
additive model (GAM) to estimate the SIs using only the training runs.
Compared to the emulator-only methods, the emulator–PCA and GAM methods
accurately estimated the SIs of the  ∼ &thinsp;2000 methane lifetime
outputs but were on average 24 and 37 times faster, respectively.</p></abstract-html>
<ref-html id="bib1.bib1"><label>1</label><mixed-citation>
Ahtikoski, A., Heikkilä, J., Alenius, V., and Siren, M.: Economic
viability of utilizing biomass energy from young stands – the case of
Finland, Biomass Bioenerg., 32, 988–996, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib2"><label>2</label><mixed-citation>
Ba, S., Myers, W. R., and Brenneman, W. A.: Optimal sliced Latin hypercube
designs, Technometrics, 57, 479–487, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib3"><label>3</label><mixed-citation>
Bailis, R., Ezzati, M., and Kammen, D. M.: Mortality and greenhouse gas
impacts of biomass and petroleum energy futures in Africa, Science, 308,
98–103, 2005.
</mixed-citation></ref-html>
<ref-html id="bib1.bib4"><label>4</label><mixed-citation>
Bastos, L. S. and O'Hagan, A.: Diagnostics for Gaussian process emulators,
Technometrics, 51, 425–438, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib5"><label>5</label><mixed-citation>
Campbell, J. E., Carmichael, G. R., Chai, T., Mena-Carrasco, M., Tang, Y.,
Blake, D., Blake, N., Vay, S. A., Collatz, G. J., and Baker, I.:
Photosynthetic control of atmospheric carbonyl sulfide during the growing
season, Science, 322, 1085–1088, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib6"><label>6</label><mixed-citation>
Carslaw, K., Lee, L., Reddington, C., Pringle, K., Rap, A., Forster, P.,
Mann, G., Spracklen, D., Woodhouse, M., and Regayre, L.: Large contribution
of natural aerosols to uncertainty in indirect forcing, Nature, 503, 67–71,
2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib7"><label>7</label><mixed-citation>
Chang, E. T., Strong, M., and Clayton, R. H.: Bayesian sensitivity analysis
of a cardiac cell model using a Gaussian process emulator, PloS one, 10,
e0130252, <a href="https://doi.org/10.1371/journal.pone.0137004" target="_blank">https://doi.org/10.1371/journal.pone.0137004</a>, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib8"><label>8</label><mixed-citation>
Coggan, J. S., Bartol, T. M., Esquenazi, E., Stiles, J. R., Lamont, S.,
Martone, M. E., Berg, D. K., Ellisman, M. H., and Sejnowski, T. J.: Evidence
for ectopic neurotransmission at a neuronal synapse, Science, 309, 446–451,
2005.
</mixed-citation></ref-html>
<ref-html id="bib1.bib9"><label>9</label><mixed-citation>
Cressie, N.: The origins of kriging, Math. Geol., 22, 239–252,
1990.
</mixed-citation></ref-html>
<ref-html id="bib1.bib10"><label>10</label><mixed-citation>
Cukier, R., Fortuin, C., Shuler, K. E., Petschek, A., and Schaibly, J.:
Study of the sensitivity of coupled reaction systems to uncertainties in
rate coefficients. I Theory, The J. Chem. Phys., 59, 3873–3878,
1973.
</mixed-citation></ref-html>
<ref-html id="bib1.bib11"><label>11</label><mixed-citation>
Currin, C., Mitchell, T., Morris, M., and Ylvisaker, D.: Bayesian prediction
of deterministic functions, with applications to the design and analysis of
computer experiments, J. Am. Stat. Assoc., 86,
953–963, 1991.
</mixed-citation></ref-html>
<ref-html id="bib1.bib12"><label>12</label><mixed-citation>
de Gee, M., Lof, M. E., and Hemerik, L.: The effect of chemical information
on the spatial distribution of fruit flies: II parameterization,
calibration, and sensitivity, B. Math. Biol., 70, 1850–1868,
2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib13"><label>13</label><mixed-citation>
Degroote, J., Couckuyt, I., Vierendeels, J., Segers, P., and Dhaene, T.:
Inverse modelling of an aneurysm's stiffness using surrogate-based
optimization and fluid-structure interaction simulations, Struct.
Multidis. Optim., 46, 457–469, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib14"><label>14</label><mixed-citation>
De Lozzo, M. and Marrel, A.: Sensitivity analysis with dependence and
variance-based measures for spatio-temporal numerical simulators, Stoch.
Environ. Res. Risk Assess., 31, 1437–1453, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib15"><label>15</label><mixed-citation>
Ferretti, F., Saltelli, A., and Tarantola, S.: Trends in sensitivity
analysis practice in the last decade, Sci. Total Environ.,
568, 666–670, <a href="https://doi.org/10.1016/j.scitotenv.2016.02.133" target="_blank">https://doi.org/10.1016/j.scitotenv.2016.02.133</a>, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib16"><label>16</label><mixed-citation>
Goldstein, M. and Rougier, J.: Bayes linear calibrated prediction for
complex systems, J. Am. Stat. Assoc., 101,
1132–1143, 2006.
</mixed-citation></ref-html>
<ref-html id="bib1.bib17"><label>17</label><mixed-citation>
Gómez-Dans, J. L., Lewis, P. E., and Disney, M.: Efficient Emulation of
Radiative Transfer Codes Using Gaussian Processes and Application to Land
Surface Parameter Inferences, Remote Sens., 8, 1–32, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib18"><label>18</label><mixed-citation>
Hankin, R. K.: Introducing BACCO, an R package for Bayesian analysis of
computer code output, J. Stat. Softw., 14, 1–21, 2005.
</mixed-citation></ref-html>
<ref-html id="bib1.bib19"><label>19</label><mixed-citation>
Hill, T. C., Ryan, E., and Williams, M.: The use of CO<sub>2</sub> flux time series for
parameter and carbon stock estimation in carbon cycle research, Global
Change Biol., 18, 179–193, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib20"><label>20</label><mixed-citation>
Homma, T. and Saltelli, A.: Importance measures in global sensitivity
analysis of nonlinear models, Reliab. Eng. Syst. Safe.,
52, 1–17, 1996.
</mixed-citation></ref-html>
<ref-html id="bib1.bib21"><label>21</label><mixed-citation>
Iooss, B. and Lemaître, P.: A review on global sensitivity analysis
methods, in: Uncertainty Management in Simulation-Optimization of Complex
Systems, Operations Research/Computer Science Interfaces Series, Vol 59.
Springer, Boston, MA, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib22"><label>22</label><mixed-citation>
Kennedy, M., Anderson, C., O'Hagan, A., Lomas, M., Woodward, I., Gosling, J.
P., and Heinemeyer, A.: Quantifying uncertainty in the biospheric carbon
flux for England and Wales, J. Royal Stat. Soc.
A , 171, 109–135, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib23"><label>23</label><mixed-citation>
Kennedy, M. C. and O'Hagan, A.: Predicting the output from a complex
computer code when fast approximations are available, Biometrika, 87, 1–13,
2000.
</mixed-citation></ref-html>
<ref-html id="bib1.bib24"><label>24</label><mixed-citation>
Koehler, J. and Owen, A.: 9 Computer experiments, Handbook of Statistics,
13, 261–308, 1996.
</mixed-citation></ref-html>
<ref-html id="bib1.bib25"><label>25</label><mixed-citation>
Lamboni, M., Monod, H., and Makowski, D.: Multivariate sensitivity analysis
to measure global contribution of input factors in dynamic models,
Reliab. Eng. Syst. Safe., 96, 450–459, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib26"><label>26</label><mixed-citation>
Lee, L. A., Carslaw, K. S., Pringle, K. J., and Mann, G. W.: Mapping the
uncertainty in global CCN using emulation, Atmos. Chem. Phys., 12, 9739–9751,
<a href="https://doi.org/10.5194/acp-12-9739-2012" target="_blank">https://doi.org/10.5194/acp-12-9739-2012</a>, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib27"><label>27</label><mixed-citation>
Lee, L. A., Pringle, K. J., Reddington, C. L., Mann, G. W., Stier, P.,
Spracklen, D. V., Pierce, J. R., and Carslaw, K. S.: The magnitude and causes
of uncertainty in global model simulations of cloud condensation nuclei,
Atmos. Chem. Phys., 13, 8879–8914, <a href="https://doi.org/10.5194/acp-13-8879-2013" target="_blank">https://doi.org/10.5194/acp-13-8879-2013</a>,
2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib28"><label>28</label><mixed-citation>
Lilburne, L. and Tarantola, S.: Sensitivity analysis of spatial models,
Int. J. Geogr. Inform. Sci., 23, 151–168,
2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib29"><label>29</label><mixed-citation>
Loeppky, J. L., Sacks, J., and Welch, W. J.: Choosing the sample size of a
computer experiment: A practical guide, Technometrics, 51, 366–376, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib30"><label>30</label><mixed-citation>
Mara, T. A. and Tarantola, S.: Application of global sensitivity analysis of
model output to building thermal simulations,
Building Simulation, 1, 290–302, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib31"><label>31</label><mixed-citation>
Marrel, A., Iooss, B., Laurent, B., and Roustant, O.: Calculations of sobol
indices for the gaussian process metamodel, Reliab. Eng.
Syst. Safe., 94, 742–751, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib32"><label>32</label><mixed-citation>
Oakley, J. E. and O'Hagan, A.: Probabilistic sensitivity analysis of complex
models: a Bayesian approach, J. Royal Stat. Soc.
B, 66, 751–769, 2004.
</mixed-citation></ref-html>
<ref-html id="bib1.bib33"><label>33</label><mixed-citation>
O'Hagan, A.: Bayesian analysis of computer code outputs: a tutorial,
Reliab. Eng. Syst. Safe., 91, 1290–1300, 2006.
</mixed-citation></ref-html>
<ref-html id="bib1.bib34"><label>34</label><mixed-citation>
Pistone, G. and Vicario, G.: Kriging prediction from a circular grid:
application to wafer diffusion, Appl. Stoch. Models Business
Industry, 29, 350–361, 2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib35"><label>35</label><mixed-citation>
Queipo, N. V., Haftka, R. T., Shyy, W., Goel, T., Vaidyanathan, R., and
Tucker, P. K.: Surrogate-based analysis and optimization, Prog.
Aerosp. Sci., 41, 1–28, 2005.
</mixed-citation></ref-html>
<ref-html id="bib1.bib36"><label>36</label><mixed-citation>
Rasmussen, C.  E.  and Williams, C. K. I.: Gaussian Processes for Machine
Learning, 2006, the MIT Press, ISBN 026218253X, 2006.
</mixed-citation></ref-html>
<ref-html id="bib1.bib37"><label>37</label><mixed-citation>
Ripley, B. D.: Spatial statistics, John Wiley &amp; Sons,
Hoboken, New Jersey, 2005.
</mixed-citation></ref-html>
<ref-html id="bib1.bib38"><label>38</label><mixed-citation>
Roustant, O., Ginsbourger, D., and Deville, Y.: DiceKriging, DiceOptim: Two
R packages for the analysis of computer experiments by kriging-based
metamodeling and optimization, available at: <a href="https://hal.archives-ouvertes.fr/hal-00495766/document" target="_blank">https://hal.archives-ouvertes.fr/hal-00495766/document</a> (last access:  15 June 2016),
2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib39"><label>39</label><mixed-citation>
Roy, P. T., El Moçayd, N., Ricci, S., Jouhaud, J.-C., Goutal, N., De
Lozzo, M., and Rochoux, M. C.: Comparison of Polynomial Chaos and Gaussian
Process surrogates for uncertainty quantification and correlation estimation
of spatially distributed open-channel steady flows, Stoch. Environ.
Res. Risk Assess., 2017, 1–19, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib40"><label>40</label><mixed-citation>
Ryan, E.: Fast sensitivity analysis methods for computationally expensive models with multi-dimensional
output, <a href="https://doi.org/10.5281/zenodo.1038667" target="_blank">https://doi.org/10.5281/zenodo.1038667</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib41"><label>41</label><mixed-citation>
Ryan, E. and Wild, O.: Data for the GSA methods paper by Ryan et al.,
<a href="https://doi.org/10.5281/zenodo.1038670" target="_blank">https://doi.org/10.5281/zenodo.1038670</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib42"><label>42</label><mixed-citation>
Saltelli, A.: Making best use of model evaluations to compute sensitivity
indices, Comput. Phys. Commun., 145, 280–297, 2002.
</mixed-citation></ref-html>
<ref-html id="bib1.bib43"><label>43</label><mixed-citation>
Saltelli, A., Andres, T., and Homma, T.: Sensitivity analysis of model
output: an investigation of new techniques, Comput. Stat.
Data Anal., 15, 211–238, 1993.
</mixed-citation></ref-html>
<ref-html id="bib1.bib44"><label>44</label><mixed-citation>
Saltelli, A. and Annoni, P.: How to avoid a perfunctory sensitivity
analysis, Environ. Modell. Softw., 25, 1508–1517, 2010.
</mixed-citation></ref-html>
<ref-html id="bib1.bib45"><label>45</label><mixed-citation>
Saltelli, A., Ratto, M., Andres, T., Campolongo, F., Cariboni, J., Gatelli,
D., Saisana, M., and Tarantola, S.: Global sensitivity analysis: the primer,
John Wiley &amp; Sons, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib46"><label>46</label><mixed-citation>
Saltelli, A., Ratto, M., Tarantola, S., and Campolongo, F.: Update 1 of:
Sensitivity analysis for chemical models, Chem. Rev., 112, PR1–PR21,
2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib47"><label>47</label><mixed-citation>
Saltelli, A., Tarantola, S., and Chan, K.-S.: A quantitative
model-independent method for global sensitivity analysis of model output,
Technometrics, 41, 39–56, 1999.
</mixed-citation></ref-html>
<ref-html id="bib1.bib48"><label>48</label><mixed-citation>
Schmidt, G. A., Kelley, M., Nazarenko, L., Ruedy, R., Russell, G. L.,
Aleinov, I., Bauer, M., Bauer, S. E., Bhat, M. K., and Bleck, R.:
Configuration and assessment of the GISS ModelE2 contributions to the CMIP5
archive, J. Adv. Model. Earth Syst., 6, 141–184, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib49"><label>49</label><mixed-citation>
Sexton, D. M., Murphy, J. M., Collins, M., and Webb, M. J.: Multivariate
probabilistic projections using imperfect climate models part I: outline of
methodology, Clim. Dynam., 38, 2513–2542, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib50"><label>50</label><mixed-citation>
Shindell, D. T., Faluvegi, G., Unger, N., Aguilar, E., Schmidt,
G. A., Koch, D. M., Bauer, S. E., and Miller, R. L.: Simulations
of preindustrial, present-day, and 2100 conditions in the NASA
GISS composition and climate model G-PUCCINI, Atmos. Chem. Phys.,
6, 4427–4459, <a href="https://doi.org/10.5194/acp-6-4427-2006" target="_blank">https://doi.org/10.5194/acp-6-4427-2006</a>, 2006.
</mixed-citation></ref-html>
<ref-html id="bib1.bib51"><label>51</label><mixed-citation>
Sobie, E. A.: Parameter sensitivity analysis in electrophysiological models
using multivariable regression, Biophys. J., 96, 1264–1274, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib52"><label>52</label><mixed-citation>
Sobol, I. Y. M.: On sensitivity estimation for nonlinear mathematical
models, Matemat. Modeliro., 2, 112–118, 1990.
</mixed-citation></ref-html>
<ref-html id="bib1.bib53"><label>53</label><mixed-citation>
Stanfill, B., Mielenz, H., Clifford, D., and Thorburn, P.: Simple approach
to emulating complex computer models for global sensitivity analysis,
Environ. Modell. Softw., 74, 140–155, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib54"><label>54</label><mixed-citation>
Stites, E. C., Trampont, P. C., Ma, Z., and Ravichandran, K. S.: Network
analysis of oncogenic Ras activation in cancer, Science, 318, 463–467, 2007.
</mixed-citation></ref-html>
<ref-html id="bib1.bib55"><label>55</label><mixed-citation>
Strong, M., Oakley, J. E., and Brennan, A.: An efficient method for
computing the Expected Value of Sample Information, A non-parametric
regression approach, ScHARR working paper, 2015a.
</mixed-citation></ref-html>
<ref-html id="bib1.bib56"><label>56</label><mixed-citation>
Strong, M., Oakley, J. E., and Brennan, A.: Estimating multiparameter
partial expected value of perfect information from a probabilistic
sensitivity analysis sample a nonparametric regression approach, Med.
Decis. Mak., 34, 311–326, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib57"><label>57</label><mixed-citation>
Strong, M., Oakley, J. E., Brennan, A., and Breeze, P.: Estimating the
expected value of sample information using the probabilistic sensitivity
analysis sample a fast nonparametric regression-based method, Med.
Decis. Mak., 35, 570–583, 2015b.
</mixed-citation></ref-html>
<ref-html id="bib1.bib58"><label>58</label><mixed-citation>
Tarantola, S., Gatelli, D., and Mara, T. A.: Random balance designs for the
estimation of first order global sensitivity indices, Reliab.
Eng. Syst. Safe., 91, 717–727, 2006.
</mixed-citation></ref-html>
<ref-html id="bib1.bib59"><label>59</label><mixed-citation>
Vanuytrecht, E., Raes, D., and Willems, P.: Global sensitivity analysis of
yield output from the water productivity model, Environ. Modell.
Softw., 51, 323–332, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib60"><label>60</label><mixed-citation>
Verrelst, J., Sabater, N., Rivera, J. P., Muñoz-Marí, J., Vicent,
J., Camps-Valls, G., and Moreno, J.: Emulation of Leaf, Canopy and
Atmosphere Radiative Transfer Models for Fast Global Sensitivity Analysis,
Remote Sens., 8, 673–699, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib61"><label>61</label><mixed-citation>
Voulgarakis, A., Naik, V., Lamarque, J.-F., Shindell, D. T., Young, P. J.,
Prather, M. J., Wild, O., Field, R. D., Bergmann, D., Cameron-Smith, P.,
Cionni, I., Collins, W. J., Dalsøren, S. B., Doherty, R. M., Eyring, V.,
Faluvegi, G., Folberth, G. A., Horowitz, L. W., Josse, B., MacKenzie, I. A.,
Nagashima, T., Plummer, D. A., Righi, M., Rumbold, S. T., Stevenson, D. S.,
Strode, S. A., Sudo, K., Szopa, S., and Zeng, G.: Analysis of present day and
future OH and methane lifetime in the ACCMIP simulations, Atmos. Chem. Phys.,
13, 2563–2587, <a href="https://doi.org/10.5194/acp-13-2563-2013" target="_blank">https://doi.org/10.5194/acp-13-2563-2013</a>, 2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib62"><label>62</label><mixed-citation>
Vu-Bac, N., Rafiee, R., Zhuang, X., Lahmer, T., and Rabczuk, T.: Uncertainty
quantification for multiscale modeling of polymer nanocomposites with
correlated parameters, Composites  B, 68, 446–464, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib63"><label>63</label><mixed-citation>
Welch, W. J., Buck, R. J., Sacks, J., Wynn, H. P., Mitchell, T. J., and
Morris, M. D.: Screening, predicting, and computer experiments,
Technometrics, 34, 15–25, 1992.
</mixed-citation></ref-html>
<ref-html id="bib1.bib64"><label>64</label><mixed-citation>
Wild, O.: Modelling the global tropospheric ozone budget: exploring the
variability in current models, Atmos. Chem. Phys., 7, 2643–2660,
<a href="https://doi.org/10.5194/acp-7-2643-2007" target="_blank">https://doi.org/10.5194/acp-7-2643-2007</a>, 2007.
</mixed-citation></ref-html>
<ref-html id="bib1.bib65"><label>65</label><mixed-citation>
Wild, O., Pochanart, P., and Akimoto, H.: Trans-Eurasian transport of ozone
and its precursors, J. Geophys. Res.-Atmos., 109, D11302, <a href="https://doi.org/10.1029/2003JD004501" target="_blank">https://doi.org/10.1029/2003JD004501</a>, 2004.
</mixed-citation></ref-html>
<ref-html id="bib1.bib66"><label>66</label><mixed-citation>
Wild, O. and Prather, M. J.: Excitation of the primary tropospheric chemical
mode in a global three-dimensional model, J. Geophys. Res.,
105, 24647–24660, 2000.

</mixed-citation></ref-html>
<ref-html id="bib1.bib67"><label>67</label><mixed-citation>
Wild, O., Ryan, E., O'Connor, F., Vougarakis, A., and Lee, L.: Reducing
Uncertainty in Model Budgets of Tropospheric Ozone and OH,
Atmos.Chem. Phys., in preparation, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib68"><label>68</label><mixed-citation>
Wold, S., Sjöström, M., and Eriksson, L.: PLS-regression: a basic
tool of chemometrics, Chemom. Intell. Labor. Syst., 58,
109–130, 2001.
</mixed-citation></ref-html>
<ref-html id="bib1.bib69"><label>69</label><mixed-citation>
Wood, S. N.: Generalized additive models: an introduction with R, CRC press,
New York, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib70"><label>70</label><mixed-citation>
Wu, J., Dhingra, R., Gambhir, M., and Remais, J. V.: Sensitivity analysis of
infectious disease models: methods, advances and their application, J.
Roy. Soc. Interf., 10, <a href="https://doi.org/10.1098/rsif.2012.1018" target="_blank">https://doi.org/10.1098/rsif.2012.1018</a>, 2013.
</mixed-citation></ref-html>--></article>
