Optimal orthogonal-array-based latin hypercubes
From MaRDI portal
Recommendations
Cited in
(22)- Measuring the goodness of orthogonal array discretizations for stochastic programming and stochastic dynamic programming
- Design of computer experiments: space filling and beyond
- Recent advances in space-mapping-based modeling of microwave devices
- A new approach with orthogonal array for global optimization in design of experiments
- Surrogate-based methods
- Space-filling orthogonal arrays of strength two
- A spectral approach for the design of experiments: design, analysis and algorithms
- Comparing emulation methods for a high-resolution storm surge model
- A theorem for selecting oa-based latin hypercubes using a distance criterion
- Setting targets for surrogate-based optimization
- Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling
- Pitfalls of using a single criterion for selecting experimental designs
- Orthogonal array-based uniform Latin hypercube designs and their construction
- scientific article; zbMATH DE number 5064933 (Why is no real title available?)
- A new class of Latin hypercube designs with high-dimensional hidden projective uniformity
- Construction of nested space-filling designs
- Orthogonal Array-Based Latin Hypercubes
- Latin hypercube sampling with multidimensional uniformity
- Marginally coupled designs for two-level qualitative factors
- Construction of marginally coupled designs by subspace theory
- Construction of uniform projection designs via level permutation and expansion
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
This page was built for publication: Optimal orthogonal-array-based latin hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591840)
