Fourier amplitude sensitivity testing (FAST) is a variance-based global sensitivity analysis method. The sensitivity value is defined based on conditional variances which indicate the individual or joint effects of the uncertain inputs on the output.
FAST first represents conditional variances via coefficients from the multiple Fourier series expansion of the output function. Then the ergodic theorem is applied to transform the multi-dimensional integral to a one-dimensional integral in evaluation of the Fourier coefficients. A set of incommensurate frequencies is required to perform the transform and most frequencies are irrational. To facilitate computation a set of integer frequencies is selected instead of the irrational frequencies. The integer frequencies are not strictly incommensurate, resulting in an error between the multi-dimensional integral and the transformed one-dimensional integral. However, the integer frequencies can be selected to be incommensurate to any order so that the error can be controlled meeting any precision requirement in theory. Using integer frequencies in the integral transform, the resulted function in the one-dimensional integral is periodic and the integral only needs to evaluate in a single period. Next, since the continuous integral function can be recovered from a set of finite sampling points if the Nyquist–Shannon sampling theorem is satisfied, the one-dimensional integral is evaluated from the summation of function values at the generated sampling points.
FAST is more efficient to calculate sensitivities than other variance-based global sensitivity analysis methods via Monte Carlo integration. However the calculation by FAST is usually limited to sensitivities referring to “main effect” or “total effect”.
The FAST method originated in study of coupled chemical reaction systems in 1973 and the detailed analysis of the computational error was presented latter in 1975. Only the first order sensitivity indices referring to “main effect” were calculated in the original method. A FORTRAN computer program capable of analyzing either algebraic or differential equation systems was published in 1982. In 1990s, the relationship between FAST sensitivity indices and Sobol’s ones calculated from Monte-Carlo simulation was revealed in the general framework of ANOVA-like decomposition and an extended FAST method able to calculate sensitivity indices referring to “total effect” was developed.
Sensitivity indices of a variance-based method are calculated via ANOVA-like decomposition of the function for analysis. Suppose the function is
Y
=
f
(
X
)
=
f
(
X
1
,
X
2
,
…
,
X
n
)
where
0
≤
X
j
≤
1
,
j
=
1
,
…
,
n
. The ANOVA-like decomposition is
f
(
X
1
,
X
2
,
…
,
X
n
)
=
f
0
+
∑
j
=
1
n
f
j
(
X
j
)
+
∑
j
=
1
n
−
1
∑
k
=
j
+
1
n
f
j
k
(
X
j
,
X
k
)
+
⋯
+
f
12
…
n
provided that
f
0
is a constant and the integral of each term in the sums is zero, i.e.
∫
0
1
f
j
1
j
2
…
j
r
(
X
j
1
,
X
j
2
,
…
,
X
j
r
)
d
X
j
k
=
0
,
1
≤
k
≤
r
.
The conditional variance which characterizes the contribution of each term to the total variance of
f
(
X
)
is
V
j
1
j
2
…
j
r
=
∫
0
1
⋯
∫
0
1
f
j
1
j
2
…
j
r
2
(
X
j
1
,
X
j
2
,
…
,
X
j
r
)
d
X
j
1
d
X
j
2
…
d
X
j
r
.
The total variance is the sum of all conditional variances
V
=
∑
j
=
1
n
V
j
+
∑
j
=
1
n
−
1
∑
k
=
j
+
1
n
V
j
k
+
⋯
+
V
12
…
n
.
The sensitivity index is defined as the normalized conditional variance as
S
j
1
j
2
…
j
r
=
V
j
1
j
2
…
j
r
V
especially the first order sensitivity
S
j
=
V
j
V
which indicates the main effect of the input
X
j
.
One way to calculate the ANOVA-like decomposition is based on multiple Fourier series. The function
f
(
X
)
in the unit hyper-cube can be extended to a multiply periodic function and the multiple Fourier series expansion is
f
(
X
1
,
X
2
,
…
,
X
n
)
=
∑
m
1
=
−
∞
∞
∑
m
2
=
−
∞
∞
⋯
∑
m
n
=
−
∞
∞
C
m
1
m
2
.
.
.
m
n
exp
[
2
π
i
(
m
1
X
1
+
m
2
X
2
+
⋯
+
m
n
X
n
)
]
,
for integers
m
1
,
m
2
,
…
,
m
n
where the Fourier coefficient is
C
m
1
m
2
.
.
.
m
n
=
∫
0
1
⋯
∫
0
1
f
(
X
1
,
X
2
,
…
,
X
n
)
exp
[
−
2
π
i
(
m
1
X
1
+
m
2
X
2
+
⋯
+
m
n
X
n
)
]
.
The ANOVA-like decomposition is
f
0
=
C
00
…
0
f
j
=
∑
m
j
≠
0
C
0
…
m
j
…
0
exp
[
2
π
i
m
j
X
j
]
f
j
k
=
∑
m
j
≠
0
∑
m
k
≠
0
C
0
…
m
j
…
m
k
…
0
exp
[
2
π
i
(
m
j
X
j
+
m
k
X
k
)
]
f
12
…
n
=
∑
m
1
≠
0
∑
m
2
≠
0
⋯
∑
m
n
≠
0
C
m
1
m
2
…
m
n
exp
[
2
π
i
(
m
1
X
1
+
m
2
X
2
+
⋯
+
m
n
X
n
)
]
.
The first order conditional variance is
V
j
=
∫
0
1
f
j
2
(
X
j
)
d
X
j
=
∑
m
j
≠
0
|
C
0
…
m
j
…
0
|
2
=
2
∑
m
j
=
1
∞
(
A
m
j
2
+
B
m
j
2
)
where
A
m
j
and
B
m
j
are the real and imaginary part of
C
0
…
m
j
…
0
respectively
A
m
j
=
∫
0
1
⋯
∫
0
1
f
(
X
1
,
X
2
,
…
,
X
n
)
cos
(
2
π
m
j
X
j
)
d
X
1
d
X
2
…
d
X
n
B
m
j
=
∫
0
1
⋯
∫
0
1
f
(
X
1
,
X
2
,
…
,
X
n
)
sin
(
2
π
m
j
X
j
)
d
X
1
d
X
2
…
d
X
n
A multi-dimensional integral is required to evaluate for calculating the Fourier coefficients. One way is to transform the multi-dimensional integral into a one-dimensional integral by expressing every input as a function of a new independent variable
s
as
X
j
(
s
)
=
1
2
π
(
ω
j
s
mod
2
π
)
,
j
=
1
,
2
,
…
,
n
where
{
ω
j
}
is a set of incommensurate frequencies, i.e.
∑
j
=
1
n
γ
j
ω
j
=
0
for an integer set of
{
γ
j
}
if and only if
γ
j
=
0
for every
j
. Then the Fourier coefficients can be calculated by a one-dimensional integral according to the ergodic theorem
A
m
j
=
lim
T
→
∞
1
2
T
∫
−
T
T
f
(
X
1
(
s
)
,
X
2
(
s
)
,
…
,
X
n
(
s
)
)
cos
(
2
π
m
j
X
j
(
s
)
)
d
s
B
m
j
=
lim
T
→
∞
1
2
T
∫
−
T
T
f
(
X
1
(
s
)
,
X
2
(
s
)
,
…
,
X
n
(
s
)
)
sin
(
2
π
m
j
X
j
(
s
)
)
d
s
At most one of the incommensurate frequencies
{
ω
j
}
can be rational with all others being irrational. Since the numerical value of an irrational number cannot be stored exactly in a computer, an approximation of the incommensurate frequencies by all rational numbers is required in implementation. Without loss of any generality the frequencies can be set as integers instead of any rational numbers. A set of integers
{
ω
j
}
is approximately incommensurate to the order of
M
if
∑
j
=
1
n
γ
j
ω
j
≠
0
for
∑
j
=
1
n
|
γ
j
|
≤
M
+
1
where
M
is an integer. The exact incommensurate condition is an extreme case when
M
→
∞
.
Using the integer frequencies the function in the transformed one-dimensional integral is periodic so only the integration over a period of
2
π
is required. The Fourier coefficients can be approximately calculated as
A
m
j
≈
1
2
π
∫
−
π
π
f
(
X
1
(
s
)
,
X
2
(
s
)
,
…
,
X
n
(
s
)
)
cos
(
m
j
ω
j
s
)
d
s
:=
A
^
m
j
B
m
j
≈
1
2
π
∫
−
π
π
f
(
X
1
(
s
)
,
X
2
(
s
)
,
…
,
X
n
(
s
)
)
sin
(
m
j
ω
j
s
)
d
s
:=
B
^
m
j
The approximation of the incommensurate frequencies for a finite
M
results in a discrepancy error between the true Fourier coefficients
A
m
j
,
B
m
j
and their estimates
A
^
m
j
,
B
^
m
j
. The larger the order
M
is the smaller the error is but the more computational efforts are required to calculate the estimates in the following procedure. In practice
M
is frequently set to 4 and a table of resulted frequency sets which have up to 50 frequencies is available. (McRae et al., 1982)
The transform,
X
j
(
s
)
=
1
2
π
(
ω
j
s
mod
2
π
)
, defines a search curve in the input space. If the frequencies,
ω
j
,
j
=
1
,
…
,
n
, are incommensurate, the search curve can pass through every point in the input space as
s
varies from 0 to
∞
so the multi-dimensional integral over the input space can be accurately transformed to a one-dimensional integral along the search curve. However, if the frequencies are approximately incommensurate integers, the search curve cannot pass through every point in the input space. If fact the search is repeated since the transform function is periodic, with a period of
2
π
. The one-dimensional integral can be evaluated over a single period instead of the infinite interval for incommensurate frequencies; However, a computational error arises due to the approximation of the incommensuracy.
Search curve
The approximated Fourier can be further expressed as
A
^
m
j
=
{
0
m
j
odd
1
π
∫
−
π
/
2
π
/
2
f
(
X
(
s
)
)
cos
(
m
j
ω
j
s
)
d
s
m
j
even
and
B
^
m
j
=
{
1
π
∫
−
π
/
2
π
/
2
f
(
X
(
s
)
)
sin
(
m
j
ω
j
s
)
d
s
m
j
odd
0
m
j
even
The non-zero integrals can be calculated from sampling points
A
^
m
j
=
1
2
q
+
1
∑
k
=
−
q
q
f
(
X
(
s
k
)
)
cos
(
m
j
ω
j
s
k
)
,
m
j
even
B
^
m
j
=
1
2
q
+
1
∑
k
=
−
q
q
f
(
X
(
s
k
)
)
sin
(
m
j
ω
j
s
k
)
,
m
j
odd
where the uniform sampling point in
[
−
π
/
2
,
π
/
2
]
is
s
k
=
π
k
2
q
+
1
,
k
=
−
q
,
…
,
−
1
,
0
,
1
,
…
,
q
.
The total number of sampling points is
2
q
+
1
which should satisfy the Nyquist sampling criterion, i.e.
2
q
+
1
≥
N
ω
m
a
x
+
1
where
ω
m
a
x
is the largest frequency in
{
ω
k
}
and
N
is the maximum order of the calculated Fourier coefficients.
After calculating the estimated Fourier coefficients, the first order conditional variance can be approximated by
V
j
=
2
∑
m
j
=
1
∞
(
A
m
j
2
+
B
m
j
2
)
≈
2
∑
m
j
=
1
∞
(
A
^
m
j
2
+
B
^
m
j
2
)
≈
2
∑
m
j
=
1
2
(
A
^
m
j
2
+
B
^
m
j
2
)
=
2
(
A
^
m
j
=
2
2
+
B
^
m
j
=
1
2
)
where only the partial sum of the first two terms is calculated and
N
=
2
for determining the number of sampling points. Using the partial sum can usually return an adequately good approximation of the total sum since the terms corresponding to the fundamental frequency and low order frequencies usually contribute most to the total sum. Additionally, the Fourier coefficient in the summation are just an estimate of the true value and adding more higher order terms will not help improve the computational accuracy significantly. Since the integer frequencies are not exactly incommensurate there are two integers
m
j
and
m
k
such that
m
j
ω
j
=
m
k
ω
k
.
Interference between the two frequencies can occur if higher order terms are included in the summation.
Similarly the total variance of
f
(
X
)
can be calculated as
V
≈
A
^
0
[
f
2
]
−
A
^
0
[
f
]
2
where
A
^
0
[
f
2
]
denotes the estimated Fourier coefficient of the function of
f
2
inside the bracket and
A
^
0
[
f
]
2
is the squared Fourier coefficient of the function
f
. Finally the sensitivity referring to the main effect of an input can be calculated by dividing the conditional variance by the total variance.
