pith. sign in

arxiv: 1811.05676 · v1 · pith:UPOX7A4Gnew · submitted 2018-11-14 · 🧮 math.NA · cs.NA

Worst-case error for unshifted lattice rules without randomisation

classification 🧮 math.NA cs.NA
keywords latticeerrorworst-caseconjecturerandomisationrulesshiftinganalysis
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.