EconPapers    
Economics at your fingertips  
 

Nested Maximin Latin Hypercube Designs

Gijs Rennen (), B.G.M. Husslage, Edwin Robert van Dam and D. den Hertog
Additional contact information
D. den Hertog: Tilburg University, Center for Economic Research

No 2009-06, Discussion Paper from Tilburg University, Center for Economic Research

Abstract: In the field of design of computer experiments (DoCE), Latin hypercube designs are frequently used for the approximation and optimization of black-boxes. In certain situations, we need a special type of designs consisting of two separate designs, one being a subset of the other. These nested designs can be used to deal with training and test sets, models with different levels of accuracy, linking parameters, and sequential evaluations. In this paper, we construct nested maximin Latin hypercube designs for up to ten dimensions. We show that different types of grids should be considered when constructing nested designs and discuss how to determine which grid to use for a specific application. To determine nested maximin designs for dimensions higher than two, four different variants of the ESE-algorithm of Jin et al. (2005) are introduced and compared. In the appendix, maximin distances for different numbers of points are provided; the corresponding nested maximin designs can be found on the website http://www.spacefillingdesigns.nl.

JEL-codes: C90 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cmp
Date: 2009
View list of references

Downloads: (external link)
http://arno.uvt.nl/show.cgi?fid=90382 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:dgr:kubcen:200906

Access Statistics for this paper

More papers in Discussion Paper from Tilburg University, Center for Economic Research
Series data maintained by Corry Stuyts ().

 
Page updated 2009-11-23
Handle: RePEc:dgr:kubcen:200906