Orthogonal Array-Based Latin Hypercubes
From MaRDI portal
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)- G-SELC: optimization by sequential elimination of level combinations using genetic algorithms and Gaussian processes
- Construction of nested space-filling designs
- Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
- On the asymptotic distribution of scrambled net quadrature.
- Calibration for computer experiments with binary responses and application to cell adhesion study
- A generalized Gaussian process model for computer experiments with binary time series
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Polynomial chaos expansion approach to interest rate models
- Sequential design strategies for mean response surface metamodeling via stochastic kriging with adaptive exploration and exploitation
- A central limit theorem for marginally coupled designs
- Uniform projection designs
- Strong orthogonal arrays of strength two plus
- A combinatorial central limit theorem for randomized orthogonal array sampling 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
- A novel fractional moments-based maximum entropy method for high-dimensional reliability analysis
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Computer experiments: a review
- Comparing and generating Latin hypercube designs in kriging models
- Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem
- Column-orthogonal designs with multi-dimensional stratifications
- Maximin distance designs based on densest packings
- Construction of mixed orthogonal arrays with high strength
- Connecting U-type designs before and after level permutations and expansions
- Uncertainty quantification of a computer model for binary black hole formation
- A study of orthogonal array-based designs under a broad class of space-filling criteria
- Generalised latent assimilation in heterogeneous reduced spaces with machine learning surrogate models
- Representative points for distribution recovering
- 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
- Construction of improved branching Latin hypercube designs
- Using nonregular designs to generate space-filling designs
- Construction of orthogonal arrays of strength three by augmented difference schemes
- Block-regularized repeated learning-testing for estimating generalization error
- Parameterization, geometric modeling, and isogeometric analysis of tricuspid valves
- Column-orthogonal nearly strong orthogonal arrays
- Uniformity of saturated orthogonal arrays
- Strong orthogonal arrays of strength two-plus based on the Addelman-Kempthorne method
- Construction of space-filling orthogonal Latin hypercube designs
- Rapid design of metamaterials via multitarget Bayesian optimization
- Batch sequential designs for computer experiments
- Construction results for strong orthogonal arrays of strength three
- Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling
- Global fitting of the response surface via estimating multiple contours of a simulator
- Marginally coupled designs for two-level qualitative factors
- A simple approach to constructing quasi-Sudoku-based sliced space-filling designs
- Construction of marginally coupled designs by subspace theory
- Alternative sampling methods for estimating multivariate normal probabilities
- Sliced Latin hypercube designs via orthogonal arrays
- An isomorphism check for two-level fractional factorial designs
- An efficient algorithm for constructing optimal design of computer experiments
- Factor analysis with (mixed) observed and latent variables in the exponential family
- Comparison of designs for computer experiments
- Construction of uniform projection designs via level permutation and expansion
- Centered L₂-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
- Measuring the goodness of orthogonal array discretizations for stochastic programming and stochastic dynamic programming
- A general theory for orthogonal array based Latin hypercube sampling
- Visual contrast preserving representation of high dynamic range mathematical functions
- A framework for controlling sources of inaccuracy in Gaussian process emulation of deterministic computer experiments
- On the instability issue of gradient-enhanced Gaussian process emulators for computer experiments
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
- Construction of uniform U-designs
- Construction of nested orthogonal arrays of parallel-flats type
- Pitfalls of using a single criterion for selecting experimental designs
- Optimal orthogonal-array-based latin hypercubes
- Efficient bootstrap methods: A review
- Subset selection from large datasets for kriging modeling
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions
- Resolvable orthogonal array-based uniform sliced Latin hypercube designs
- Projection array based designs for computer experiments
- Accurate emulators for large-scale computer experiments
- A spectral approach for the design of experiments: design, analysis and algorithms
- A characterization of strong orthogonal arrays of strength three
- On the construction of nested space-filling designs
- Optimum design accounting for the global nonlinear behavior of the model
- Space-filling Latin hypercube designs based on randomization restrictions in factorial experiments
- Sliced space-filling designs with different levels of two-dimensional uniformity
- A theorem for selecting oa-based latin hypercubes using a distance criterion
- Minimal second order saturated designs and their applications to space-filling designs
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
- Some results on the construction of sliced orthogonal arrays of parallel-flats type
- Algorithmic construction of nearly column-orthogonal designs
- Construction of strong group-orthogonal arrays
- The geometry of diagonal groups
- Sudoku Latin Square Sampling for Markov Chain Simulation
- Nearly column-orthogonal designs based on leave-one-out good lattice point sets
- Design based incomplete U-statistics
- Space-filling orthogonal arrays of strength two
- A scientific tour on orthogonal arrays
- Algorithms for generating maximin Latin hypercube and orthogonal designs
- Follow-up experimental designs for computer models and physical processes
- Orthogonal array-based uniform Latin hypercube designs and their construction
- A Uniform Bound on a Combinatorial Central Limit Theorem for Randomized Orthogonal Array Sampling Designs
- Maximum expected entropy transformed Latin hypercube designs
- Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
- CosmicNet. Part I. Physics-driven implementation of neural networks within Einstein-Boltzmann Solvers
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)
