Two general extension algorithms of Latin hypercube sampling

DOI10.1155/2015/450492zbMath1395.62235OpenAlexW1558925770WikidataQ59118605 ScholiaQ59118605MaRDI QIDQ1665696

Y. Aharonov

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/450492

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15)

Related Items (4)

A novel extension algorithm for optimized Latin hypercube sampling ⋮ A fast general extension algorithm of Latin hypercube sampling ⋮ Local optimization of black-box functions with high or infinite-dimensional inputs: application to nuclear safety ⋮ A non-conventional hybrid numerical approach with multi-dimensional random sampling for cocaine abuse in Spain

Cites Work

• Space-filling Latin hypercube designs for computer experiments
• Nested orthogonal array-based Latin hypercube designs
• Nested Latin hypercube designs
• Exploratory ensemble designs for environmental models using k‐extended Latin Hypercubes

This page was built for publication: Two general extension algorithms of Latin hypercube sampling