On an algorithm for constructing uniformly distributed Korobov grids (Q369595): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Paolo Lella / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11K36 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6209096 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Korobov grid | |||
Property / zbMATH Keywords: Korobov grid / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
uniformly distributed grid | |||
Property / zbMATH Keywords: uniformly distributed grid / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multidimensional unit cube | |||
Property / zbMATH Keywords: multidimensional unit cube / rank | |||
Normal rank |
Revision as of 13:29, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On an algorithm for constructing uniformly distributed Korobov grids |
scientific article |
Statements
On an algorithm for constructing uniformly distributed Korobov grids (English)
0 references
18 September 2013
0 references
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.
0 references
Korobov grid
0 references
uniformly distributed grid
0 references
multidimensional unit cube
0 references