Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration

DOI10.1090/PROC/13490zbMath1428.11136arXiv1512.06521OpenAlexW2964057042MaRDI QIDQ5270132

Arne Winterhof, Josef Dick, Domingo Gómez-Pérez, Friedrich Pillichshammer

Publication date: 22 June 2017

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

pseudorandom numberstractabilityquasi-Monte Carloweighted star discrepancy

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Exponential sums (11T23) Random number generation in numerical analysis (65C10) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (4)

Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series ⋮ On the information complexity for integration in subspaces of the Wiener algebra ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering numbers, dyadic chaining and discrepancy
• Tractability of multivariate problems. Volume III: Standard information for operators
• Finite binary sequences constructed by explicit inversive methods
• Tractability of multivariate problems. Volume I: Linear information
• Tractability of multivariate problems. Volume II: Standard information for functionals.
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
• On the linear complexity profile of some new explicit inversive pseudorandom numbers
• The curse of dimensionality for the class of monotone functions and for the class of convex functions
• The curse of dimensionality for numerical integration of smooth functions. II
• Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series
• The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers
• The curse of dimensionality for numerical integration of smooth functions
• Exponential Sums and Goppa Codes: I
• The weighted star discrepancy of Korobov’s $p$-sets
• Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
• The inverse of the star-discrepancy depends linearly on the dimension
• Probabilistic discrepancy bound for Monte Carlo point sets
• Introduction to Quasi-Monte Carlo Integration and Applications
• High-dimensional integration: The quasi-Monte Carlo way

This page was built for publication: Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration