Journal article

Lower bounds for centered and wrap-around L2-discrepancies and construction of uniform designs by threshold accepting


Authors listFang, KT; Lu, X; Winker, P

Publication year2003

Pages692-711

JournalJournal of Complexity

Volume number19

Issue number5

ISSN0885-064X

eISSN1090-2708

DOI Linkhttps://doi.org/10.1016/S0885-064X(03)00067-0

PublisherElsevier


Abstract

We study the uniformity of two- and three-level U-type designs based on the centered and wrap-around L-2-discrepancies. By analyzing the known formulae, we find it possible to reexpress them as functions of column balance, and also as functions of Hamming distances of the rows. These new representations allow to obtain two kinds of lower bounds, which can be used as bench marks in searching uniform U-type designs. An efficient updating procedure for the local search heuristic threshold accepting is developed based on these novel formulations of the centered and wrap-around L-2-discrepancies. Our implementation of this heuristic for the two- and three-level case efficiently generates low discrepancy U-type designs. Their quality is assessed using the available lower bounds.




Authors/Editors




Citation Styles

Harvard Citation styleFang, K., Lu, X. and Winker, P. (2003) Lower bounds for centered and wrap-around L2-discrepancies and construction of uniform designs by threshold accepting, Journal of Complexity, 19(5), pp. 692-711. https://doi.org/10.1016/S0885-064X(03)00067-0

APA Citation styleFang, K., Lu, X., & Winker, P. (2003). Lower bounds for centered and wrap-around L2-discrepancies and construction of uniform designs by threshold accepting. Journal of Complexity. 19(5), 692-711. https://doi.org/10.1016/S0885-064X(03)00067-0


Last updated on 2025-21-05 at 16:53