Optimal orthogonal-array-based latin hypercubes


Leary, Stephen, Bhaskar, Atul and Keane, Andy (2003) Optimal orthogonal-array-based latin hypercubes. Journal of Applied Statistics, 30, (5), 585-598. (doi:10.1080/0266476032000053691).

Download

[img]
Preview
PDF - Post print
Download (1870Kb)

Description/Abstract

The use of optimal orthogonal array latin hypercube designs is proposed. Orthogonal arrays were proposed for constructing latin hypercube designs by Tang (1993). Such designs generally have better space filling properties than random latin hypercube designs. Even so, these designs do not necessarily fill the space particularly well. As a result, we consider orthogonal-array-based latin hypercube designs that try to achieve optimality in some sense. Optimization is performed by adapting strategies found in Morris & Mitchell (1995) and Ye et al. (2000). The strategies here search only orthogonal-array-based latin hypercube designs and, as a result, optimal designs are found in a more efficient fashion. The designs found are in general agreement with existing optimal designs reported elsewhere.

Item Type: Article
ISSNs: 0266-4763 (print)
Related URLs:
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > TA Engineering (General). Civil engineering (General)
Divisions: University Structure - Pre August 2011 > School of Engineering Sciences
ePrint ID: 22393
Date Deposited: 20 Mar 2006
Last Modified: 27 Mar 2014 18:11
URI: http://eprints.soton.ac.uk/id/eprint/22393

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics