Standard

Calculation of the discrepancy of a finite set of points in the unit n-Cube. / Tovstik, T. M.

In: Vestnik St. Petersburg University: Mathematics, Vol. 40, No. 3, 09.2007, p. 250-252.

Research output: Contribution to journal › Article › peer-review

Harvard

Tovstik, TM 2007, 'Calculation of the discrepancy of a finite set of points in the unit n-Cube', Vestnik St. Petersburg University: Mathematics, vol. 40, no. 3, pp. 250-252. https://doi.org/10.3103/S1063454107030120

APA

Tovstik, T. M. (2007). Calculation of the discrepancy of a finite set of points in the unit n-Cube. Vestnik St. Petersburg University: Mathematics, 40(3), 250-252. https://doi.org/10.3103/S1063454107030120

Vancouver

Tovstik TM. Calculation of the discrepancy of a finite set of points in the unit n-Cube. Vestnik St. Petersburg University: Mathematics. 2007 Sep;40(3):250-252. https://doi.org/10.3103/S1063454107030120

Author

Tovstik, T. M. / Calculation of the discrepancy of a finite set of points in the unit n-Cube. In: Vestnik St. Petersburg University: Mathematics. 2007 ; Vol. 40, No. 3. pp. 250-252.

BibTeX

@article{3f999e4811d64d2d92d9c5075653688a,
title = "Calculation of the discrepancy of a finite set of points in the unit n-Cube",
abstract = "An algorithm for calculating the discrepancy of finitely many points in the unit n-cube [0, 1] n is suggested. This algorithm is easy to program. For 2 ≤ n ≤ 4, the suggested algorithm is significantly faster than Bundschuh and Zhu's algorithm. For larger n, whether this algorithm is faster depends on the number of points.",
author = "Tovstik, {T. M.}",
year = "2007",
month = sep,
doi = "10.3103/S1063454107030120",
language = "English",
volume = "40",
pages = "250--252",
journal = "Vestnik St. Petersburg University: Mathematics",
issn = "1063-4541",
publisher = "Pleiades Publishing",
number = "3",

}

RIS

TY - JOUR

T1 - Calculation of the discrepancy of a finite set of points in the unit n-Cube

AU - Tovstik, T. M.

PY - 2007/9

Y1 - 2007/9

N2 - An algorithm for calculating the discrepancy of finitely many points in the unit n-cube [0, 1] n is suggested. This algorithm is easy to program. For 2 ≤ n ≤ 4, the suggested algorithm is significantly faster than Bundschuh and Zhu's algorithm. For larger n, whether this algorithm is faster depends on the number of points.

AB - An algorithm for calculating the discrepancy of finitely many points in the unit n-cube [0, 1] n is suggested. This algorithm is easy to program. For 2 ≤ n ≤ 4, the suggested algorithm is significantly faster than Bundschuh and Zhu's algorithm. For larger n, whether this algorithm is faster depends on the number of points.

UR - http://www.scopus.com/inward/record.url?scp=84859700866&partnerID=8YFLogxK

U2 - 10.3103/S1063454107030120

DO - 10.3103/S1063454107030120

M3 - Article

AN - SCOPUS:84859700866

VL - 40

SP - 250

EP - 252

JO - Vestnik St. Petersburg University: Mathematics

JF - Vestnik St. Petersburg University: Mathematics

SN - 1063-4541

IS - 3

ER -

ID: 15681398