A characterization of strong orthogonal arrays of strength three

DOI10.1214/14-AOS1225zbMATH Open1306.62188arXiv1407.0204OpenAlexW1977902201MaRDI QIDQ464184FDOQ464184

Authors: Yuanzhen He, Boxin Tang 

Publication date: 17 October 2014

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

Abstract: In an early paper, He and Tang [Biometrika 100 (2013) 254-260] introduced and studied a new class of designs, strong orthogonal arrays, for computer experiments, and characterized such arrays through generalized orthogonal arrays. The current paper presents a simple characterization for strong orthogonal arrays of strength three. Besides being simple, this new characterization through a notion of semi-embeddability is more direct and penetrating in terms of revealing the structure of strong orthogonal arrays. Some other results on strong orthogonal arrays of strength three are also obtained along the way, and in particular, two $operatornameSOA(54,5,27,3)$'s are constructed.

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

Recommendations

• Construction results for strong orthogonal arrays of strength three
• Construction of group strong orthogonal arrays of strength two plus
• Strong orthogonal arrays of strength two plus
• Strong orthogonal arrays and associated Latin hypercubes for computer experiments
• Column-orthogonal strong orthogonal arrays of strength two plus and three minus

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• The design and analysis of computer experiments.
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the distribution of points in a cube and the approximate evaluation of integrals
• Title not available (Why is that?)
• Orthogonal Array-Based Latin Hypercubes
• 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
• Miscellanea. A connection between uniformity and aberration in regular fractions of two-level factorials
• Orthogonal Arrays of Strength two and three
• On irregularities of distribution
• An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
• Title not available (Why is that?)
• Point sets and sequences with small discrepancy
• Title not available (Why is that?)
• Construction of orthogonal and nearly orthogonal Latin hypercubes
• Theory of factorial design. Single- and multi-stratum experiments
• Title not available (Why is that?)
• Title not available (Why is that?)
• An approach to constructing nested space-filling designs for multi-fidelity computer experiments
• Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays
• Strong orthogonal arrays and associated Latin hypercubes for computer experiments

Cited In (24)

• Strong orthogonal arrays of strength two plus
• Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
• On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
• Constructions of new orthogonal arrays and covering arrays of strength three
• Construction of asymmetric orthogonal arrays of high strength by juxtaposition
• Uniform projection designs
• Hamming distances of tight orthogonal arrays
• A new class of strong orthogonal arrays of strength three
• Strong orthogonal arrays of strength two-plus based on the Addelman-Kempthorne method
• A study of orthogonal array-based designs under a broad class of space-filling criteria
• Construction of column-orthogonal strong orthogonal arrays
• Construction results for strong orthogonal arrays of strength three
• Using nonregular designs to generate space-filling designs
• Column-orthogonal nearly strong orthogonal arrays
• Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
• Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs
• Construction of group strong orthogonal arrays of strength two plus
• Construction of mixed orthogonal arrays with high strength
• Revised schematic array
• A class of space-filling designs with low-dimensional stratification and column orthogonality
• Title not available (Why is that?)
• Several new classes of space-filling designs
• A unifying implementation of stratum (aka strong) orthogonal arrays
• Construction of strong group-orthogonal arrays

This page was built for publication: A characterization of 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 Q464184)