Previously the authors have presented MLMC algorithms exploiting Multiscale Finite Elements and Reduced Bases as a basis for the coarser levels in the MLMC algorithm. In this paper a Renormalization based Multilevel Monte Carlo algorithm is discussed. The advantage of the renormalization as a basis for the coarse levels in MLMC is that it allows in a cheap way to create a reduced dimensional space with a variation which is very close to the variation at the finest level. This leads to especially efficient MLMC algorithms. Parallelization of the proposed algorithm is also considered and results from numerical experiments are presented.
CITATION STYLE
Iliev, O., Mohring, J., & Shegunov, N. (2018). Renormalization based MLMC method for scalar elliptic SPDE. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10665 LNCS, pp. 295–303). Springer Verlag. https://doi.org/10.1007/978-3-319-73441-5_31
Mendeley helps you to discover research relevant for your work.