A GENERAL CONSTRUCTION FOR SPACE-FILLING LATIN HYPERCUBES

被引:8
|
作者
Lin, C. Devon [1 ]
Kang, L. [2 ]
机构
[1] Queens Univ, Dept Math & Stat, Kingston, ON K7L 3N6, Canada
[2] IIT, Dept Math, Chicago, IL 60616 USA
基金
加拿大自然科学与工程研究理事会;
关键词
Completely resolvable; computer experiment; fractional factorial design; orthogonal array; orthogonality; projection; DESIGNS;
D O I
10.5705/ss.202015.0019
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We propose a general method for constructing Latin hypercubes of flexible run sizes for computer experiments. The method makes use of arrays with a special structure and Latin hypercubes. By using different such arrays and Latin hyper-cubes, the proposed method produces various types of Latin hypercubes including orthogonal and nearly orthogonal Latin hypercubes, sliced Latin hypercubes, and Latin hypercubes in marginally coupled designs. In addition, the proposed algebraic design construction is particularly efficient as it does not need any optimization search but still produces Latin hypercubes whose space-filling properties are comparable with those generated by the common and latest methods in the literature.
引用
收藏
页码:675 / 690
页数:16
相关论文
共 50 条
  • [41] Space-filling Latin hypercube designs based on randomization restrictions in factorial experiments
    Ranjan, Pritam
    Spencer, Neil
    STATISTICS & PROBABILITY LETTERS, 2014, 94 : 239 - 247
  • [42] Construction of Multi-level Space-filling Designs via Code Mappings
    Hui-li Xue
    Xing-you Huang
    Hong-yi Li
    Acta Mathematicae Applicatae Sinica, English Series, 2022, 38 : 24 - 36
  • [43] CONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS
    Ai, Mingyao
    Jiang, Bochuan
    Li, Kang
    STATISTICA SINICA, 2014, 24 (04) : 1685 - 1702
  • [44] A Novel Construction Method for n-Dimensional Hilbert Space-Filling Curves
    Chen, Chih-Sheng
    Lin, Shen-Yi
    Fan, Min-Hsuan
    Huang, Chua-Huang
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (07): : 1807 - 1815
  • [45] Construction of space-filling designs using WSP algorithm for high dimensional spaces
    Santiago, J.
    Claeys-Bruno, M.
    Sergent, M.
    CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 2012, 113 : 26 - 31
  • [46] RANDOM SPACE-FILLING BY NUCLEATION AND GROWTH
    MEYER, HJ
    LACMANN, R
    ZIMMERMANN, H
    JOURNAL OF CRYSTAL GROWTH, 1994, 135 (3-4) : 571 - 586
  • [47] Space-filling curve RFID tags
    Mcvay, J
    Hoorfar, A
    Engheta, N
    2006 IEEE RADIO AND WIRELESS SYMPOSIUM, PROCEEDINGS, 2006, : 199 - 202
  • [48] Space-filling branes of gravitational ancestry
    Bunster, Claudio
    Perez, Alfredo
    PHYSICAL REVIEW D, 2015, 92 (12):
  • [49] A General Space-filling Curve Algorithm for Partitioning 2D Meshes
    Sasidharan, Aparna
    Dennis, John M.
    Snir, Marc
    2015 IEEE 17TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2015 IEEE 7TH INTERNATIONAL SYMPOSIUM ON CYBERSPACE SAFETY AND SECURITY, AND 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS (ICESS), 2015, : 875 - 879
  • [50] Construction of Multi-level Space-filling Designs via Code Mappings
    Hui-li XUE
    Xing-you HUANG
    Hong-yi LI
    Acta Mathematicae Applicatae Sinica, 2022, 38 (01) : 24 - 36