Adjoint-based Adaptive Multi-Level Monte Carlo for Differential Equations

06/06/2022
by   Jehanzeb Chaudhry, et al.
0

We present a multi-level Monte Carlo (MLMC) algorithm with adaptively refined meshes and accurately computed stopping-criteria utilizing adjoint-based a posteriori error analysis for differential equations. This is in contrast to classical MLMC algorithms that use either a hierarchy of uniform meshes or adaptively refined meshes based on Richardson extrapolation, and employ a stopping criteria that relies on assumptions on the convergence rate of the MLMC levels. This work develops two adaptive refinement strategies for the MLMC algorithm. These strategies are based on a decomposition of an error estimate of the MLMC bias and utilize variational analysis, adjoint problems and computable residuals.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset