The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers

DOI10.1007/978-3-319-12325-7_15zbMath1337.11048arXiv1407.4208OpenAlexW1563644149MaRDI QIDQ2945082

Josef Dick, Friedrich Pillichshammer

Publication date: 9 September 2015

Published in: Sequences and Their Applications - SETA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.4208

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Irregularities of distribution, discrepancy (11K38)

Related Items (2)

Optimal jittered sampling for two points in the unit square ⋮ Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration

Cites Work

• Consistency of Markov chain quasi-Monte Carlo on continuous state spaces
• Covering numbers, dyadic chaining and discrepancy
• Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
• Funktionen von beschränkter Variation in der Theorie der Gleichverteilung
• Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
• On the small ball inequality in all dimensions
• Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
• Greedy-type approximation in Banach spaces and applications
• A constructive approach to strong tractability using quasi-Monte Carlo algorithms
• Tractability results for the weighted star-discrepancy
• A lower bound for the discrepancy of a random point set
• Proof techniques in quasi-Monte Carlo theory
• Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series
• Tractability properties of the weighted star discrepancy
• Bounds and constructions for the star-discrepancy via \(\delta\)-covers
• A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
• Probabilistic Star Discrepancy Bounds for Double Infinite Random Matrices
• The weighted star discrepancy of Korobov’s $p$-sets
• Component-by-component construction of low-discrepancy point sets of small size
• Applications of Number Theory to Numerical Analysis
• The inverse of the star-discrepancy depends linearly on the dimension
• Strong tractability of multivariate integration using quasi–Monte Carlo algorithms
• Quasi-Monte Carlo Finite Element Methods for a Class of Elliptic Partial Differential Equations with Random Coefficients
• Probabilistic discrepancy bound for Monte Carlo point sets
• Introduction to Quasi-Monte Carlo Integration and Applications
• Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
• On Some Exponential Sums
• On irregularities of distribution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers