An algorithm to compute bounds for the star discrepancy
From MaRDI portal
The author propose an algorithm to compute the upper and lower bounds of the so-called star discrepancy of an arbitrary sequence of \(n\) points in the \(s\)-dimensional unit cube. [For the definition of star discrepancy or discrepancy, see for example, \textit{L. K. Hua} and \textit{Y. Wang}, Application of number theory to numerical analysis, Springer (1981; Zbl 0465.10045)]. Some results of computational experiments are also obtained.
Recommendations
- Computing bounds for the star discrepancy
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
- A random walk algorithm to estimate a lower bound of the star discrepancy
- An intermediate bound on the star discrepancy
- A new randomized algorithm to approximate the star discrepancy based on threshold accepting
- A genetic algorithm approach to estimate lower bounds of the star discrepancy
- On an explicit lower bound for the star discrepancy in three dimensions
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- An elementary proof of a lower bound for the inverse of the star discrepancy
- Tractability results for the weighted star-discrepancy
Cites work
- Algorithm 659
- An economic method of computing LPτ-sequences
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- Computing bounds for the star discrepancy
- Decomposable searching problems
- Discrepancy and convex programming
- Discrépance de suites associées à un système de numération (en dimension s)
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 781100 (Why is no real title available?)
- scientific article; zbMATH DE number 3393648 (Why is no real title available?)
- Multidimensional quasi-Monte Carlo methods
- On irregularities of distribution
- On the distribution of points in a cube and the approximate evaluation of integrals
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Point sets and sequences with small discrepancy
- Quasi-Random Sequences and Their Discrepancies
- The inverse of the star-discrepancy depends linearly on the dimension
Cited in
(33)- 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
- Optimal volume subintervals with k points and star discrepancy via integer programming
- Computing bounds for the star discrepancy
- Tractability properties of the weighted star discrepancy of regular grids
- On the arrangement of point sets in the unit interval
- A random walk algorithm to estimate a lower bound of the star discrepancy
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
- A computational investigation of the optimal Halton sequence in QMC applications
- Uniform point sets and the collision test
- Smart sampling and incremental function learning for very large high dimensional data
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Measures of uniformity in experimental designs: a selective overview
- A new randomized algorithm to approximate the star discrepancy based on threshold accepting
- A genetic algorithm approach to estimate lower bounds of the star discrepancy
- A best possible upper bound on the star discrepancy of (t, m, 2)-nets
- Component-by-component construction of low-discrepancy point sets of small size
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
- Statistical measures of two dimensional point set uniformity
- Replication procedure for grouped Sobol' indices estimation in dependent uncertainty spaces
- A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
- Calculation of discrepancy measures and applications
- Entropy, Randomization, Derandomization, and Discrepancy
- An intermediate bound on the star discrepancy
- Low-discrepancy point sets for non-uniform measures
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
- A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy
- Heuristic approaches to obtain low-discrepancy point sets via subset selection
- Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy
- On the discrepancy of low-dimensional probability measures
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- Good permutations for deterministic scrambled Halton sequences in terms of L₂-discrepancy
- Calculation of the discrepancy of a finite set of points in the unit n -cube
This page was built for publication: An algorithm to compute bounds for the star discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1347864)
