arXiv subjects

Joakim Beck

Publications and source records attributed to Joakim Beck.

8 recordsLinked to original sources

arXiv2025

Goal-Oriented Adaptive Finite Element Multilevel Quasi-Monte Carlo

The efficient approximation of quantities of interest derived from PDEs with lognormal diffusivity is a central challenge in uncertainty quantification. This paper targets a problem class that combines four analytical difficulties: a geometric boundary singularity, a lognormal coefficient field without a deterministic positive lower bound, sample-dependent mesh selection that introduces parameter-space discontinuities, and infinitely many discontinuity locations that preclude classical pre-integration smoothing. In this study, we propose a multilevel quasi-Monte Carlo framework to approximate deterministic, real-valued, bounded linear functionals that depend on the solution of a linear elliptic PDE with a lognormal diffusivity coefficient parameterized by a multi-dimensional Gaussian random vector and deterministic geometric singularities in bounded domains of $\mathbb{R}^d$. We analyze the parametric regularity and develop the multilevel implementation based on a sequence of adaptive meshes, developed in our earlier work "Goal-oriented adaptive finite element multilevel Monte Carlo with convergence rates", CMAME, 402 (2022), p. 115582. For further variance reduction, we incorporate importance sampling and introduce a level-0 control variate within the multilevel hierarchy. Introducing such a control variate can alter the optimal choice for the initial mesh, further highlighting the advantages of adaptive meshes. On a 2-D slit benchmark discretized with bilinear, quadrilateral Q1-FEM, numerical experiments show that, in the parameter range explored, the proposed adaptive MLQMC algorithm achieves a prescribed accuracy at markedly lower computational cost than a standard multilevel Monte Carlo estimator on the same mesh hierarchy.

math.NA↗

arXiv2022

Goal-Oriented Adaptive Finite Element Multilevel Monte Carlo with Convergence Rates

We present an adaptive multilevel Monte Carlo (AMLMC) algorithm for approximating deterministic, real-valued, bounded linear functionals that depend on the solution of a linear elliptic PDE with a lognormal diffusivity coefficient and geometric singularities in bounded domains of $\mathbb{R}^d$. Our AMLMC algorithm is built on the results of the weak convergence rates in the work [Moon et al., BIT Numer. Math., 46 (2006), 367-407] for an adaptive algorithm using isoparametric d-linear quadrilateral finite element approximations and the dual weighted residual error representation in a deterministic setting. Designed to suit the geometric nature of the singularities in the solution, our AMLMC algorithm uses a sequence of deterministic, non-uniform auxiliary meshes as a building block. The deterministic adaptive algorithm generates these meshes, corresponding to a geometrically decreasing sequence of tolerances. For a given realization of the diffusivity coefficient and accuracy level, AMLMC constructs its approximate sample using the first mesh in the hierarchy that satisfies the corresponding bias accuracy constraint. This adaptive approach is particularly useful for the lognormal case treated here, which lacks uniform coercivity and thus produces functional outputs that vary over orders of magnitude when sampled. We discuss iterative solvers and compare their efficiency with direct ones. To reduce computational work, we propose a stopping criterion for the iterative solver with respect to the quantity of interest, the realization of the diffusivity coefficient, and the desired level of AMLMC approximation. From the numerical experiments, based on a Fourier expansion of the coefficient field, we observe improvements in efficiency compared with both standard Monte Carlo and standard MLMC for a problem with a singularity similar to that at the tip of a slit modeling a crack.

math.NA↗

arXiv2020

Multilevel Double Loop Monte Carlo and Stochastic Collocation Methods with Importance Sampling for Bayesian Optimal Experimental Design

An optimal experimental set-up maximizes the value of data for statistical inferences and predictions. The efficiency of strategies for finding optimal experimental set-ups is particularly important for experiments that are time-consuming or expensive to perform. For instance, in the situation when the experiments are modeled by Partial Differential Equations (PDEs), multilevel methods have been proven to dramatically reduce the computational complexity of their single-level counterparts when estimating expected values. For a setting where PDEs can model experiments, we propose two multilevel methods for estimating a popular design criterion known as the expected information gain in simulation-based Bayesian optimal experimental design. The expected information gain criterion is of a nested expectation form, and only a handful of multilevel methods have been proposed for problems of such form. We propose a Multilevel Double Loop Monte Carlo (MLDLMC), which is a multilevel strategy with Double Loop Monte Carlo (DLMC), and a Multilevel Double Loop Stochastic Collocation (MLDLSC), which performs a high-dimensional integration by deterministic quadrature on sparse grids. For both methods, the Laplace approximation is used for importance sampling that significantly reduces the computational work of estimating inner expectations. The optimal values of the method parameters are determined by minimizing the average computational work, subject to satisfying the desired error tolerance. The computational efficiencies of the methods are demonstrated by estimating the expected information gain for Bayesian inference of the fiber orientation in composite laminate materials from an electrical impedance tomography experiment. MLDLSC performs better than MLDLMC when the regularity of the quantity of interest, with respect to the additive noise and the unknown parameters, can be exploited.

