Search

We analyze the convergence rate of a multilevel quasi-Monte Carlo (MLQMC) Finite Element Method (FEM) for a scalar diffusion equation with log-Gaussian, isotropic coefficients in a bounded, polytopal domain D ⊂ ℝd. The multilevel algorithm QL* which we analyze here was first proposed, in the case of parametric PDEs with sequences of independent, uniformly distributed parameters in Kuo et al. (Found. Comput. Math. 15 (2015) 411–449). The random coefficient is assumed to admit a representation with locally supported coefficient functions, as arise for example in spline- or multiresolution representations of the input random field. The present analysis builds on and generalizes our single-level analysis in Herrmann and Schwab (Numer. Math. 141 (2019) 63–102). It also extends the MLQMC error analysis in Kuo et al. (Math. Comput. 86 (2017) 2827–2860), to locally supported basis functions in the representation of the Gaussian random field (GRF) in D, and to product weights in QMC integration. In particular, in polytopal domains D ⊂ ℝd, d=2,3, our analysis is based on weighted function spaces to describe solution regularity with respect to the spatial coordinates. These spaces allow GRFs and PDE solutions whose realizations become singular at edges and vertices of D. This allows for non-stationary GRFs whose covariance operators and associated precision operator are fractional powers of elliptic differential operators in D with boundary conditions on ∂D. In the weighted function spaces in D, first order, Lagrangian Finite Elements on regular, locally refined, simplicial triangulations of D yield optimal asymptotic convergence rates. Comparison of the ε-complexity for a class of Matérn-like GRF inputs indicates, for input GRFs with low sample regularity, superior performance of the present MLQMC-FEM with locally supported representation functions over alternative representations, e.g. of Karhunen–Loève type. Our analysis yields general bounds for the ε-complexity of the MLQMC algorithm, uniformly with respect to the dimension of the parameter space.

We survey the numerical analysis of a class of deterministic, higher-order QMC integration methods in forward and inverse uncertainty quantification algorithms for advection-diffusion-reaction (ADR) equations in polygonal domains D⊂R2 with distributed uncertain inputs. We admit spatially heterogeneous material properties. For the parametrization of the uncertainty, we assume at hand systems of functions which are locally supported in D. Distributed uncertain inputs are written in countably parametric, deterministic form with locally supported representation systems. Parametric regularity and sparsity of solution families and of response functions in scales of weighted Kontrat’ev spaces in D are quantified using analytic continuation. ISSN:2194-1009 ISSN:2194-1017

For the numerical solution of linear systems that arise from discretized linear partial differential equations, multigrid and domain decomposition methods are well established. Multigrid methods are known to have optimal complexity and domain decomposition methods are in particular useful for parallelization of the implemented algorithm. For linear random operator equations, the classical theory is not directly applicable, since condition numbers of system matrices may be close to degenerate due to non-uniform random input. It is shown that iterative methods converge in the strong, i.e. $$L^p$$, sense if the random input satisfies certain integrability conditions. As a main result, standard multigrid and domain decomposition methods are applicable in the case of linear elliptic partial differential equations with lognormal diffusion coefficients and converge strongly with deterministic bounds on the computational work which are essentially optimal. This enables the application of multilevel Monte Carlo methods with rigorous, deterministic bounds on the computational work.

Numerical solutions of stationary diffusion equations on the unit sphere with isotropic lognormal diffusion coefficients are considered. H\"older regularity in $L^p$ sense for isotropic Gaussian random fields is obtained and related to the regularity of the driving lognormal coefficients. This yields regularity in $L^p$ sense of the solution to the diffusion problem in Sobolev spaces. Convergence rate estimates of multilevel Monte Carlo Finite and Spectral Element discretizations of these problems are then deduced. Specifically, a convergence analysis is provided with convergence rate estimates in terms of the number of Monte Carlo samples of the solution to the considered diffusion equation and in terms of the total number of degrees of freedom of the spatial discretization, and with bounds for the total work required by the algorithm in the case of Finite Element discretizations. The obtained convergence rates are solely in terms of the decay of the angular power spectrum of the (logarithm) of the diffusion coefficient. Numerical examples confirm the presented theory., Comment: 35 pages, 1 figure; rewritten Sections 2 and 3, added numerical experiments

We analyze convergence rates of first-order quasi--Monte Carlo (QMC) integration with randomly shifted lattice rules and for higher-order, interlaced polynomial lattice rules for a class of countably parametric integrands that result from linear functionals of solutions of linear, elliptic diffusion equations with affine-parametric, uncertain coefficient function $a(x,{y}) = \bar{a}(x) + \sum_{j\geq 1} y_j \psi_j(x)$ in a bounded domain $D\subset \mathbb{R}^d$. Extending the result in [F. Y. Kuo, C. Schwab, and I. H. Sloan, SIAM J. Numer. Anal., 50 (2012), pp. 3351--3374], where $\psi_j$ was assumed to have global support in the domain $D$, we assume in the present paper that ${supp}(\psi_j)$ is localized in $D$ and that we have control on the overlaps of these supports. Under these conditions we prove dimension-independent convergence rates in [1/2,1) of randomly shifted lattice rules with product weights and corresponding higher-order convergence rates by higher-order, interlaced polynomial lattice rule...