A multigrid multilevel Monte Carlo method for transport in the Darcy–Stokes system

A multilevel Monte Carlo (MLMC) method for Uncertainty Quantification (UQ) of advection-dominated contaminant transport in a coupled Darcy–Stokes flow system is described. In particular, we focus on high-dimensional epistemic uncertainty due to an unknown permeability field in the Darcy domain that is modelled as a lognormal random field. This paper explores different numerical strategies for the subproblems and suggests an optimal combination for the MLMC estimator. We propose a specific monolithic multigrid algorithm to efficiently solve the steady-state Darcy–Stokes flow with a highly heterogeneous diffusion coefficient. Furthermore, we describe an Alternating Direction Implicit (ADI) based time-stepping for the flux-limited quadratic upwinding discretization for the transport problem. Numerical experiments illustrating the multigrid convergence and cost of the MLMC estimator with respect to the smoothness of permeability field are presented

The parallel finite element system M++ with integrated multilevel preconditioning and multilevel Monte Carlo methods

We present a parallel data structure for the discretization of partial differential equations which is based on distributed point objects and which enables the flexible, transparent, and efficient realization of conforming, nonconforming, and mixed finite elements. This concepts is realized for elliptic, parabolic and hyperbolic model problems, and sample applications are provided by a tutorial complementing a lecture on scientific computing. The corresponding open-source software is based on this parallel data structure, and it supports multilevel methods on nested meshes and 2D and 3D as well as in space-time. Here, we present generic results on porous media applications including multilevel preconditioning and multilevel Monte Carlo methods for uncertainty quantification

On local Fourier analysis of multigrid methods for PDEs with jumping and random coefficients

In this paper, we propose a novel non-standard Local Fourier Analysis (LFA) variant for accurately predicting the multigrid convergence of problems with random and jumping coefficients. This LFA method is based on a specific basis of the Fourier space rather than the commonly used Fourier modes. To show the utility of this analysis, we consider, as an example, a simple cell-centered multigrid method for solving a steady-state single phase flow problem in a random porous medium. We successfully demonstrate the prediction capability of the proposed LFA using a number of challenging benchmark problems. The information provided by this analysis helps us to estimate a-priori the time needed for solving certain uncertainty quantification problems by means of a multigrid multilevel Monte Carlo method

Markov chain generative adversarial neural networks for solving Bayesian inverse problems in physics applications

In the context of solving inverse problems for physics applications within a Bayesian framework, we present a new approach, the Markov Chain Generative Adversarial Neural Network (MCGAN), to alleviate the computational costs associated with solving the Bayesian inference problem. GANs pose a very suitable framework to aid in the solution of Bayesian inference problems, as they are designed to generate samples from complicated high-dimensional distributions. By training a GAN to sample from a low-dimensional latent space and then embedding it in a Markov Chain Monte Carlo method, we can highly efficiently sample from the posterior, by replacing both the high-dimensional prior and the expensive forward map. This comes at the cost of a potentially expensive offline stage in which training data must be simulated or gathered and the GAN has to be trained. We prove that the proposed methodology converges to the true posterior in the Wasserstein-1 distance and that sampling from the latent space is equivalent to sampling in the high-dimensional space in a weak sense. The method is showcased in two test cases where we perform both state and parameter estimation simultaneously and it is compared with two conventional approaches, polynomial chaos expansion and ensemble Kalman filter, and a deep learning-based approach, deep Bayesian inversion. The method is shown to be more accurate than alternative approaches while also being computationally faster, in multiple test cases, including the important engineering setting of detecting leaks in pipelines

On local Fourier analysis of multigrid methods for PDEs with jumping and random coefficients

In this paper, we propose a novel nonstandard local Fourier analysis (LFA) variant for accurately predicting the multigrid convergence of problems with random and jumping coefficients. This LFA method is based on a specific basis of the Fourier space rather than the commonly used Fourier modes. To show the utility of this analysis, we consider, as an example, a simple cell-centered multigrid method for solving a steady-state single phase flow problem in a random porous medium. We successfully demonstrate the predictive capability of the proposed LFA using a number of challenging benchmark problems. The information provided by this analysis could be used to estimate a priori the time needed for solving certain uncertainty quantification problems by means of a multigrid multilevel Monte Carlo method

