EconPapers    
Economics at your fingertips  
 

A method of constructing maximin distance designs

Interleaved lattice-based maximin distance designs

Wenlong Li, Min-Qian Liu and Boxin Tang

Biometrika, 2021, vol. 108, issue 4, 845-855

Abstract: SummaryAn attractive type of space-filling design for computer experiments is the class of maximin distance designs. Algorithmic search is commonly used for finding such designs, but this approach becomes ineffective for large problems. Theoretical construction of maximin distance designs is challenging; some results have been obtained recently, often using highly specialized techniques. This article presents an easy-to-use method for constructing maximin distance designs. The method is versatile as it works with any distance measure. The basic idea is to construct large designs from small designs, and the method is effective because the quality of large designs is guaranteed by that of small designs, as evaluated by the maximin distance criterion.

Keywords: Computer experiment; Orthogonal array; Space-filling design (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1093/biomet/asaa089 (application/pdf)
Access to full text is restricted to subscribers.

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: https://EconPapers.repec.org/RePEc:oup:biomet:v:108:y:2021:i:4:p:845-855.

Ordering information: This journal article can be ordered from
https://academic.oup.com/journals

Access Statistics for this article

Biometrika is currently edited by Paul Fearnhead

More articles in Biometrika from Biometrika Trust Oxford University Press, Great Clarendon Street, Oxford OX2 6DP, UK.
Bibliographic data for series maintained by Oxford University Press ().

 
Page updated 2025-03-19
Handle: RePEc:oup:biomet:v:108:y:2021:i:4:p:845-855.