A study of orthogonal array-based designs under a broad class of space-filling criteria
type: Item
instance of: scholarly article
title: A study of orthogonal array-based designs under a broad class of space-filling criteria
DOI: 10.1214/22-AOS2215
author: Guanzhou Chen
author: Boxin Tang
published in: The Annals of Statistics
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 62K15
Mathematics Subject Classification ID: 62K99
zbMATH DE Number: 7628846
zbMATH Keywords: computer experiment
zbMATH Keywords: digital net
zbMATH Keywords: mappable nearly orthogonal array
zbMATH Keywords: strong orthogonal array
zbMATH Keywords: supersaturated design
MaRDI profile type: Publication
cites work: Projection justification of generalized minimum aberration for asymmetrical fractional factorial designs
cites work: Using nonregular designs to generate space-filling designs
cites work: Q5004048
cites work: Q5706748
cites work: Theory and application of uniform experimental designs
cites work: Strong orthogonal arrays of strength two plus
cites work: Strong orthogonal arrays and associated Latin hypercubes for computer experiments
cites work: A characterization of strong orthogonal arrays of strength three
cites work: A generalized discrepancy and quadrature error bound
cites work: A method of constructing maximin distance designs
cites work: A new and flexible method for constructing designs for computer experiments
cites work: A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
cites work: Nearly orthogonal arrays mappable into fully orthogonal arrays
cites work: Point sets and sequences with small discrepancy
cites work: Q4839975
cites work: Controlling Correlations in Latin Hypercube Samples
cites work: The design and analysis of computer experiments
cites work: Design selection for strong orthogonal arrays
cites work: A construction method for orthogonal Latin hypercube designs
cites work: OUP accepted manuscript
cites work: Uniform Projection Designs and Strong Orthogonal Arrays
cites work: Uniform projection designs
cites work: Orthogonal Array-Based Latin Hypercubes
cites work: Theory of \(J\)-characteristics for fractional factorial designs and projection justification of minimum \(G_2\)-aberration
cites work: A minimum aberration-type criterion for selecting space-filling designs
cites work: On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
cites work: Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
cites work: Construction of strong group-orthogonal arrays
cites work: Connecting U-type designs before and after level permutations and expansions
cites work: Construction of Maximin Distance Designs via Level Permutation and Expansion
cites work: Q4438057
cites work: Generalized minimum aberration for asymmetrical fractional factorial designs.
cites work: Construction of optimal multi-level supersaturated designs
cites work: Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
cites work: Mixture discrepancy for quasi-random point sets
cites work: Space-Filling Fractional Factorial Designs
cites work: Space-filling properties of good lattice point sets
Recommended article: A study of orthogonal arrays from the point of view of design theory
Recommended article: Q3386360
Recommended article: Construction of space-filling orthogonal designs
Recommended article: A new and flexible design construction for orthogonal arrays for modern applications
Recommended article: Construction of sliced space-filling designs based on balanced sliced orthogonal arrays
Recommended article: A central limit theorem for general orthogonal array based space-filling designs
Recommended article: Some investigations on orthogonal arrays
Recommended article: Construction of search designs from orthogonal arrays
Recommended article: Design selection for strong orthogonal arrays
description: scientific article; zbMATH DE number 7628846