scholarly journals An adaptive multilevel Monte Carlo algorithm for the stochastic drift–diffusion–Poisson system

2020 ◽  
Vol 368 ◽  
pp. 113163 ◽  
Author(s):  
Amirreza Khodadadian ◽  
Maryam Parvizi ◽  
Clemens Heitzinger
2017 ◽  
Vol 14 (03) ◽  
pp. 415-454 ◽  
Author(s):  
Ujjwal Koley ◽  
Nils Henrik Risebro ◽  
Christoph Schwab ◽  
Franziska Weber

This paper proposes a finite difference multilevel Monte Carlo algorithm for degenerate parabolic convection–diffusion equations where the convective and diffusive fluxes are allowed to be random. We establish a notion of stochastic entropy solutions to these equations. Our chief goal is to efficiently compute approximations to statistical moments of these stochastic entropy solutions. To this end, we design a multilevel Monte Carlo method based on a finite volume scheme for each sample. We present a novel convergence rate analysis of the combined multilevel Monte Carlo finite volume method, allowing in particular for low [Formula: see text]-integrability of the random solution with [Formula: see text], and low deterministic convergence rates (here, the theoretical rate is [Formula: see text]). We analyze the design and error versus work of the multilevel estimators. We obtain that the maximal rate (based on optimizing possibly the pessimistic upper bounds on the discretization error) is obtained for [Formula: see text], for finite volume convergence rate of [Formula: see text]. We conclude with numerical experiments.


2020 ◽  
Vol 20 (6) ◽  
pp. 116-125
Author(s):  
Nikolay Shegunov ◽  
Oleg Iliev

AbstractMultiLevel Monte Carlo (MLMC) attracts great interest for numerical simulations of Stochastic Partial Differential Equations (SPDEs), due to its superiority over the standard Monte Carlo (MC) approach. MLMC combines in a proper manner many cheap fast simulations with few slow and expensive ones, the variance is reduced, and a significant speed up is achieved. Simulations with MC/MLMC consist of three main components: generating random fields, solving deterministic problem and reduction of the variance. Each part is subject to a different degree of parallelism. Compared to the classical MC, MLMC introduces “levels” on which the sampling is done. These levels have different computational cost, thus, efficiently utilizing the parallel resources becomes a non-trivial problem. The main focus of this paper is the parallelization of the MLMC Algorithm.


2014 ◽  
Vol 20 (1) ◽  
pp. 1-41 ◽  
Author(s):  
Håkon Hoel ◽  
Erik von Schwerin ◽  
Anders Szepessy ◽  
Raúl Tempone

2014 ◽  
Vol 55 (2) ◽  
pp. 399-432 ◽  
Author(s):  
Nathan Collier ◽  
Abdul-Lateef Haji-Ali ◽  
Fabio Nobile ◽  
Erik von Schwerin ◽  
Raúl Tempone

2020 ◽  
Vol 102 (11) ◽  
Author(s):  
Karl Jansen ◽  
Eike H. Müller ◽  
Robert Scheichl

Sign in / Sign up

Export Citation Format

Share Document