A note on E. Thiémard's algorithm to compute bounds for the star discrepancy

DOI10.1016/j.jco.2004.05.004zbMath1076.65005OpenAlexW2027979617WikidataQ57778937 ScholiaQ57778937MaRDI QIDQ558008

Ronald Cools, Tim Pillards

Publication date: 30 June 2005

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2004.05.004

zbMATH Keywords

DiscrepancyQuasi-Monte Carlo methodThiémard's algorithm

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Irregularities of distribution, discrepancy (11K38)

Related Items (5)

Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy ⋮ A genetic algorithm approach to estimate lower bounds of the star discrepancy ⋮ Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems ⋮ A computational investigation of the optimal Halton sequence in QMC applications ⋮ Calculation of Discrepancy Measures and Applications

Cites Work

• An algorithm to compute bounds for the star discrepancy

This page was built for publication: A note on E. Thiémard's algorithm to compute bounds for the star discrepancy