A characterization of strong orthogonal arrays of strength three

DOI10.1214/14-AOS1225zbMath1306.62188arXiv1407.0204OpenAlexW1977902201MaRDI QIDQ464184

Boxin Tang, Yuanzhen He

Publication date: 17 October 2014

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.0204

zbMATH Keywords

computer experimentLatin hypercubespace-filling design\((t, m, s)\)-netlow dimensional projection

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15)

Related Items (17)

On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments ⋮ Construction of column-orthogonal strong orthogonal arrays ⋮ Construction of group strong orthogonal arrays of strength two plus ⋮ Using nonregular designs to generate space-filling designs ⋮ Construction of asymmetric orthogonal arrays of high strength by juxtaposition ⋮ Construction of strong group-orthogonal arrays ⋮ Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs ⋮ A unifying implementation of stratum (aka strong) orthogonal arrays ⋮ Uniform projection designs ⋮ Column-orthogonal nearly strong orthogonal arrays ⋮ Strong orthogonal arrays of strength two-plus based on the Addelman-Kempthorne method ⋮ Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs ⋮ Strong orthogonal arrays of strength two plus ⋮ Construction results for strong orthogonal arrays of strength three ⋮ Construction of mixed orthogonal arrays with high strength ⋮ Latin hypercube designs based on strong orthogonal arrays and Kriging modelling to improve the payload distribution of trains ⋮ A study of orthogonal array-based designs under a broad class of space-filling criteria

Cites Work

• Point sets and sequences with small discrepancy
• Orthogonal arrays. Theory and applications
• On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
• The design and analysis of computer experiments.
• An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Construction of orthogonal and nearly orthogonal Latin hypercubes
• Orthogonal Array-Based Latin Hypercubes
• Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays
• Miscellanea. A connection between uniformity and aberration in regular fractions of two-level factorials
• Strong orthogonal arrays and associated Latin hypercubes for computer experiments
• On the distribution of points in a cube and the approximate evaluation of integrals
• Orthogonal Arrays of Strength two and three
• On irregularities of distribution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of strong orthogonal arrays of strength three