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...
Autor principal: | Giles, M |
---|---|
Formato: | Report |
Publicado em: |
Unspecified
2006
|
Registos relacionados
-
Multilevel Monte Carlo path simulation
Por: Giles, M
Publicado em: (2008) -
Multilevel Monte Carlo path simulation.
Por: Giles, M
Publicado em: (2007) -
Analysis of multilevel Monte Carlo path simulation using the Milstein discretisation
Por: Giles, M, et al.
Publicado em: (2019) -
Multi-level Monte Carlo approximation of distribution functions and densities
Por: Giles, M, et al.
Publicado em: (2015) -
Analysing multi-level Monte Carlo for options with non-globally Lipschitz payoff
Por: Giles, M, et al.
Publicado em: (2009)