Multilevel 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 a Euler discretisation, the computational cost to achieve...

Full description

Saved in:
Bibliographic Details
Published in:Operations research Vol. 56; no. 3; pp. 607 - 617
Main Author: Giles, Michael B
Format: Journal Article
Language:English
Published: Linthicum, MD INFORMS 01.05.2008
Institute for Operations Research and the Management Sciences
Subjects:
ISSN:0030-364X, 1526-5463
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.1070.0496