IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v198y2024ics0167947324000835.html
   My bibliography  Save this article

Strong orthogonal Latin hypercubes for computer experiments

Author

Listed:
  • Wang, Chunyan
  • Lin, Dennis K.J.

Abstract

Orthogonal Latin hypercubes are widely used for computer experiments. They achieve both orthogonality and the maximum one-dimensional stratification property. When two-factor (and higher-order) interactions are active, two- and three-dimensional stratifications are also important. Unfortunately, little is known about orthogonal Latin hypercubes with good two (and higher)–dimensional stratification properties. A method is proposed for constructing a new class of orthogonal Latin hypercubes whose columns can be partitioned into groups, such that the columns from different groups maintain two- and three-dimensional stratification properties. The proposed designs perform well under almost all popular criteria (e.g., the orthogonality, stratification, and maximin distance criterion). They are the most ideal designs for computer experiments. The construction method can be straightforward to implement, and the relevant theoretical supports are well established. The proposed strong orthogonal Latin hypercubes are tabulated for practical needs.

Suggested Citation

  • Wang, Chunyan & Lin, Dennis K.J., 2024. "Strong orthogonal Latin hypercubes for computer experiments," Computational Statistics & Data Analysis, Elsevier, vol. 198(C).
    • Handle: RePEc:eee:csdana:v:198:y:2024:i:c:s0167947324000835
    DOI: 10.1016/j.csda.2024.107999
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947324000835
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2024.107999?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Qian Xiao & Hongquan Xu, 2017. "Construction of maximin distance Latin squares and related Latin hypercube designs," Biometrika, Biometrika Trust, vol. 104(2), pages 455-464.
    2. Rahul Mukerjee & Fasheng Sun & Boxin Tang, 2014. "Nearly orthogonal arrays mappable into fully orthogonal arrays," Biometrika, Biometrika Trust, vol. 101(4), pages 957-963.
    3. Yuanzhen He & Boxin Tang, 2013. "Strong orthogonal arrays and associated Latin hypercubes for computer experiments," Biometrika, Biometrika Trust, vol. 100(1), pages 254-260.
    4. Wenlong Li & Min-Qian Liu & Boxin Tang, 2021. "A method of constructing maximin distance designs [Interleaved lattice-based maximin distance designs]," Biometrika, Biometrika Trust, vol. 108(4), pages 845-855.
    5. Fasheng Sun & Min-Qian Liu & Dennis K. J. Lin, 2009. "Construction of orthogonal Latin hypercube designs," Biometrika, Biometrika Trust, vol. 96(4), pages 971-974.
    6. David M. Steinberg & Dennis K. J. Lin, 2006. "A construction method for orthogonal Latin hypercube designs," Biometrika, Biometrika Trust, vol. 93(2), pages 279-288, June.
    7. Yaping Wang & Fasheng Sun & Hongquan Xu, 2022. "On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 117(537), pages 375-385, January.
    8. Fasheng Sun & Boxin Tang, 2017. "A Method of Constructing Space-Filling Orthogonal Designs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 112(518), pages 683-689, April.
    9. V. Roshan Joseph & Evren Gul & Shan Ba, 2015. "Maximum projection designs for computer experiments," Biometrika, Biometrika Trust, vol. 102(2), pages 371-380.
    10. Fasheng Sun & Boxin Tang, 2017. "A general rotation method for orthogonal Latin hypercubes," Biometrika, Biometrika Trust, vol. 104(2), pages 465-472.
    11. C. Devon Lin & Rahul Mukerjee & Boxin Tang, 2009. "Construction of orthogonal and nearly orthogonal Latin hypercubes," Biometrika, Biometrika Trust, vol. 96(1), pages 243-247.
    12. Derek Bingham & Randy R. Sitter & Boxin Tang, 2009. "Orthogonal and nearly orthogonal designs for computer experiments," Biometrika, Biometrika Trust, vol. 96(1), pages 51-65.
    13. Yongdao Zhou & Hongquan Xu, 2015. "Space-filling properties of good lattice point sets," Biometrika, Biometrika Trust, vol. 102(4), pages 959-966.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Song-Nan Liu & Min-Qian Liu & Jin-Yu Yang, 2023. "Construction of Column-Orthogonal Designs with Two-Dimensional Stratifications," Mathematics, MDPI, vol. 11(6), pages 1-27, March.
    2. Su, Zheren & Wang, Yaping & Zhou, Yingchun, 2020. "On maximin distance and nearly orthogonal Latin hypercube designs," Statistics & Probability Letters, Elsevier, vol. 166(C).
    3. Wenlong Li & Min-Qian Liu & Jian-Feng Yang, 2022. "Construction of column-orthogonal strong orthogonal arrays," Statistical Papers, Springer, vol. 63(2), pages 515-530, April.
    4. Fasheng Sun & Boxin Tang, 2017. "A Method of Constructing Space-Filling Orthogonal Designs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 112(518), pages 683-689, April.
    5. Li, Hui & Yang, Liuqing & Liu, Min-Qian, 2022. "Construction of space-filling orthogonal Latin hypercube designs," Statistics & Probability Letters, Elsevier, vol. 180(C).
    6. Tonghui Pang & Yan Wang & Jian-Feng Yang, 2022. "Asymptotically optimal maximin distance Latin hypercube designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(4), pages 405-418, May.
    7. Stelios Georgiou & Christos Koukouvinos & Min-Qian Liu, 2014. "U-type and column-orthogonal designs for computer experiments," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 77(8), pages 1057-1073, November.
    8. Zong-Feng Qi & Xue-Ru Zhang & Yong-Dao Zhou, 2018. "Generalized good lattice point sets," Computational Statistics, Springer, vol. 33(2), pages 887-901, June.
    9. Ifigenia Efthimiou & Stelios Georgiou & Min-Qian Liu, 2015. "Construction of nearly orthogonal Latin hypercube designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 78(1), pages 45-57, January.
    10. Mandal, B.N. & Dash, Sukanta & Parui, Shyamsundar & Parsad, Rajender, 2016. "Orthogonal Latin hypercube designs with special reference to four factors," Statistics & Probability Letters, Elsevier, vol. 119(C), pages 181-185.
    11. Weiping Zhou & Jinyu Yang & Min-Qian Liu, 2021. "Construction of orthogonal marginally coupled designs," Statistical Papers, Springer, vol. 62(4), pages 1795-1820, August.
    12. Bing Guo & Xiao-Rong Li & Min-Qian Liu & Xue Yang, 2023. "Construction of orthogonal general sliced Latin hypercube designs," Statistical Papers, Springer, vol. 64(3), pages 987-1014, June.
    13. Ru Yuan & Bing Guo & Min-Qian Liu, 2021. "Flexible sliced Latin hypercube designs with slices of different sizes," Statistical Papers, Springer, vol. 62(3), pages 1117-1134, June.
    14. Li Gu & Jian-Feng Yang, 2013. "Construction of nearly orthogonal Latin hypercube designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 76(6), pages 819-830, August.
    15. Sukanta Dash & Baidya Nath Mandal & Rajender Parsad, 2020. "On the construction of nested orthogonal Latin hypercube designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 83(3), pages 347-353, April.
    16. Parker, J.D. & Lucas, T.W. & Carlyle, W.M., 2024. "Sequentially extending space-filling experimental designs by optimally permuting and stacking columns of the design matrix," European Journal of Operational Research, Elsevier, vol. 319(2), pages 600-610.
    17. Chen, Hao & Yang, Jinyu & Lin, Dennis K.J. & Liu, Min-Qian, 2019. "Sliced Latin hypercube designs with both branching and nested factors," Statistics & Probability Letters, Elsevier, vol. 146(C), pages 124-131.
    18. Yuxin Sun & Wenjun Liu & Ye Tian, 2024. "Projection-Uniform Subsampling Methods for Big Data," Mathematics, MDPI, vol. 12(19), pages 1-16, September.
    19. Wang, Sumin & Wang, Dongying & Sun, Fasheng, 2019. "A central limit theorem for marginally coupled designs," Statistics & Probability Letters, Elsevier, vol. 146(C), pages 168-174.
    20. Liuqing Yang & Yongdao Zhou & Min-Qian Liu, 2021. "Maximin distance designs based on densest packings," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 84(5), pages 615-634, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:198:y:2024:i:c:s0167947324000835. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.