An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays

Authors:
Nam-Ky Nguyen;Min-Qian Liu
Affiliations:
Centre for High-Performance Computing, Hanoi University of Science, 334 Nguyen Trai, Thanh Xuan, Hanoi, Viet Nam;Department of Statistics, School of Mathematical Sciences, Nankai University, Tianjin 300071, China and LPMC, Nankai University, Tianjin 300071, China
Venue:
Computational Statistics & Data Analysis
Year:
2008

Citing 5
Cited 2

A review of some exchange algorithms for constructing discrete D-optimal designs

Computational Statistics & Data Analysis - Second special issue on optimization techniques in statistics
A new class of supersaturated designs

Technometrics
Nearly orthogonal arrays with mixed levels and small runs

Technometrics
An algorithmic approach to constructing supersaturated designs

Technometrics
A note on the construction of near-orthogonal arrays with mixed levels and economic run size

Technometrics

An algorithm for constructing mixed-level k-circulant supersaturated designs

Computational Statistics & Data Analysis
Update formulas for split-plot and block designs

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.03

Visualization

Abstract

Due to run size constraints, near-orthogonal arrays (near-OAs) and supersaturated designs, a special case of near-OA, are considered good alternatives to OAs. This paper shows (i) a combinatorial relationship between a mixed-level array and a non-resolvable incomplete block design (IBD) with varying replications (and its dual, a resolvable IBD with varying block sizes); (ii) the relationship between the criterion E(d^2) proposed by Lu and Sun [Lu, X., Sun, Y., 2001. Supersaturated designs with more than two levels. Chinese Ann. Math. B 22, 183-194] or E(f"""N"""O"""D) proposed by Fang et al. [Fang, K.T., Lin, D.K.J., Liu, M.Q., 2003b. Optimal mixed-level supersaturated design. Metrika 58, 279-291] used in the (near-) OA construction and the (M,S)-optimality criterion used in the IBD construction; (iii) the derivation of a tighter bound for E(d^2); (iv) how to modify the IBD algorithm of Nguyen [Nguyen, N.-K., 1994. Construction of optimal incomplete block designs by computer. Technometrics 36, 300-307] to obtain efficient (near-) OA algorithms. Some new (near-) OAs are presented and some near-OAs are compared with arrays constructed by other authors. Examples showing the use of the constructed arrays are given.