Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy

DOI10.1137/040604662zbMath1084.11040OpenAlexW2044605222MaRDI QIDQ5700259

Gunther Leobacher, Josef Dick, Friedrich Pillichshammer

Publication date: 28 October 2005

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040604662

zbMATH Keywords

component-by-component algorithmdigital netweighted star discrepancy

Mathematics Subject Classification ID

Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38)

Related Items (16)

The weighted star discrepancy of Korobov’s $p$-sets ⋮ Construction algorithms for good extensible lattice rules ⋮ The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers ⋮ Construction of interlaced scrambled polynomial lattice rules of arbitrary high order ⋮ Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ A lower bound on a quantity related to the quality of polynomial lattices ⋮ Tractability properties of the weighted star discrepancy of the Halton sequence ⋮ A note on \((s,t)\)-weak tractability of the weighted star discrepancy of regular grids ⋮ Constructions of general polynomial lattice rules based on the weighted star discrepancy ⋮ Tractability properties of the weighted star discrepancy of regular grids ⋮ Tractability results for the weighted star-discrepancy ⋮ The construction of extensible polynomial lattice rules with small weighted star discrepancy ⋮ Weighted integration over a hyperrectangle based on digital nets and sequences ⋮ Constructions of general polynomial lattices for multivariate integration ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration

This page was built for publication: Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy