Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
From MaRDI portal
Recommendations
- Constructions of general polynomial lattice rules based on the weighted star discrepancy
- A reduced fast construction of polynomial lattice point sets with low weighted star discrepancy
- Low-discrepancy point sets
- Discrepancy of hyperplane nets and cyclic nets
- Construction algorithms for polynomial lattice rules for multivariate integration
Cited in
(27)- Low-discrepancy point sets
- Tractability properties of the weighted star discrepancy of the Halton sequence
- A reduced fast construction of polynomial lattice point sets with low weighted star discrepancy
- Tractability properties of the weighted star discrepancy of regular grids
- A note on \((s,t)\)-weak tractability of the weighted star discrepancy of regular grids
- Weighted integration over a hyperrectangle based on digital nets and sequences
- Tractability results for the weighted star-discrepancy
- On some remarkable properties of the two-dimensional Hammersley point set in base 2
- An explicit construction of point sets with large minimum Dick weight
- Constructions of general polynomial lattice rules based on the weighted star discrepancy
- The inverse of the star-discrepancy problem and the generation of pseudo-random numbers
- A reduced fast component-by-component construction of lattice point sets with small weighted star discrepancy
- Discrepancy of hyperplane nets and cyclic nets
- The weighted star discrepancy of Korobov’s p-sets
- The construction of extensible polynomial lattice rules with small weighted star discrepancy
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy
- Low-discrepancy point sets obtained by digital constructions over finite fields
- Discrepancy theory and quasi-Monte Carlo integration
- scientific article; zbMATH DE number 5049855 (Why is no real title available?)
- Constructions of general polynomial lattices for multivariate integration
- A Universal Median Quasi-Monte Carlo Integration
- A lower bound on a quantity related to the quality of polynomial lattices
- Quasi-Monte Carlo integration over \(\mathbb{R}^s\) based on digital nets
- Conditions for tractability of the weighted L_p-discrepancy and integration in non-homogeneous tensor product spaces
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- Construction algorithms for good extensible lattice rules
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
This page was built for publication: Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5700259)
