Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jco.2010.03.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2110972762 / rank | |||
Normal rank | |||
Revision as of 03:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding |
scientific article |
Statements
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (English)
0 references
11 October 2010
0 references
The authors propose a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is much simpler than a previous one proposed by \textit{B.~Doerr}, \textit{M.~Gnewuch}, and \textit{A.~Srivastav} [J. Complexity 21, No.~5, 691--709 (2005; Zbl 1115.11046)]. The section ``Numerical experiments'' contains a numerous tables and plots which compare the authors' construction with others. From the abstract: ``\dots our algorithm leads to superior results if the dimension is relatively high and the number of points that have to be constructed is rather small.''
0 references
star discrepancy
0 references
low-discrepancy points
0 references
randomized rounding
0 references
derandomization
0 references
deterministic algorithm
0 references
numerical experiments
0 references
