Tractability results for the weighted star-discrepancy

DOI10.1016/J.JCO.2013.12.004zbMath1296.65041arXiv1307.5600OpenAlexW2962929675MaRDI QIDQ2251911

Christoph Aistleitner

Publication date: 15 July 2014

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

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

zbMATH Keywords

tractabilityinverse of the discrepancyweighted star-discrepancy

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Complexity and performance of numerical algorithms (65Y20) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38)

Related Items (9)

The weighted star discrepancy of Korobov’s $p$-sets ⋮ Equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in \(L_p\) ⋮ The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ Discrepancy of Digital Sequences: New Results on a Classical QMC Topic ⋮ Tractability properties of the weighted star discrepancy of the Halton sequence ⋮ A note on \((s,t)\)-weak tractability of the weighted star discrepancy of regular grids ⋮ Tractability properties of the weighted star discrepancy of regular grids ⋮ A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering numbers, dyadic chaining and discrepancy
• Bounds for the weighted \(L^p\) discrepancy and tractability of integration
• Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
• Tractability of multivariate problems. Volume III: Standard information for operators
• Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
• Tractability of multivariate problems. Volume I: Linear information
• Tractability of multivariate problems. Volume II: Standard information for functionals.
• 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?
• Sharper bounds for Gaussian and empirical processes
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Weighted discrepancy and high-dimensional numerical integration
• A constructive approach to strong tractability using quasi-Monte Carlo algorithms
• Tractability properties of the weighted star discrepancy
• Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples
• The inverse of the star-discrepancy depends linearly on the dimension
• Strong tractability of multivariate integration using quasi–Monte Carlo algorithms
• On strong tractability of weighted multivariate integration
• Probabilistic discrepancy bound for Monte Carlo point sets
• High-dimensional integration: The quasi-Monte Carlo way
• Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
• Intractability results for integration and discrepancy

This page was built for publication: Tractability results for the weighted star-discrepancy