Orthogonal Array-Based Latin Hypercubes

Recommendations

Optimal orthogonal-array-based latin hypercubes
Orthogonal array-based uniform Latin hypercube designs and their construction
Strong orthogonal arrays and associated Latin hypercubes for computer experiments
Construction of orthogonal and nearly orthogonal Latin hypercubes
Sliced Latin hypercube designs via orthogonal arrays
Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
A general rotation method for orthogonal Latin hypercubes
Construction of orthogonal Latin hypercube designs

Cited in

(only showing first 100 items - show all)

Efficient emulators for scattering using eigenvector continuation
Measuring the goodness of orthogonal array discretizations for stochastic programming and stochastic dynamic programming
A novel fractional moments-based maximum entropy method for high-dimensional reliability analysis
Design of computer experiments: space filling and beyond
Group strong orthogonal arrays with appealing two-dimensional space-filling property
Construction of high-dimensional high-separation distance designs
Parametric energy conserving sampling and weighting for the thermal analysis of selective laser melting
Minimal second order saturated designs and their applications to space-filling designs
Resolvable orthogonal array-based uniform sliced Latin hypercube designs
A central limit theorem for marginally coupled designs
Construction of space-filling orthogonal designs
Sliced Latin hypercube designs via orthogonal arrays
Theory and applications of stratification criteria based on space-filling pattern and projection pattern
Strong orthogonal arrays of strength two plus
Algorithms for generating maximin Latin hypercube and orthogonal designs
Follow-up experimental designs for computer models and physical processes
Generalised latent assimilation in heterogeneous reduced spaces with machine learning surrogate models
Representative points for distribution recovering
A maximum projective stratification criterion for selecting space-filling designs
Uncertainty quantification of a computer model for binary black hole formation
Construction of mixed-level column-orthogonal strong orthogonal arrays of strength two plus
Doubly orthogonal equi-squares and sliced orthogonal arrays
Polynomial chaos expansion approach to interest rate models
Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
Column-orthogonal designs with multi-dimensional stratifications
A multiple transferable neural network method with domain decomposition for elliptic interface problems
On construction of strong orthogonal arrays and column-orthogonal strong orthogonal arrays of strength two plus
On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
Maximum expected entropy transformed Latin hypercube designs
CosmicNet. Part I. Physics-driven implementation of neural networks within Einstein-Boltzmann Solvers
Samurai Sudoku-Based Space-Filling Designs for Data Pooling
Space-filling orthogonal arrays of strength two
Algorithmic construction of nearly column-orthogonal designs
A spectral approach for the design of experiments: design, analysis and algorithms
Sudoku Latin Square Sampling for Markov Chain Simulation
Uniform projection designs
On construction of mappable nearly orthogonal arrays with column-orthogonality
A generalized Gaussian process model for computer experiments with binary time series
Calibration for computer experiments with binary responses and application to cell adhesion study
Construction of designs with space-filling and orthogonal property
Rotation designs for experiments in high-bias situations
Level Set Learning with Pseudoreversible Neural Networks for Nonlinear Dimension Reduction in Function Approximation
Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem
Group strong orthogonal arrays and their construction methods
Uniformity of saturated orthogonal arrays
Hamming distances of tight orthogonal arrays
Projection array based designs for computer experiments
Comparing emulation methods for a high-resolution storm surge model
A simple approach to constructing quasi-Sudoku-based sliced space-filling designs
A theorem for selecting oa-based latin hypercubes using a distance criterion
A general theory for orthogonal array based Latin hypercube sampling
Optimal Simulator Selection
LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
Construction of orthogonal arrays of strength three by augmented difference schemes
Setting targets for surrogate-based optimization
Comparison of designs for computer experiments
Strong orthogonal arrays of strength two-plus based on the Addelman-Kempthorne method
A new class of strong orthogonal arrays of strength three
Optimal experimental design: formulations and computations
Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling
A study of orthogonal array-based designs under a broad class of space-filling criteria
Construction of column-orthogonal strong orthogonal arrays
Construction results for strong orthogonal arrays of strength three
An efficient algorithm for constructing optimal design of computer experiments
A framework for controlling sources of inaccuracy in Gaussian process emulation of deterministic computer experiments
Using nonregular designs to generate space-filling designs
Construction of space-filling orthogonal Latin hypercube designs
Pitfalls of using a single criterion for selecting experimental designs
A scientific tour on orthogonal arrays
Rapid design of metamaterials via multitarget Bayesian optimization
Column-orthogonal nearly strong orthogonal arrays
Orthogonal designs for computer experiments constructed from sequences with zero autocorrelation
Nested strong orthogonal arrays
A mathematical framework for the emergence of winners and losers in cell competition
Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
Optimal orthogonal-array-based latin hypercubes
Exploratory ensemble designs for environmental models using k‐extended Latin Hypercubes
Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
Global fitting of the response surface via estimating multiple contours of a simulator
A characterization of strong orthogonal arrays of strength three
Optimum design accounting for the global nonlinear behavior of the model
An isomorphism check for two-level fractional factorial designs
Optimizing Latin hypercube designs by particle swarm
Construction of group strong orthogonal arrays of strength two plus
Evaluation of stochastic flow lines with provisioning of auxiliary material
Visual contrast preserving representation of high dynamic range mathematical functions
Controlling Sources of Inaccuracy in Stochastic Kriging
Orthogonal array-based uniform Latin hypercube designs and their construction
G-SELC: optimization by sequential elimination of level combinations using genetic algorithms and Gaussian processes
Construction of improved branching Latin hypercube designs
An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions
A stratified L₂-discrepancy with application to space-filling designs
A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments
Maximin distance designs based on densest packings
Orthogonal-column Latin hypercube designs with small samples
A model-free shrinking-dimer saddle dynamics for finding saddle point and solution landscape
Space-filling Latin hypercube designs based on randomization restrictions in factorial experiments
A Markov chain Monte Carlo construction of space-filling Latin hypercube samples
Design for Sequential Follow-Up Experiments in Computer Emulations

This page was built for publication: Orthogonal Array-Based Latin Hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4292120)