arXiv Analytics

Sign in

arXiv:1811.05676 [math.NA]AbstractReferencesReviewsResources

Worst-case error for unshifted lattice rules without randomisation

Yoshihito Kazashi, Frances Y. Kuo, Ian H. Sloan

Published 2018-11-14Version 1

An existence result is presented for the worst-case error of lattice rules for high dimensional integration over the unit cube, in an unanchored weighted space of functions with square-integrable mixed first derivatives. Existing studies rely on random shifting of the lattice to simplify the analysis, whereas in this paper neither shifting nor any other form of randomisation is considered. Given that a certain number-theoretic conjecture holds, it is shown that there exists an $N$-point rank-one lattice rule which gives a worst-case error of order $1/\sqrt{N}$ up to a (dimension-independent) logarithmic factor. Numerical results suggest that the conjecture is plausible.

Related articles: Most relevant | Search more
arXiv:1407.8311 [math.NA] (Published 2014-07-31)
Covering of spheres by spherical caps and worst-case error for equal weight cubature in Sobolev spaces
arXiv:1105.2599 [math.NA] (Published 2011-05-13, updated 2011-05-18)
Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
arXiv:2303.01787 [math.NA] (Published 2023-03-03, updated 2023-06-12)
The curse of dimensionality for the $L_p$-discrepancy with finite $p$