Journal article
Multilevel Monte Carlo path simulation
- Abstract:
- 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 a Euler discretisation, the computational cost to achieve an accuracy of O(ε) is reduced from O(ε-3) to O(ε-2(logε)2). The analysis is supported, by numerical results showing significant computational savings. © 2008 INFORMS.
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Journal:
- OPERATIONS RESEARCH
- Volume:
- 56
- Issue:
- 3
- Pages:
- 607-617
- Publication date:
- 2008-01-01
- DOI:
- EISSN:
-
1526-5463
- ISSN:
-
0030-364X
- Source identifiers:
-
9277
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
pubs:9277
- UUID:
-
uuid:0aa80ab7-9406-4778-8f1a-cdafc9c1ed9b
- Local pid:
- pubs:9277
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2008
If you are the owner of this record, you can report an update to it here: Report update to this record