2015
DOI: 10.1017/s0021900200012481
|View full text |Cite
|
Sign up to set email alerts
|

On the Acceleration of the Multi-Level Monte Carlo Method

Abstract: The multi-level Monte Carlo method proposed by M. approximates the expectation of some functionals applied to a stochastic process with optimal order of convergence for the mean-square error. In this paper, a modified multi-level Monte Carlo estimator is proposed with significantly reduced computational costs. As the main result, it is proved that the modified estimator reduces the computational costs asymptotically by a factor (p/α) 2 if weak approximation methods of orders α and p are applied in case of com… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 14 publications
0
10
0
Order By: Relevance
“…, where L * and M * l are given by (4.9) and (4.10), respectively, achieves a complexity O ǫ −2 . In [2], Debrabant Rössler improved the multilevel Monte Carlo method by using, in the last level L, a scheme with high order of weak convergence. Although this modified method attains the same complexity, it reduces the computation time by reducing the bias.…”
Section: Multilevel Monte Carlomentioning
confidence: 99%
See 1 more Smart Citation
“…, where L * and M * l are given by (4.9) and (4.10), respectively, achieves a complexity O ǫ −2 . In [2], Debrabant Rössler improved the multilevel Monte Carlo method by using, in the last level L, a scheme with high order of weak convergence. Although this modified method attains the same complexity, it reduces the computation time by reducing the bias.…”
Section: Multilevel Monte Carlomentioning
confidence: 99%
“…In this paper, we propose to use the Ninomiya-Victoir scheme, which is known to exhibit weak convergence with order 2, on the finest grid at the last level L of a multilevel Monte Carlo estimator. This idea is inspired by Debrabant and Rössler [2] who suggest to use a scheme with high order of weak convergence on the finest grid at the finest level L of the multilevel Monte Carlo method. By this way, Debrabant and Rössler reduce the constant in the computational complexity by decreasing the number of discretization levels.…”
Section: Introductionmentioning
confidence: 99%
“…Numerous methods exist to increase the efficiency of Monte Carlo simulation of SDEs. Let us mention only weak explicit [1,13,17,43,44,54,61] and implicit [2,[14][15][16]43,45] higher order schemes, which can increase the time step but might suffer from instability; various extrapolation methods [68] to obtain the precision of higher order from low-order schemes; and variance reduction techniques [18,55], including the multilevel Monte Carlo method [29,30].…”
Section: Introductionmentioning
confidence: 99%
“…As mentioned in the introduction, the EM method as well as the S-ROCK1 method are both of weak order 1 and strong order 1/2. The idea is to use a numerical integrator of higher weak order for the finest time grid (see [6]), in our case S-ROCK2 [1] with weak order 2, which leads to a reduction of the bias. In fact due to the telescopic sum representation of the multilevel estimator, only the estimator based on the smallest time stepsize (which uses S-ROCK2) appears in the bias.…”
Section: Improved Stabilized Multilevel Monte Carlo Methods For Stiff mentioning
confidence: 99%