Weighted integration over a hyperrectangle based on digital nets and sequences
DOI10.1016/J.CAM.2021.113509zbMATH Open1467.65019arXiv2009.06993OpenAlexW3134385888MaRDI QIDQ2020573FDOQ2020573
Friedrich Pillichshammer, Josef Dick
Publication date: 23 April 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.06993
Recommendations
- Quasi–Monte Carlo integration over $\mathbb {R}^d$
- Quasi–Monte Carlo Numerical Integration on $\mathbb{R}^s$: Digital Nets and Worst-Case Error
- Quasi-Monte Carlo algorithms for unbounded, weighted integration problems
- High-dimensional integration: The quasi-Monte Carlo way
- scientific article; zbMATH DE number 1790428
numerical integrationquasi-Monte Carlotractabilityworst-case errordigital netpolynomial lattice point set
Monte Carlo methods (65C05) Numerical integration (65D30) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Title not available (Why is that?)
- Introduction to Quasi-Monte Carlo Integration and Applications
- Title not available (Why is that?)
- Quasi-Monte Carlo Finite Element Methods for a Class of Elliptic Partial Differential Equations with Random Coefficients
- Low-discrepancy and low-dispersion sequences
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Low-discrepancy point sets obtained by digital constructions over finite fields
- Tractability of multivariate problems. Volume III: Standard information for operators
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
- Higher Order QMC Petrov--Galerkin Discretization for Affine Parametric Operator Equations with Random Field Inputs
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- High-dimensional integration: The quasi-Monte Carlo way
- Point sets and sequences with small discrepancy
- Title not available (Why is that?)
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- A constructive approach to strong tractability using quasi-Monte Carlo algorithms
- Quasi-Monte Carlo methods for high-dimensional integration: the standard (weighted Hilbert space) setting and beyond
- Construction algorithms for polynomial lattice rules for multivariate integration
- Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
- Strong tractability of multivariate integration using quasi–Monte Carlo algorithms
- Fast CBC construction of randomly shifted lattice rules achieving \(\mathcal{O}(n^{- 1 + \delta})\) convergence for unbounded integrands over \(\mathbb{R}^s\) in weighted spaces with POD weights
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- On the mean square weighted L2discrepancy of randomized digital (t,m,s)-nets over Z2
- Quasi-Monte Carlo for highly structured generalised response models
- Tusnády's problem, the transference principle, and non-uniform QMC sampling
Cited In (2)
This page was built for publication: Weighted integration over a hyperrectangle based on digital nets and sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020573)