Numerical analysis of multilevel Monte Carlo path simulation using the Milstein discretisation
The multilevel Monte Carlo path simulation method introduced by Giles (Operations Research, 56(3):607-617, 2008) exploits strong convergence properties to improve the computational complexity by combining simulations with different levels of resolution. Previous research has analysed its efficiency when using the Euler-Maruyama discretisation, and also demonstrated its improved efficiency using the Milstein discretisation with its improved strong convergence. In this paper we analyse its efficiency for scalar SDEs using the Milstein discretisation, bounding the order of convergence of the variance of the multilevel estimator, and hence determining the computational complexity of the method.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Michael Giles & Desmond Higham & Xuerong Mao, 2009. "Analysing multi-level Monte Carlo for options with non-globally Lipschitz payoff," Finance and Stochastics, Springer, vol. 13(3), pages 403-413, September.
- Rainer Avikainen, 2009. "On irregular functionals of SDEs and the Euler scheme," Finance and Stochastics, Springer, vol. 13(3), pages 381-401, September.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1302.4676. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators)
If references are entirely missing, you can add them using this form.