math.NA↗

arXiv2019

Multilevel Monte Carlo Acceleration of Seismic Wave Propagation under Uncertainty

We interpret uncertainty in a model for seismic wave propagation by treating the model parameters as random variables, and apply the Multilevel Monte Carlo (MLMC) method to reduce the cost of approximating expected values of selected, physically relevant, quantities of interest (QoI) with respect to the random variables. Targeting source inversion problems, where the source of an earthquake is inferred from ground motion recordings on the Earth's surface, we consider two QoI that measure the discrepancies between computed seismic signals and given reference signals: one QoI, $\hbox{QoI}_E$, is defined in terms of the $L^2$-misfit, which is directly related to maximum likelihood estimates of the source parameters; the other, $\hbox{QoI}_W$, is based on the quadratic Wasserstein distance between probability distributions, and represents one possible choice in a class of such misfit functions that have become increasingly popular to solve seismic inversion in recent years. We simulate seismic wave propagation, including seismic attenuation, using a publicly available code in widespread use, based on the spectral element method. Using random coefficients and deterministic initial and boundary data, we present benchmark numerical experiments with synthetic data in a two-dimensional physical domain and a one-dimensional velocity model where the assumed parameter uncertainty is motivated by realistic Earth models. Here, the computational cost of the standard Monte Carlo method was reduced by up to 97% for $\hbox{QoI}_E$, and up to 78% for $\hbox{QoI}_W$, using a relevant range of tolerances. Shifting to three-dimensional domains is straight-forward and will further increase the relative computational work reduction.

math.NA↗

arXiv2018

IGA-based Multi-Index Stochastic Collocation for random PDEs on arbitrary domains

This paper proposes an extension of the Multi-Index Stochastic Collocation (MISC) method for forward uncertainty quantification (UQ) problems in computational domains of shape other than a square or cube, by exploiting isogeometric analysis (IGA) techniques. Introducing IGA solvers to the MISC algorithm is very natural since they are tensor-based PDE solvers, which are precisely what is required by the MISC machinery. Moreover, the combination-technique formulation of MISC allows the straight-forward reuse of existing implementations of IGA solvers. We present numerical results to showcase the effectiveness of the proposed approach.

math.NA↗

arXiv2017

Fast Bayesian experimental design: Laplace-based importance sampling for the expected information gain

In calculating expected information gain in optimal Bayesian experimental design, the computation of the inner loop in the classical double-loop Monte Carlo requires a large number of samples and suffers from underflow if the number of samples is small. These drawbacks can be avoided by using an importance sampling approach. We present a computationally efficient method for optimal Bayesian experimental design that introduces importance sampling based on the Laplace method to the inner loop. We derive the optimal values for the method parameters in which the average computational cost is minimized according to the desired error tolerance. We use three numerical examples to demonstrate the computational efficiency of our method compared with the classical double-loop Monte Carlo, and a more recent single-loop Monte Carlo method that uses the Laplace method as an approximation of the return value of the inner loop. The first example is a scalar problem that is linear in the uncertain parameter. The second example is a nonlinear scalar problem. The third example deals with the optimal sensor placement for an electrical impedance tomography experiment to recover the fiber orientation in laminate composites.

math.NA↗

arXiv2017

A sparse-grid isogeometric solver

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

math.NA↗

arXiv2015

Sequential Design with Mutual Information for Computer Experiments (MICE): Emulation of a Tsunami Model

Computer simulators can be computationally intensive to run over a large number of input values, as required for optimization and various uncertainty quantification tasks. The standard paradigm for the design and analysis of computer experiments is to employ Gaussian random fields to model computer simulators. Gaussian process models are trained on input-output data obtained from simulation runs at various input values. Following this approach, we propose a sequential design algorithm, MICE (Mutual Information for Computer Experiments), that adaptively selects the input values at which to run the computer simulator, in order to maximize the expected information gain (mutual information) over the input space. The superior computational efficiency of the MICE algorithm compared to other algorithms is demonstrated by test functions, and a tsunami simulator with overall gains of up to 20% in that case.

stat.CO↗