Abstract

Civil engineering applications are often characterized by a large uncertainty on the material parameters. Discretization of the underlying equations is typically done by means of the Galerkin Finite Element method. The uncertain material parameter can be expressed as a random field represented by, for example, a Karhunen–Loève expansion. Computation of the stochastic responses, i.e., the expected value and variance of a chosen quantity of interest, remains very costly, even when state-of-the-art Multilevel Monte Carlo (MLMC) is used. A significant cost reduction can be achieved by using a recently developed multilevel method: p-refined Multilevel Quasi-Monte Carlo (p-MLQMC). This method is based on the idea of variance reduction by employing a hierarchical discretization of the problem based on a p-refinement scheme. It is combined with a rank-1 Quasi-Monte Carlo (QMC) lattice rule, which yields faster convergence compared to the use of random Monte Carlo points. In this work, we developed algorithms for the p-MLQMC method for two dimensional problems. The p-MLQMC method is first benchmarked on an academic beam problem. Finally, we use our algorithm for the assessment of the stability of slopes, a problem that arises in geotechnical engineering, and typically suffers from large parameter uncertainty. For both considered problems, we observe a very significant reduction in the amount of computational work with respect to MLMC.

Highlights

  • There is an increasing need to accurately simulate and compute solutions to engineering problems, whilst accounting for model uncertainties

  • In this work we presented a novel multilevel algorithm, p-refined Multilevel Quasi-Monte Carlo

  • We described two algorithms necessary for p-refined Multilevel Quasi-Monte Carlo (p-Multilevel Quasi-Monte Carlo (MLQMC)), the sample algorithm itself and an algorithm which returns the location of the points where the discrete values of the random field are to be computed

Read more

Summary

Introduction

There is an increasing need to accurately simulate and compute solutions to engineering problems, whilst accounting for model uncertainties. We mention that there exist hybrid variants which exhibit both a sampling and non-sampling character This type of methods combine, for example, the Stochastic Finite Element methodology with Monte Carlo sampling or a multi-dimensional cubature method, see, e.g., [12,13]. We will present a novel multilevel method: p-refined Multilevel Quasi-Monte Carlo (p-MLQMC). This method reduces the cost of the simulation by taking samples on a hierarchy of nested p-refined meshes, and by selecting the sample points in a non-random way. We conclude with a general complexity theorem for ML(Q)MC sampling

The Multilevel and Multilevel Quasi Monte Carlo Methods
Mesh Hierarchies
Algorithm
Cost Complexity Theorem
Modeling the Spatial Variability
Incorporating the Uncertainty in the Model
Model Problems and Numerical Results
Description
Finite Element Method
Mesh Discretization
Quantity of Interest
Numerical Results for Model Problem 1
Number of Samples
Uncertainty Propagation in the Solution
Runtime
Level Adaptivity
Numerical Results for Model Problem 2
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call