An algorithm to compute bounds for the star discrepancy
From MaRDI portal
Publication:1347864
DOI10.1006/jcom.2001.0600zbMath0995.65002OpenAlexW1964678795MaRDI QIDQ1347864
Publication date: 23 October 2002
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1d701bb01bf4919f466352e4d30b69048ba536c9
Related Items (20)
Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy ⋮ Entropy, Randomization, Derandomization, and Discrepancy ⋮ Smart sampling and incremental function learning for very large high dimensional data ⋮ A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy ⋮ Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension ⋮ Replication procedure for grouped Sobol' indices estimation in dependent uncertainty spaces ⋮ Component-by-component construction of low-discrepancy point sets of small size ⋮ Statistical measures of two dimensional point set uniformity ⋮ Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy ⋮ Algorithmic construction of low-discrepancy point sets via dependent randomized rounding ⋮ A note on E. Thiémard's algorithm to compute bounds for the star discrepancy ⋮ A genetic algorithm approach to estimate lower bounds of the star discrepancy ⋮ A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy ⋮ Measures of uniformity in experimental designs: A selective overview ⋮ Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems ⋮ Coverage-guided test generation for continuous and hybrid systems ⋮ A computational investigation of the optimal Halton sequence in QMC applications ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point sets and sequences with small discrepancy
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Decomposable searching problems
- Multidimensional quasi-Monte Carlo methods
- Computing bounds for the star discrepancy
- Discrepancy and convex programming
- Algorithm 659
- An economic method of computing LPτ-sequences
- Discrépance de suites associées à un système de numération (en dimension s)
- Quasi-Random Sequences and Their Discrepancies
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- The inverse of the star-discrepancy depends linearly on the dimension
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
- On the distribution of points in a cube and the approximate evaluation of integrals
- On irregularities of distribution
This page was built for publication: An algorithm to compute bounds for the star discrepancy
