Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
DOI10.1016/J.CMA.2017.05.020zbMATH Open1439.62181OpenAlexW2646914084MaRDI QIDQ2309986FDOQ2309986
Authors: Z. P. Wu, Donghui Wang, Patrick N. Okolo, Kun Zhao, Wei-Hua Zhang 
Publication date: 6 April 2020
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cma.2017.05.020
Recommendations
- Space-filling Latin hypercube designs for computer experiments
- Strong orthogonal arrays and associated Latin hypercubes for computer experiments
- Optimal and orthogonal Latin hypercube designs for computer experiments
- A new class of Latin hypercube for computer experiments
- Optimal orthogonal-array-based latin hypercubes
- Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
- Orthogonal space-filling designs for computer experiments
Factorial statistical designs (62K15) Sequential statistical design (62L05) Analysis of algorithms (68W40)
Cites Work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
- Exploratory designs for computational experiments
- A generalized discrepancy and quadrature error bound
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Construction of orthogonal Latin hypercube designs
- Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
- A study on algorithms for optimization of Latin hypercubes
- Finding maximin Latin hypercube designs by iterated local search heuristics
- Optimal Latin-hypercube designs for computer experiments
- An efficient algorithm for constructing optimal design of computer experiments
- Maximin Latin Hypercube Designs in Two Dimensions
- Orthogonal-maximin Latin hypercube designs
- Sampling plans based on balanced incomplete block designs for evaluating the importance of computer model inputs
- Centered \(L_2\)-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
- Orthogonal-column Latin hypercube designs with small samples
- Algorithms for generating maximin Latin hypercube and orthogonal designs
- An algorithm for fast optimal Latin hypercube design of experiments
- Optimizing Latin hypercube designs by particle swarm
- REFINED LATINIZED STRATIFIED SAMPLING: A ROBUST SEQUENTIAL SAMPLE SIZE EXTENSION METHODOLOGY FOR HIGH-DIMENSIONAL LATIN HYPERCUBE AND STRATIFIED DESIGNS
- A note on near-orthogonal Latin hypercubes with good space-filling properties
- An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing
Cited In (7)
- An adaptive SVD-Krylov reduced order model for surrogate based structural shape optimization through isogeometric boundary element method
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- Isovolumetric adaptations to space-filling design of experiments
- A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm
- A fast optimal Latin hypercube design method using an improved translational propagation algorithm
- A novel sensitivity index for analyzing the response of numerical models with interval inputs
- Variance-based adaptive sequential sampling for polynomial chaos expansion
This page was built for publication: Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2309986)
