Description Usage Arguments Details Value See Also Examples
Computes the Fast Fourier Approximation to P(S>m), given the Characteristic function of S.
1 | FFT (phi, n,lower,upper, m )
|
phi |
Characteristic function of S. |
n |
number of points used in the discretization (possibly a power of 2) |
lower |
starting point of the discretization of S |
upper |
end point of the discretization of S |
m |
approximation to P(S>m) |
The function is useful when the characteristic function of a random variable is known, while the CDF is not. this is the case in the collective risk model with light tailed claim intensities. For the case in which the intensities are heavy tailed, refer to FFT2.
the function returns P(S>m)
FFT2
1 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.