scholarly journals Computational Higher Order Quasi-Monte Carlo Integration

2016 ◽  
pp. 271-288 ◽  
Author(s):  
Robert N. Gantner ◽  
Christoph Schwab
Keyword(s):  
Monte Carlo ◽  
Higher Order ◽  
Monte Carlo Integration ◽  
Quasi Monte Carlo

Higher order Quasi-Monte Carlo integration for Bayesian PDE Inversion

2019 ◽  
Vol 77 (1) ◽  
pp. 144-172 ◽  
Author(s):  
Josef Dick ◽  
Robert N. Gantner ◽  
Quoc T. Le Gia ◽  
Christoph Schwab
Keyword(s):  
Monte Carlo ◽  
Higher Order ◽  
Monte Carlo Integration ◽  
Quasi Monte Carlo

scholarly journals Multilevel higher-order quasi-Monte Carlo Bayesian estimation

2017 ◽  
Vol 27 (05) ◽  
pp. 953-995 ◽  
Author(s):  
Josef Dick ◽  
Robert N. Gantner ◽  
Quoc T. Le Gia ◽  
Christoph Schwab
Keyword(s):  
Monte Carlo ◽  
Bayesian Estimation ◽  
Convergence Rates ◽  
Applied Mathematics ◽  
Higher Order ◽  
Forward Problem ◽  
Monte Carlo Integration ◽  
High Dimensional ◽  
Operator Equations ◽  
Quasi Monte Carlo

We propose and analyze deterministic multilevel (ML) approximations for Bayesian inversion of operator equations with uncertain distributed parameters, subject to additive Gaussian measurement data. The algorithms use a ML approach based on deterministic, higher-order quasi-Monte Carlo (HoQMC) quadrature for approximating the high-dimensional expectations, which arise in the Bayesian estimators, and a Petrov–Galerkin (PG) method for approximating the solution to the underlying partial differential equation (PDE). This extends the previous single-level (SL) approach from [J. Dick, R. N. Gantner, Q. T. Le Gia and Ch. Schwab, Higher order quasi-Monte Carlo integration for Bayesian estimation, Report 2016-13, Seminar for Applied Mathematics, ETH Zürich (in review)]. Compared to the SL approach, the present convergence analysis of the ML method requires stronger assumptions on holomorphy and regularity of the countably-parametric uncertainty-to-observation maps of the forward problem. As in the SL case and in the affine-parametric case analyzed in [J. Dick, F. Y. Kuo, Q. T. Le Gia and Ch. Schwab, Multi-level higher order QMC Galerkin discretization for affine parametric operator equations, SIAM J. Numer. Anal. 54 (2016) 2541–2568], we obtain sufficient conditions which allow us to achieve arbitrarily high, algebraic convergence rates in terms of work, which are independent of the dimension of the parameter space. The convergence rates are limited only by the spatial regularity of the forward problem, the discretization order achieved by the PG discretization, and by the sparsity of the uncertainty parametrization. We provide detailed numerical experiments for linear elliptic problems in two space dimensions, with [Formula: see text] parameters characterizing the uncertain input, confirming the theory and showing that the ML HoQMC algorithms can outperform, in terms of error versus computational work, both multilevel Monte Carlo (MLMC) methods and SL HoQMC methods, provided the parametric solution maps of the forward problems afford sufficient smoothness and sparsity of the high-dimensional parameter spaces.

scholarly journals MDFEM: Multivariate decomposition finite element method for elliptic PDEs with lognormal diffusion coefficients using higher-order QMC and FEM

2021 ◽  
Author(s):  
Dong T.P. Nguyen ◽  
Dirk Nuyens
Keyword(s):  
Finite Element Method ◽  
Finite Element ◽  
Monte Carlo ◽  
Convergence Rates ◽  
Higher Order ◽  
Elliptic Pdes ◽  
Infinite Dimensional ◽  
Quasi Monte Carlo ◽  
Higher Order Convergence ◽  
Element Method

We introduce the \emph{multivariate decomposition finite element method} (MDFEM) for elliptic PDEs with lognormal diffusion coefficients, that is, when the diffusion coefficient has the form $a=\exp(Z)$ where $Z$ is a Gaussian random field defined by an infinite series expansion $Z(\bsy) = \sum_{j \ge 1} y_j \, \phi_j$ with $y_j \sim \calN(0,1)$ and a given sequence of functions $\{\phi_j\}_{j \ge 1}$. We use the MDFEM to approximate the expected value of a linear functional of the solution of the PDE which is an infinite-dimensional integral over the parameter space. The proposed algorithm uses the \emph{multivariate decomposition method} (MDM) to compute the infinite-dimensional integral by a decomposition into finite-dimensional integrals, which we resolve using \emph{quasi-Monte Carlo} (QMC) methods, and for which we use the \emph{finite element method} (FEM) to solve different instances of the PDE.   We develop higher-order quasi-Monte Carlo rules for integration over the finite-di\-men\-si\-onal Euclidean space with respect to the Gaussian distribution by use of a truncation strategy. By linear transformations of interlaced polynomial lattice rules from the unit cube to a multivariate box of the Euclidean space we achieve higher-order convergence rates for functions belonging to a class of \emph{anchored Gaussian Sobolev spaces} while taking into account the truncation error. These cubature rules are then used in the MDFEM algorithm.   Under appropriate conditions, the MDFEM achieves higher-order convergence rates in term of error versus cost, i.e., to achieve an accuracy of $O(\epsilon)$ the computational cost is $O(\epsilon^{-1/\lambda-\dd/\lambda}) = O(\epsilon^{-(p^* + \dd/\tau)/(1-p^*)})$ where $\epsilon^{-1/\lambda}$ and $\epsilon^{-\dd/\lambda}$ are respectively the cost of the quasi-Monte Carlo cubature and the finite element approximations, with $\dd = d \, (1+\ddelta)$ for some $\ddelta \ge 0$ and $d$ the physical dimension, and $0 < p^* \le (2 + \dd/\tau)^{-1}$ is a parameter representing the sparsity of $\{\phi_j\}_{j \ge 1}$.

Quasi-Monte Carlo Integration

1995 ◽  
Vol 122 (2) ◽  
pp. 218-230 ◽  
Author(s):  
William J. Morokoff ◽  
Russel E. Caflisch
Keyword(s):  
Monte Carlo ◽  
Monte Carlo Integration ◽  
Quasi Monte Carlo
Sign in / Sign up

Export Citation Format

Share Document