arrow
返回

Multilevel Monte Carlo Path Simulation

delete2008-06-01
delete0
delete
OA
AI
DOI:10.1287/opre.1070.0496delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

暂无期刊信息

机构

暂无机构信息
引用论文

引用论文

暂无论文信息