arrow
Return

Multilevel Monte Carlo Path Simulation

delete2008-06-01
delete0
delete
OA
AI
DOI:10.1287/opre.1070.0496delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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.

Journal

No journal information available

Organization

No organization information available
Cited Papers

Cited Papers

No cited papers available