Strong orthogonal arrays and associated Latin hypercubes for computer experiments
From MaRDI portal
Recommendations
Cited in
(69)- Uniform projection designs
- Minimum projection uniformity for computer experiment with quantitative factors
- Strong orthogonal arrays of strength two plus
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Column-orthogonal designs with multi-dimensional stratifications
- Construction of mixed orthogonal arrays with high strength
- Model-robust subdata selection for big data
- Orthogonal array based locally D-optimal designs for binary responses in the presence of factorial effects
- A study of orthogonal array-based designs under a broad class of space-filling criteria
- Representative points for distribution recovering
- Construction of multi-level space-filling designs via code mappings
- Construction of column-orthogonal strong orthogonal arrays
- A new and flexible design construction for orthogonal arrays for modern applications
- 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 of space-filling orthogonal Latin hypercube designs
- Construction results for strong orthogonal arrays of strength three
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays
- Orthogonal Array-Based Latin Hypercubes
- A characterization of strong orthogonal arrays of strength three
- A central limit theorem for general orthogonal array based space-filling designs
- scientific article; zbMATH DE number 775913 (Why is no real title available?)
- Minimal second order saturated designs and their applications to space-filling designs
- Construction of strong group-orthogonal arrays
- Design selection for strong orthogonal arrays
- Nearly column-orthogonal designs based on leave-one-out good lattice point sets
- Design based incomplete U-statistics
- Column-orthogonal strong orthogonal arrays of strength two plus and three minus
- Space-filling orthogonal arrays of strength two
- Central limit theorems for four new types of \(U\)-designs
- 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
- Doubly Coupled Designs for Computer Experiments With Both Qualitative and Quantitative Factors
- Uniform Projection Designs and Strong Orthogonal Arrays
- 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
- Hierarchical optimal designs and modeling for engineering: a case-study in the rail sector
- A new class of strong orthogonal arrays of strength three
- G-optimal grid designs for kriging models
- Strong orthogonal Latin hypercubes for computer experiments
- 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
- Construction of maximum projection Latin hypercube designs using number-theoretic methods
- Grouped orthogonal arrays for computer experiments with grouped inputs
- Construction of a special class of marginally coupled designs
- Orthogonal arrays: a review
- Space-filling properties of strong orthogonal arrays
- A new class of orthogonal designs with good low dimensional space-filling properties
- Enhanced branching Latin hypercube design and its application in automatic algorithm configuration
- 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
- A new class of asymptotic maximin distance Latin hypercube designs
- 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
- 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
- Construction of space-filling orthogonal designs
This page was built for publication: Strong orthogonal arrays and associated Latin hypercubes for computer experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411030)
