Embedded multilevel monte carlo for uncertainty quantification in random domains

The multilevel Monte Carlo (MLMC) method has proven to be an effective variance-reduction statistical method for uncertainty quantification (UQ) in partial differential equation (PDE) models. It combines approximations at different levels of accuracy using a hierarchy of meshes whose generation is o...

Descripción completa

Detalles Bibliográficos
Autores: Badia, Santiago|||0000-0003-2391-4086, Principe, Ricardo Javier|||0000-0002-1478-2651
Tipo de recurso: artículo
Fecha de publicación:2021
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/354885
Acceso en línea:https://hdl.handle.net/2117/354885
https://dx.doi.org/10.1615/Int.J.UncertaintyQuantification.2021032984
Access Level:acceso abierto
Palabra clave:Numerical analysis
Multilevel Monte Carlo
Embedded methods
Uncertainty quantification
Topological uncertainty
Geometric uncertainty
Stochastic partial differential equations
Random geometry
Anàlisi numèrica
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències
Descripción
Sumario:The multilevel Monte Carlo (MLMC) method has proven to be an effective variance-reduction statistical method for uncertainty quantification (UQ) in partial differential equation (PDE) models. It combines approximations at different levels of accuracy using a hierarchy of meshes whose generation is only possible for simple geometries. On top of that, MLMC and Monte Carlo (MC) for random domains involve the generation of a mesh for every sample. Here we consider the use of embedded methods which make use of simple background meshes of an artificial domain (a bounding-box) for which it is easy to define a mesh hierarchy. We use the recent aggregated finite element method (AgFEM) method, which permits to avoid ill-conditioning due to small cuts, to design an embedded MLMC (EMLMC) framework for (geometrically and topologically) random domains implicitly defined through a random level-set function. Predictions from existing theory are verified in numerical experiments and the use of AgFEM is statistically demonstrated to be crucial for complex and uncertain geometries in terms of robustness and computational cost.