Construction results for strong orthogonal arrays of strength three
From MaRDI portal
Publication:2278667
\textit{Y. He} and \textit{B. Tang} [Biometrika 100, No. 1, 254--260 (2013; Zbl 1284.62487)] introduced strong orthogonal arrays (SOAs) as space-filling designs for computer experiments. SOAs of strength 3 are most useful, since SOAs of strength 2 are no more space filling than ordinary orthogonal arrays of strength 2 and SOAs of strength 4 or higher are prohibitively expensive. The existence of strength-three SOAs was completely characterized in [\textit{Y. He} and \textit{B. Tang}, Ann. Stat. 42, No. 4, 1347--1360 (2014; Zbl 1306.62188)], but the construction of these arrays was not explored. In the paper under review, 3 families of strength-three SOAs are presented. The arrays in one of these families enjoy some of the space-filling properties of strength-four SOAs. The theory of maximal designs and their doubling constructions plays a crucial role in the theoretical arguments.
Recommendations
- A characterization of strong orthogonal arrays of strength three
- Construction of group strong orthogonal arrays of strength two plus
- Design selection for strong orthogonal arrays
- Strong orthogonal arrays of strength two plus
- Column-orthogonal strong orthogonal arrays of strength two plus and three minus
Cites work
- A characterization of strong orthogonal arrays of strength three
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A general construction for space-filling Latin hypercubes
- Algorithms for generating maximin Latin hypercube and orthogonal designs
- An approach to constructing nested space-filling designs for multi-fidelity computer experiments
- An equivalence between (T,M,S)-nets and strongly orthogonal hypercubes
- Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays
- Construction of \(2^ m4^ n\) designs via a grouping scheme
- Doubling and projection: A method of constructing two-level designs of resolution IV
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1229678 (Why is no real title available?)
- scientific article; zbMATH DE number 1313654 (Why is no real title available?)
- scientific article; zbMATH DE number 775913 (Why is no real title available?)
- scientific article; zbMATH DE number 845705 (Why is no real title available?)
- scientific article; zbMATH DE number 2231192 (Why is no real title available?)
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Orthogonal and nearly orthogonal designs for computer experiments
- Orthogonal Array-Based Latin Hypercubes
- Orthogonal arrays. Theory and applications
- Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
- Scrambled net variance for integrals of smooth functions
- Some classes of orthogonal Latin hypercube designs
- Some theory for constructing minimum aberration fractional factorial designs
- Strong orthogonal arrays and associated Latin hypercubes for computer experiments
- The design and analysis of computer experiments.
- Theory of factorial design. Single- and multi-stratum experiments
- Uniform Design: Theory and Application
Cited in
(36)- Strong orthogonal arrays of strength two plus
- Construction of column-orthogonal strong orthogonal arrays
- Construction of group strong orthogonal arrays of strength two plus
- Column-orthogonal nearly strong orthogonal arrays
- Strong orthogonal arrays of strength two-plus based on the Addelman-Kempthorne method
- Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays
- scientific article; zbMATH DE number 1558155 (Why is no real title available?)
- A characterization of strong orthogonal arrays of strength three
- Design selection for strong orthogonal arrays
- Construction of Asymmetric Orthogonal Arrays of Strength Three via a Replacement Method
- Strong orthogonal arrays and associated Latin hypercubes for computer experiments
- Column optimal strongly threefold orthogonal matrices in a class index eight
- Orthogonal arrays of strength three from regular 3-wise balanced designs
- Doubly Coupled Designs for Computer Experiments With Both Qualitative and Quantitative Factors
- A unifying implementation of stratum (aka strong) orthogonal arrays
- A class of space-filling designs with low-dimensional stratification and column orthogonality
- Several new classes of space-filling designs
- A maximum projective stratification criterion for selecting space-filling designs
- Deterministic sampling based on Kullback-Leibler divergence and its applications
- A new class of strong orthogonal arrays of strength three
- Selecting strong orthogonal arrays by linear allowable level permutations
- Direct constructions of column-orthogonal strong orthogonal arrays
- A Projection Space-Filling Criterion and Related Optimality Results
- A construction method for column-orthogonal strong orthogonal arrays
- Grouped orthogonal arrays for computer experiments with grouped inputs
- Orthogonal arrays: a review
- A new class of orthogonal designs with good low dimensional space-filling properties
- Group strong orthogonal arrays with appealing two-dimensional space-filling property
- Theory and applications of stratification criteria based on space-filling pattern and projection pattern
- Construction of mixed-level column-orthogonal strong orthogonal arrays of strength two plus
- Group strong orthogonal arrays and their construction methods
- Nested strong orthogonal arrays
- A stratified L₂-discrepancy with application to space-filling designs
- Construction of column-orthogonal strong orthogonal arrays of strength 3
- Construction of Asymmetric Nested Orthogonal Arrays
- Constructions of new orthogonal arrays and covering arrays of strength three
This page was built for publication: Construction results for strong orthogonal arrays of strength three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278667)
