Strong tractability of integration using scrambled Niederreiter points
From MaRDI portal
Publication:5315422
DOI10.1090/S0025-5718-05-01755-2zbMATH Open1079.65011MaRDI QIDQ5315422FDOQ5315422
Authors: Rong-Xian Yue, Fred J. Hickernell
Publication date: 8 September 2005
Published in: Mathematics of Computation (Search for Journal in Brave)
Recommendations
- Error analysis on scrambled quasi-Monte Carlo quadrature rules using Sobol points
- Strong Tractability of Quasi‐Monte Carlo Quadrature Using Nets for Certain Banach Spaces
- Strong tractability of multivariate integration using quasi–Monte Carlo algorithms
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- Scrambled polynomial lattice rules for infinite-dimensional integration
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monte Carlo Variance of Scrambled Net Quadrature
- Low-discrepancy and low-dispersion sequences
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Tractability of multivariate integration for periodic functions
- Integration and approximation in arbitrary dimensions
- Scrambling Sobol' and Niederreiter-Xing points
- Scrambled net variance for integrals of smooth functions
- A constructive approach to strong tractability using quasi-Monte Carlo algorithms
- The mean square discrepancy of randomized nets
- Strong tractability of multivariate integration using quasi–Monte Carlo algorithms
- The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
- Tractability of multivariate integration for weighted Korobov classes
- Quasi-Monte Carlo methods can be efficient for integration over products of spheres
- Title not available (Why is that?)
- The price of pessimism for multidimensional quadrature
- On the variance of quadrature over scrambled nets and sequences
- Title not available (Why is that?)
- Optimal quadrature for Haar wavelet spaces
- The Mean Square Discrepancy of Scrambled (t,s)-Sequences
- The microstructure of \((t,m,s)\)-nets
- The asymptotic efficiency of randomized nets for quadrature
- Title not available (Why is that?)
- Integration and approximation based on scramble sampling in arbitrary dimensions
Cited In (10)
- A construction of polynomial lattice rules with small gain coefficients
- Strong Tractability of Quasi‐Monte Carlo Quadrature Using Nets for Certain Banach Spaces
- Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration
- Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Optimal quadrature for Haar wavelet spaces
- Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate
- Integration and approximation based on scramble sampling in arbitrary dimensions
- Scrambled polynomial lattice rules for infinite-dimensional integration
- Error analysis on scrambled quasi-Monte Carlo quadrature rules using Sobol points
- Scrambling Sobol' and Niederreiter-Xing points
This page was built for publication: Strong tractability of integration using scrambled Niederreiter points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315422)