Multi-level Monte Carlo path simulation
We show that multigrid ideas can be used to reduce the computational complexity of estimating an expected value arising from a stochastic differential equation using Monte Carlo path simulations. In the simplest case of a Lipschitz payoff and an Euler discretisation, the computational cost to achiev...
Main Author: | Giles, M |
---|---|
Format: | Report |
Published: |
Unspecified
2006
|
Similar Items
-
Multilevel Monte Carlo path simulation
by: Giles, M
Published: (2008) -
Multilevel Monte Carlo path simulation.
by: Giles, M
Published: (2007) -
Analysis of multilevel Monte Carlo path simulation using the Milstein discretisation
by: Giles, M, et al.
Published: (2019) -
Multi-level Monte Carlo approximation of distribution functions and densities
by: Giles, M, et al.
Published: (2015) -
Analysing multi-level Monte Carlo for options with non-globally Lipschitz payoff
by: Giles, M, et al.
Published: (2009)