Sliced Latin hypercube designs via orthogonal arrays
From MaRDI portal
Publication:2448810
Recommendations
- Construction of sliced orthogonal Latin hypercube designs
- Construction of sliced (nearly) orthogonal Latin hypercube designs
- Construction of (nearly) orthogonal sliced Latin hypercube designs
- Construction of orthogonal general sliced Latin hypercube designs
- Construction of sliced maximin-orthogonal Latin hypercube designs
- General sliced Latin hypercube designs
- Resolvable orthogonal array-based uniform sliced Latin hypercube designs
- Sliced Latin Hypercube Designs
- Nested Latin hypercube designs with sliced structures
- Orthogonal array-based uniform Latin hypercube designs and their construction
Cites work
- An approach to constructing nested space-filling designs for multi-fidelity computer experiments
- Construction of nested (nearly) orthogonal designs for computer experiments
- Construction of nested orthogonal Latin hypercube designs
- Construction of nested space-filling designs
- Construction of nested space-filling designs using difference matrices
- Construction of orthogonal and nearly orthogonal latin hypercube designs from orthogonal designs
- Construction of sliced (nearly) orthogonal Latin hypercube designs
- Construction of sliced orthogonal Latin hypercube designs
- Nested Latin hypercube designs
- Nested lattice sampling: a new sampling scheme derived by randomizing nested orthogonal arrays
- Nested orthogonal array-based Latin hypercube designs
- Nested space-filling designs for computer experiments with two levels of accuracy.
- Orthogonal Array-Based Latin Hypercubes
- Predicting the output from a complex computer code when fast approximations are available
- Sliced Latin Hypercube Designs
- Sliced space-filling designs
- Sudoku-based space-filling designs
Cited in
(29)- Sliced Latin hypercube designs with both branching and nested factors
- Flexible sliced designs for computer experiments
- Construction of mixed orthogonal arrays with high strength
- Sliced symmetrical Latin hypercube designs
- Representative points for distribution recovering
- Construction of improved branching Latin hypercube designs
- Construction of (nearly) orthogonal sliced Latin hypercube designs
- Construction of sliced (nearly) orthogonal Latin hypercube designs
- Construction of sliced maximin-orthogonal Latin hypercube designs
- Bi-directional sliced Latin hypercube designs
- Construction of sliced space-filling designs based on balanced sliced orthogonal arrays
- Construction of nested orthogonal arrays of parallel-flats type
- Sliced space-filling designs
- Resolvable orthogonal array-based uniform sliced Latin hypercube designs
- Orthogonal Array-Based Latin Hypercubes
- Uniform sliced Latin hypercube designs
- Sliced space-filling designs with different levels of two-dimensional uniformity
- Construction of second-order orthogonal sliced Latin hypercube designs
- Sliced Latin Hypercube Designs
- Some results on the construction of sliced orthogonal arrays of parallel-flats type
- General sliced Latin hypercube designs
- Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
- Exploratory ensemble designs for environmental models using k‐extended Latin Hypercubes
- A method of constructing optimal sliced uniform designs under discrete discrepancy
- Sliced Designs for Multi-Platform Online Experiments
- Construction of balanced sliced orthogonal arrays
- Individual sliced minimum aberration designs for multi-platform experiments
- General sliced minimum aberration designs for multi-platform experiments
- A new class of asymptotic maximin distance Latin hypercube designs
This page was built for publication: Sliced Latin hypercube designs via orthogonal arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448810)
