2009
DOI: 10.1002/jcd.20236
|View full text |Cite|
|
Sign up to set email alerts
|

Complete enumeration of pure‐level and mixed‐level orthogonal arrays

Abstract: We specify an algorithm to enumerate a minimum complete set of combinatorially non-isomorphic orthogonal arrays of given strength t, run-size N, and level-numbers of the factors. The algorithm is the first one handling general mixed-level and pure-level cases. Using an implementation in C, we generate most non-trivial series for t = 2, N ≤ 28, t = 3, N ≤ 64, and t = 4, N ≤ 168. The exceptions define limiting run-sizes for which the algorithm returns complete sets in a reasonable amount of time. q

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
94
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 107 publications
(104 citation statements)
references
References 23 publications
2
94
0
Order By: Relevance
“…We tested the algorithm by comparing our results with those reported in Schoen et al (2010). We also ran other examples.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We tested the algorithm by comparing our results with those reported in Schoen et al (2010). We also ran other examples.…”
Section: Resultsmentioning
confidence: 99%
“…Orthogonal arrays (OAs) represent an important class of OFFDs, see, for example, Hedayat, Sloane, and Stufken (1999) and Schoen, Eendebak, and Nguyen (2010). Indeed an OA of appropriate strength can be used to solve the wide range of problems related to the study of the size of the main effects and interactions up to a given order of interest.…”
Section: Introductionmentioning
confidence: 99%
“…Note that the catalog is by no means complete; in particular, it is much more difficult to completely enumerate all orthogonal arrays than it is to enumerate all regular orthogonal arrays. Partially complete catalogs of orthogonal arrays are available, e.g., from the website by Eendebak and Schoen (2010) based on the algorithm described in Schoen, Eendebak, and Nguyen (2010). In many cases, the web site provides the best arrays only, or does not provide an array at all (in case of very large numbers of arrays).…”
Section: R> L18mentioning
confidence: 99%
“…In this paper, we consider the case that all interactions are of equal interest, while the OA need not be embedded in a saturated OA. To generate OAs, we slightly modified the algorithm of Schoen et al (2010) (SEN). The complete source for the system is available on the world wide web (Eendebak, 2015) as well as in the supplementary materials.…”
Section: Candidate Designs For the Motivating Examplementioning
confidence: 99%