Random prime lattice rules with random generating vectors and a median over repetitions achieve near-optimal integration error in all weighted Korobov classes, with dimension-independent constants for ℓ^{1/α}-summable weights.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A simple universal algorithm for high-dimensional integration
Random prime lattice rules with random generating vectors and a median over repetitions achieve near-optimal integration error in all weighted Korobov classes, with dimension-independent constants for ℓ^{1/α}-summable weights.