Description Usage Arguments Value Author(s) References See Also Examples
If the process X_t is the unique strong solution of the process
dX_t = b(X_t)dt + s(X_t)dW_t,
then the Euler Scheme is X[t+h] = X[t] + b(X[t])h + s(X[t])sqrt(h)Z, where Z ~ N(0,1).
1 |
n |
integer, number of paths. |
m |
integer, number of steps, the step size will be T/m. |
x0 |
numeric, starting point of the process. |
b |
function, the drift, a function which can take a vector and returns a vector. |
s |
function, the volatility, a function which can take a vector and returns a vector. |
t0 |
double, the starting date of the process. |
T |
double, the final date of the process. |
all_dates |
logical, if TRUE, returns all steps from all paths. If FALSE, only returns the n final value X_T. |
delta |
double, the step size. |
If all_dates = TRUE
, it returns a n x m+1 matrix : n paths with m steps (+ the first value). Else, it returns a vector of length n with the simulations of the final dates X_T.
Nicolas Baradel - PGM Solutions
https://en.wikipedia.org/wiki/Euler
https://pgm-solutions.com/packages
1 2 3 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.