Smoothed Circulant Embedding with Applications to Multilevel Monte Carlo Methods for PDEs with Random Coefficients
Anastasia Istratuca, Aretha Teckentrup
TL;DR
This work tackles efficient uncertainty quantification for PDEs with random coefficients by integrating circulant embedding (CE) sampling of Gaussian random fields with smoothing (CES) into Multilevel Monte Carlo (MLMC). By discarding high-frequency components on coarse MLMC levels and using smooth periodisation to maintain positive definiteness, the authors show that the coarsest level can be chosen independently of the covariance length, reducing the overall computational cost by substantial factors (reported as 5–10x in experiments). They derive error bounds for the smoothing procedure, establish level coupling, and provide MLMC complexity results that mirror standard theory while featuring improved constants. Numerical experiments for groundwater-flow-type PDEs with exponential and Matérn covariances demonstrate major practical gains, especially for small correlation lengths, and compare CES to KL-based approaches, highlighting FFT-based efficiency advantages. The methods offer a flexible, general framework for fast sampling of highly oscillatory random fields in MLMC and related uncertainty quantification tasks.
Abstract
We consider the computational efficiency of Monte Carlo (MC) and Multilevel Monte Carlo (MLMC) methods applied to partial differential equations with random coefficients. These arise, for example, in groundwater flow modelling, where a commonly used model for the unknown parameter is a random field. We make use of the circulant embedding procedure for sampling from the aforementioned coefficient. To improve the computational complexity of the MLMC estimator in the case of highly oscillatory random fields, we devise and implement a smoothing technique integrated into the circulant embedding method. This allows to choose the coarsest mesh on the first level of MLMC independently of the correlation length of the covariance function of the random field, leading to considerable savings in computational cost. We illustrate this with numerical experiments, where we see a saving of factor 5-10 in computational cost for accuracies of practical interest.
