Computing Bounds for the Star Discrepancy

Computing ◽  
2000 ◽  
Vol 65 (2) ◽  
pp. 169-186 ◽  
Author(s):  
E. Thiémard
Keyword(s):  
Star Discrepancy

scholarly journals Constructions of general polynomial lattice rules based on the weighted star discrepancy

2007 ◽  
Vol 13 (4) ◽  
pp. 1045-1070 ◽  
Author(s):  
Josef Dick ◽  
Peter Kritzer ◽  
Gunther Leobacher ◽  
Friedrich Pillichshammer
Keyword(s):  
Lattice Rules ◽  
General Polynomial ◽  
Star Discrepancy

A generalization of NUT digital (0,1)-sequences and best possible lower bounds for star discrepancy

2013 ◽  
Vol 158 (4) ◽  
pp. 321-340 ◽  
Author(s):  
Henri Faure ◽  
Friedrich Pillichshammer
Keyword(s):  
Lower Bounds ◽  
Star Discrepancy

scholarly journals Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration

2017 ◽  
Vol 145 (8) ◽  
pp. 3297-3310 ◽  
Author(s):  
Josef Dick ◽  
Domingo Gomez-Perez ◽  
Friedrich Pillichshammer ◽  
Arne Winterhof
Keyword(s):  
Multivariate Integration ◽  
Star Discrepancy

Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy

2005 ◽  
Vol 43 (1) ◽  
pp. 76-95 ◽  
Author(s):  
Josef Dick ◽  
Gunther Leobacher ◽  
Friedrich Pillichshammer
Keyword(s):  
Star Discrepancy ◽  
Construction Algorithms ◽  
Digital Nets

scholarly journals Metric discrepancy results for Erdős-Fortet sequence

2012 ◽  
Vol 49 (1) ◽  
pp. 52-78 ◽  
Author(s):  
Katusi Fukuyama ◽  
Sho Miyamoto
Keyword(s):  
Iterated Logarithm ◽  
The Law ◽  
Star Discrepancy

For the classical Erdős-Fortet sequence nk = 2k − 1 we show that the law of the iterated logarithm for star discrepancy of {nkx} has non-constant limsup, while the law for discrepancy has constant limsup.

Sign in / Sign up

Export Citation Format

Share Document