A0305
Title: Selecting strong orthogonal arrays by linear allowable level permutations
Authors: Boxin Tang - Simon Fraser University (Canada)
Guanzhou Chen - Nankai University (China) [presenting]
Abstract: Space-filling designs are widely used in physical and computer experiments when the model between the response and input factors is uncertain. Recently, another study justified the use of strong orthogonal arrays (SOAs) under a broad class of space-filling criteria. However, when allowable level permutations are applied to an SOA, a class of SOAs can be obtained with different geometrical structures, and it is not clear which one should be selected for practical use. This issue is addressed by considering a representative subset of allowable level permutations called linear allowable level permutations. These special-level permutations offer theoretical convenience in classifying various geometrically non-isomorphic SOAs. Based on these results, construction methods are provided to obtain SOAs that are more space-filling than those in the literature.
