 An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arraysNam-Ky Nguyen and Min-Qian Liu Computational Statistics & Data Analysis, 2008, vol. 52, issue 12, 5269-5276 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(d2) 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(fNOD)E(fNOD) 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(d2); (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. Date: 2008 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:csdana:v:52:y:2008:i:12:p:5269-5276 Access Statistics for this article Computational Statistics & Data Analysis is currently edited by S.P. Azen More articles in Computational Statistics & Data Analysis from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.