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...
Yazar: | Giles, M |
---|---|
Materyal Türü: | Report |
Baskı/Yayın Bilgisi: |
Unspecified
2006
|
Benzer Materyaller
-
Multilevel Monte Carlo path simulation
Yazar:: Giles, M
Baskı/Yayın Bilgisi: (2008) -
Multilevel Monte Carlo path simulation.
Yazar:: Giles, M
Baskı/Yayın Bilgisi: (2007) -
Analysis of multilevel Monte Carlo path simulation using the Milstein discretisation
Yazar:: Giles, M, ve diğerleri
Baskı/Yayın Bilgisi: (2019) -
Multi-level Monte Carlo approximation of distribution functions and densities
Yazar:: Giles, M, ve diğerleri
Baskı/Yayın Bilgisi: (2015) -
Analysing multi-level Monte Carlo for options with non-globally Lipschitz payoff
Yazar:: Giles, M, ve diğerleri
Baskı/Yayın Bilgisi: (2009)