Markov chain generative adversarial neural networks for solving Bayesian inverse problems in physics applications

In the context of solving inverse problems for physics applications within a Bayesian framework, we present a new approach, the Markov Chain Generative Adversarial Neural Network (MCGAN), to alleviate the computational costs associated with solving the Bayesian inference problem. GANs pose a very suitable framework to aid in the solution of Bayesian inference problems, as they are designed to generate samples from complicated high-dimensional distributions. By training a GAN to sample from a low-dimensional latent space and then embedding it in a Markov Chain Monte Carlo method, we can highly efficiently sample from the posterior, by replacing both the high-dimensional prior and the expensive forward map. This comes at the cost of a potentially expensive offline stage in which training data must be simulated or gathered and the GAN has to be trained. We prove that the proposed methodology converges to the true posterior in the Wasserstein-1 distance and that sampling from the latent space is equivalent to sampling in the high-dimensional space in a weak sense. The method is showcased in two test cases where we perform both state and parameter estimation simultaneously and it is compared with two conventional approaches, polynomial chaos expansion and ensemble Kalman filter, and a deep learning-based approach, deep Bayesian inversion. The method is shown to be more accurate than alternative approaches while also being computationally faster, in multiple test cases, including the important engineering setting of detecting leaks in pipelines

Markov Chain Generative Adversarial Neural Networks for solving Bayesian inverse problems in physics applications

In the context of solving inverse problems for physics applications within a Bayesian framework, we present a new approach, Markov Chain Generative Adversarial Neural Networks (MCGANs), to alleviate the computational costs associated with solving the Bayesian inference problem. GANs pose a very suitable framework to aid in the solution of Bayesian inference problems, as they are designed to generate samples from complicated high-dimensional distributions. By training a GAN to sample from a low-dimensional latent space and then embedding it in a Markov Chain Monte Carlo method, we can highly efficiently sample from the posterior, by replacing both the high-dimensional prior and the expensive forward map. We prove that the proposed methodology converges to the true posterior in the Wasserstein-1 distance and that sampling from the latent space is equivalent to sampling in the high-dimensional space in a weak sense. The method is showcased on three test cases where we perform both state and parameter estimation simultaneously. The approach is shown to be up to two orders of magnitude more accurate than alternative approaches while also being up to an order of magnitude computationally faster, in several test cases, including the important engineering setting of detecting leaks in pipelines

A multigrid multilevel Monte Carlo method for transport in the Darcy–Stokes system

A multilevel Monte Carlo (MLMC) method for Uncertainty Quantification (UQ) of advection-dominated contaminant transport in a coupled Darcy–Stokes flow system is described. In particular, we focus on high-dimensional epistemic uncertainty due to an unknown permeability field in the Darcy domain that is modelled as a lognormal random field. This paper explores different numerical strategies for the subproblems and suggests an optimal combination for the MLMC estimator. We propose a specific monolithic multigrid algorithm to efficiently solve the steady-state Darcy–Stokes flow with a highly heterogeneous diffusion coefficient. Furthermore, we describe an Alternating Direction Implicit (ADI) based time-stepping for the flux-limited quadratic upwinding discretization for the transport problem. Numerical experiments illustrating the multigrid convergence and cost of the MLMC estimator with respect to the smoothness of permeability field are presented

A multigrid multilevel Monte Carlo method for transport in the Darcy–Stokes system

A multilevel Monte Carlo (MLMC) method for Uncertainty Quantification (UQ) of advection-dominated contaminant transport in a coupled Darcy–Stokes flow system is described. In particular, we focus on high-dimensional epistemic uncertainty due to an unknown permeability field in the Darcy domain that is modelled as a lognormal random field. This paper explores different numerical strategies for the subproblems and suggests an optimal combination for the MLMC estimator. We propose a specific monolithic multigrid algorithm to efficiently solve the steady-state Darcy–Stokes flow with a highly heterogeneous diffusion coefficient. Furthermore, we describe an Alternating Direction Implicit (ADI) based time-stepping for the flux-limited quadratic upwinding discretization for the transport problem. Numerical experiments illustrating the multigrid convergence and cost of the MLMC estimator with respect to the smoothness of permeability field are presented.AerodynamicsNumerical Analysi