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...
Prif Awdur: | Giles, M |
---|---|
Fformat: | Report |
Cyhoeddwyd: |
Unspecified
2006
|
Eitemau Tebyg
-
Multilevel Monte Carlo path simulation
gan: Giles, M
Cyhoeddwyd: (2008) -
Multilevel Monte Carlo path simulation.
gan: Giles, M
Cyhoeddwyd: (2007) -
Analysis of multilevel Monte Carlo path simulation using the Milstein discretisation
gan: Giles, M, et al.
Cyhoeddwyd: (2019) -
Multi-level Monte Carlo approximation of distribution functions and densities
gan: Giles, M, et al.
Cyhoeddwyd: (2015) -
Analysing multi-level Monte Carlo for options with non-globally Lipschitz payoff
gan: Giles, M, et al.
Cyhoeddwyd: (2009)