Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments

DOI10.1016/j.cma.2017.05.020zbMath1439.62181OpenAlexW2646914084MaRDI QIDQ2309986

Patrick N. Okolo, Donghui Wang, Kun Zhao, Z. Wu, 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

zbMATH Keywords

Latin hypercube designspace-filling designnear-orthogonal designsequentially enlarging

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Factorial statistical designs (62K15) Sequential statistical design (62L05)

Related Items (6)

An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design ⋮ A fast optimal Latin hypercube design method using an improved translational propagation algorithm ⋮ An adaptive SVD-Krylov reduced order model for surrogate based structural shape optimization through isogeometric boundary element method ⋮ Isovolumetric adaptations to space-filling design of experiments ⋮ Variance-based adaptive sequential sampling for polynomial chaos expansion ⋮ A novel sensitivity index for analyzing the response of numerical models with interval inputs

Cites Work

• Unnamed Item
• Exploratory designs for computational experiments
• Algorithms for generating maximin Latin hypercube and orthogonal designs
• Optimizing Latin hypercube designs by particle swarm
• Orthogonal-column Latin hypercube designs with small samples
• Finding maximin Latin hypercube designs by iterated local search heuristics
• Optimal Latin-hypercube designs for computer experiments
• Algorithmic construction of optimal symmetric Latin hypercube designs.
• A note on near-orthogonal Latin hypercubes with good space-filling properties
• An efficient algorithm for constructing optimal design of computer experiments
• Sampling plans based on balanced incomplete block designs for evaluating the importance of computer model inputs
• A study on algorithms for optimization of Latin hypercubes
• Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
• An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Maximin Latin Hypercube Designs in Two Dimensions
• An algorithm for fast optimal Latin hypercube design of experiments
• Construction of orthogonal Latin hypercube designs
• A generalized discrepancy and quadrature error bound
• Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
• REFINED LATINIZED STRATIFIED SAMPLING: A ROBUST SEQUENTIAL SAMPLE SIZE EXTENSION METHODOLOGY FOR HIGH-DIMENSIONAL LATIN HYPERCUBE AND STRATIFIED DESIGNS
• Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates

This page was built for publication: Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments