A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
From MaRDI portal
Publication:2903013
DOI10.1137/110833865zbMath1271.65003OpenAlexW2123331303MaRDI QIDQ2903013
Michael Gnewuch, Magnus Wahlström, Carola Winzen
Publication date: 23 August 2012
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110833865
Monte Carlo methods (65C05) Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20) Irregularities of distribution, discrepancy (11K38)
Related Items (10)
Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions ⋮ Entropy, Randomization, Derandomization, and Discrepancy ⋮ The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers ⋮ A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy ⋮ A nonlocal functional promoting low-discrepancy point sets ⋮ Octagonal symmetry in low-discrepancy β-manganese ⋮ Measures of uniformity in experimental designs: A selective overview ⋮ A random walk algorithm to estimate a lower bound of the star discrepancy ⋮ Calculation of Discrepancy Measures and Applications ⋮ Uniform point sets and the collision test
This page was built for publication: A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
