Scrambled geometric net integration over general product spaces
From MaRDI portal
Publication:2397747
Abstract: Quasi-Monte Carlo (QMC) sampling has been developed for integration over where it has superior accuracy to Monte Carlo (MC) for integrands of bounded variation. Scrambled net quadrature gives allows replication based error estimation for QMC with at least the same accuracy and for smooth enough integrands even better accuracy than plain QMC. Integration over triangles, spheres, disks and Cartesian products of such spaces is more difficult for QMC because the induced integrand on a unit cube may fail to have the desired regularity. In this paper, we present a construction of point sets for numerical integration over Cartesian products of spaces of dimension , with triangles () being of special interest. The point sets are transformations of randomized -nets using recursive geometric partitions. The resulting integral estimates are unbiased and their variance is for any integrand in of the product space. Under smoothness assumptions on the integrand, our randomized QMC algorithm has variance , for integration over -fold Cartesian products of -dimensional domains, compared to for ordinary Monte Carlo.
Recommendations
- Scrambled net variance for integrals of smooth functions
- Scrambling Sobol' and Niederreiter-Xing points
- On the variance of quadrature over scrambled nets and sequences
- Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands
- Local antithetic sampling with scrambled nets
Cites work
- scientific article; zbMATH DE number 5797591 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 578461 (Why is no real title available?)
- scientific article; zbMATH DE number 3444159 (Why is no real title available?)
- scientific article; zbMATH DE number 822320 (Why is no real title available?)
- scientific article; zbMATH DE number 3019347 (Why is no real title available?)
- A Koksma–Hlawka Inequality for Simplices
- A component-by-component approach to efficient numerical integration over products of spheres
- A general rule for disk and hemisphere partition into equal-area cells
- Geometric discrepancy. An illustrated guide
- Local antithetic sampling with scrambled nets
- Low discrepancy constructions in the triangle
- Monte Carlo Variance of Scrambled Net Quadrature
- Multidimensional variation for quasi-Monte Carlo
- On the asymptotic distribution of scrambled net quadrature.
- Point sets and sequences with small discrepancy
- Quasi-Monte Carlo for integrands with point singularities at unknown locations
- Quasi-Monte Carlo image synthesis in a nutshell
- Quasi-Monte Carlo methods can be efficient for integration over products of spheres
- Quasi-Monte Carlo methods in financial engineering: an equivalence principle and dimension reduction
- Quasi-Monte Carlo tractability of high dimensional integration over products of simplices
- Scrambled net variance for integrals of smooth functions
- Scrambling Sobol' and Niederreiter-Xing points
- The distribution of the discrepancy of scrambled digital (\(t\),\(m\),\(s\))-nets
- Variance with alternative scramblings of digital nets
Cited in
(7)- Asymptotic normality of extensible grid sampling
- Quasi-Monte Carlo integration using digital nets with antithetics
- On integration methods based on scrambled nets of arbitrary size
- Quasi-Monte Carlo tractability of high dimensional integration over products of simplices
- Low discrepancy constructions in the triangle
- Asymptotic normality of scrambled geometric net quadrature
- Randomized quasi-Monte Carlo methods on triangles: extensible lattices and sequences
This page was built for publication: Scrambled geometric net integration over general product spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397747)