Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
From MaRDI portal
Recommendations
Cited in
(80)- Construction of nested space-filling designs
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Generalized good lattice point sets
- MILP models for the selection of a small set of well-distributed points
- Uniform projection designs
- Construction of column-orthogonal designs for computer experiments
- Setting targets for surrogate-based optimization
- A new class of Latin hypercube designs with high-dimensional hidden projective uniformity
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Column-orthogonal designs with multi-dimensional stratifications
- Connecting U-type designs before and after level permutations and expansions
- Flexible sliced Latin hypercube designs with slices of different sizes
- A study of orthogonal array-based designs under a broad class of space-filling criteria
- Construction of column-orthogonal strong orthogonal arrays
- Using nonregular designs to generate space-filling designs
- On the construction of nested orthogonal Latin hypercube designs
- Column-orthogonal nearly strong orthogonal arrays
- Rapid design of metamaterials via multitarget Bayesian optimization
- Construction results for strong orthogonal arrays of strength three
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Least squares polynomial chaos expansion: a review of sampling strategies
- A note on near-orthogonal Latin hypercubes with good space-filling properties
- An overview of the design and analysis of simulation experiments for sensitivity analysis
- Construction of sliced (nearly) orthogonal Latin hypercube designs
- A general theory for orthogonal array based Latin hypercube sampling
- A note on the construction of orthogonal Latin hypercube designs
- Surrogate-based methods
- Recent advances in space-mapping-based modeling of microwave devices
- Orthogonal Latin hypercube designs with special reference to four factors
- Pitfalls of using a single criterion for selecting experimental designs
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Orthogonal Array-Based Latin Hypercubes
- Some new classes of orthogonal Latin hypercube designs
- Accurate emulators for large-scale computer experiments
- U-type and column-orthogonal designs for computer experiments
- Construction of second-order orthogonal sliced Latin hypercube designs
- PLS-Based Multivariate Metamodeling of Dynamic Systems
- A fast optimal Latin hypercube design method using an improved translational propagation algorithm
- LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
- Algorithmic construction of nearly column-orthogonal designs
- Optimal progressive interval censoring plan under accelerated life test with limited budget
- On second order orthogonal Latin hypercube designs
- Nearly column-orthogonal designs based on leave-one-out good lattice point sets
- A new class of Latin hypercube for computer experiments
- Algorithms for generating maximin Latin hypercube and orthogonal designs
- Maximum expected entropy transformed Latin hypercube designs
- On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
- Samurai Sudoku-Based Space-Filling Designs for Data Pooling
- Construction of nearly orthogonal Latin hypercube designs
- Construction of nearly orthogonal Latin hypercube designs
- A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs
- A unifying implementation of stratum (aka strong) orthogonal arrays
- Construction of orthogonal general sliced Latin hypercube designs
- A new rotation method for constructing orthogonal Latin hypercube designs
- Isovolumetric adaptations to space-filling design of experiments
- Construction of maximin L₁-distance Latin hypercube designs
- Orthogonal designs for computer experiments
- Block-circulant matrices for constructing optimal Latin hypercube designs
- A review on design inspired subsampling for big data
- Controlling Sources of Inaccuracy in Stochastic Kriging
- Strong orthogonal Latin hypercubes for computer experiments
- Mixed-level designs with orthogonality and relatively optimal run order
- Three-level designs for definitive screening with minimum correlation among columns that correspond to pure quadratic effects
- Non-intrusive uncertainty quantification using reduced cubature rules
- Orthogonal Latin hypercube designs with hidden low-dimensional projection
- Grouped orthogonal arrays for computer experiments with grouped inputs
- A new class of orthogonal designs with good low dimensional space-filling properties
- Constructing orthogonal maximin distance uniform projection designs for computer experiments
- Sequentially extending space-filling experimental designs by optimally permuting and stacking columns of the design matrix
- The optimization of space-filling and orthogonality for Latin hypercube design using a local search-based NSGA-II
- Orthogonal designs for computer experiments constructed from sequences with zero autocorrelation
- A Fisher-KPP problem with nonlocal free boundary: numerical simulations and machine learning classification for population dynamics
- Construction of column-orthogonal strong orthogonal arrays of strength 3
- Construction of grouped (nearly) orthogonal Latin hypercube designs
- Construction of Asymmetric Nested Orthogonal Arrays
- Musings on constructions of optimal Latin hypercube designs with flexible sizes
- Orthogonal-column Latin hypercube designs with small samples
- A new and flexible method for constructing designs for computer experiments
- Construction of orthogonal Latin hypercube designs with flexible run sizes
- Orthogonal Latin hypercube designs from generalized orthogonal designs
This page was built for publication: Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4541190)
