On an algorithm for constructing uniformly distributed Korobov grids
In the paper under review, the authors deal with the problem of effectively compute uniformly distributed grids of the multidimensional unit cube. They consider the so-called Korobov grids; these grids depend on \(s+1\) positive integers \(p,a_1,\dots,a_s\) and are defined as \[ \xi_{k}^{(p)} (a_1,\dots,a_s) = \left(\left\{\frac{k}{p}a_1\right\},\dots,\left\{\frac{k}{p}a_s\right\}\right),\quad k=1,\dots,p, \] where \(\{x\}\) denotes the fractional part of \(x\). \textit{N. M. Korobov} [Number-theoretic methods in approximate analysis (Russian). Moskva: Gosudarstv. Izdat. Fiz.-Mat. Lit. (1963; Zbl 0115.11703)] proved that, for any \(p\), there exist \(a_1,\dots,a_s\) such that the grid \(\xi_{k}^{(p)} (a_1,\dots,a_s)_{k=1}^p\) is uniformly distributed in \([0,1]^s\). In the paper, the authors state a theorem useful to detect such sequences of integers.
- A generic construction for high order approximation schemes of semigroups using random grids
- General algorithm for the numerical integration of functions of several variables
- An exact order of discrepancy of the Smolyak grid and some general conclusions in the theory of numerical integration
- On generalized non-uniform Korobov grids
- The final deviation and the main quality measure for Korobov grids
This page was built for publication: On an algorithm for constructing uniformly distributed Korobov grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q369595)
