A note on E. Thiemard's algorithm to compute bounds for the star discrepancy

被引:5
|
作者
Pillards, T [1 ]
Cools, R [1 ]
机构
[1] Katholieke Univ Leuven, Dept Comp Sci, B-3001 Heverlee, Belgium
关键词
discrepancy; quasi-Monte Carlo;
D O I
10.1016/j.jco.2004.05.004
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Thiemard (J. Complexity 17(4) (2001) 850) suspects that his upper bound for the discrepancy B(9, x) is bounded below by a measure for the tightness of the partition P. We present a counterexample but also prove that for a certain class of partitions the assumption is valid. The partitions used in Thiemard's algorithm are all part of this class. (c) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码:320 / 323
页数:4
相关论文
共 30 条