A characterization of strong orthogonal arrays of strength three
From MaRDI portal
(Redirected from Publication:464184)
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 's are constructed.
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
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- An approach to constructing nested space-filling designs for multi-fidelity computer experiments
- An equivalence between (T,M,S)-nets and strongly orthogonal hypercubes
- Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays
- Construction of orthogonal and nearly orthogonal Latin hypercubes
- 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 822320 (Why is no real title available?)
- scientific article; zbMATH DE number 2231192 (Why is no real title available?)
- scientific article; zbMATH DE number 3048068 (Why is no real title available?)
- Miscellanea. A connection between uniformity and aberration in regular fractions of two-level factorials
- On irregularities of distribution
- On the distribution of points in a cube and the approximate evaluation of integrals
- On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
- Orthogonal Array-Based Latin Hypercubes
- Orthogonal Arrays of Strength two and three
- Orthogonal arrays. Theory and applications
- Point sets and sequences with small discrepancy
- 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
Cited in
(42)- Uniform projection designs
- Strong orthogonal arrays of strength two plus
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Construction of mixed orthogonal arrays with high strength
- A study of orthogonal array-based designs under a broad class of space-filling criteria
- 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
- Column-orthogonal nearly strong orthogonal arrays
- Strong orthogonal arrays of strength two-plus based on the Addelman-Kempthorne method
- Construction results for strong orthogonal arrays of strength three
- scientific article; zbMATH DE number 1558155 (Why is no real title available?)
- Construction of asymmetric orthogonal arrays of high strength by juxtaposition
- Construction of strong group-orthogonal arrays
- Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
- On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
- Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs
- 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
- Hamming distances of tight orthogonal arrays
- A new class of strong orthogonal arrays of strength three
- Revised schematic array
- A construction method for column-orthogonal strong orthogonal arrays
- Grouped orthogonal arrays for computer experiments with grouped inputs
- Orthogonal arrays: a review
- Space-filling properties of strong orthogonal arrays
- A new class of orthogonal designs with good low dimensional space-filling properties
- Group strong orthogonal arrays with appealing two-dimensional space-filling property
- Construction of asymmetric orthogonal arrays with high strength
- 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
- On construction of strong orthogonal arrays and column-orthogonal strong orthogonal arrays of strength two plus
- On construction of mappable nearly orthogonal arrays with column-orthogonality
- Group strong orthogonal arrays and their construction methods
- Nested strong orthogonal arrays
- Existence of schematic arrays under a novel criterion
- Construction of asymmetric orthogonal arrays with repeated rows
- Construction of column-orthogonal strong orthogonal arrays of strength 3
- Construction of Asymmetric Nested Orthogonal Arrays
- Schematic Latin hypercube designs
- Constructions of new orthogonal arrays and covering arrays of strength three
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)
