A fast general extension algorithm of Latin hypercube sampling

DOI10.1080/00949655.2017.1368080OpenAlexW2746180338MaRDI QIDQ5107008

No author found.

Publication date: 22 April 2020

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949655.2017.1368080

zbMATH Keywords

upper and lower boundsLatin hypercube samplingblock matrixtime consumptionfast general extension

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (1)

Distributed Load Identification for Uncertain Structure Based on LHS-GA and Improved L-Curve Method

Cites Work

• Two general extension algorithms of Latin hypercube sampling
• Slope reliability analysis using surrogate models via new support vector machines with swarm intelligence
• A Note on the Construction of Orthogonal Latin Hypercube Designs
• Nested orthogonal array-based Latin hypercube designs
• Nested Latin hypercube designs
• A randomized orthogonal array-based procedure for the estimation of first- and second-order Sobol' indices
• Sequentially Refined Latin Hypercube Designs: Reusing Every Point

This page was built for publication: A fast general extension algorithm of Latin hypercube sampling