Recent advances in higher order quasi-Monte Carlo methods
arXiv:1903.12353 · doi:10.1515/9783110652581-004
Abstract
In this article we review some of recent results on higher order quasi-Monte Carlo (HoQMC) methods. After a seminal work by Dick (2007, 2008) who originally introduced the concept of HoQMC, there have been significant theoretical progresses on HoQMC in terms of discrepancy as well as multivariate numerical integration. Moreover, several successful and promising applications of HoQMC to partial differential equations with random coefficients and Bayesian estimation/inversion problems have been reported recently. In this article we start with standard quasi-Monte Carlo methods based on digital nets and sequences in the sense of Niederreiter, and then move onto their higher order version due to Dick. The Walsh analysis of smooth functions plays a crucial role in developing the theory of HoQMC, and the aim of this article is to provide a unified picture on how the Walsh analysis enables recent developments of HoQMC both for discrepancy and numerical integration.
References in corpus (13)
- Walsh spaces containing smooth functions and quasi-Monte Carlo rules of arbitrary high order
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
- The role of Frolov's cubature formula for functions with bounded mixed derivative
- Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube
- Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces
- Optimal order quasi-Monte Carlo integration in weighted Sobolev spaces of arbitrary smoothness
- Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions
- An explicit construction of optimal order quasi-Monte Carlo rules for smooth integrands
- Optimal order quadrature error bounds for infinite-dimensional higher order digital sequences
- Richardson extrapolation of polynomial lattice rules
- Formulas for the Walsh coefficients of smooth functions and their application to bounds on the Walsh coefficients
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions
- Richardson extrapolation allows truncation of higher order digital nets and sequences