IDEAS home Printed from https://ideas.repec.org/a/spr/stpapr/v65y2024i1d10.1007_s00362-023-01402-7.html
   My bibliography  Save this article

Several new classes of space-filling designs

Author

Listed:
  • Wenlong Li

    (Beijing Institute of Technology)

  • Min-Qian Liu

    (LPMC & KLMDASR, Nankai University)

  • Jian-Feng Yang

    (LPMC & KLMDASR, Nankai University)

Abstract

Mappable nearly orthogonal arrays were recently proposed as a new class of space-filling designs for computer experiments. Inspired by mappable nearly orthogonal arrays, we propose several new classes of space-filling designs. The corresponding construction methods are provided. The resulting designs are more space-filling than mappable nearly orthogonal arrays while accommodating a large number of factors. In addition to the space-filling properties, the column orthogonality is also desirable for designs of computer experiments. Among the new constructed designs, one class is column-orthogonal, and the other two classes, providing many new column-orthogonal designs, are nearly column-orthogonal in the sense that each column is column-orthogonal to a large proportion of the other columns. The constructed designs are good choices for computer experiments due to their attractive space-filling properties and column orthogonality. The proposed construction methods are flexible in the choices of an orthogonal array and/or a strong orthogonal array and their usefulness is appealing. Many newly constructed space-filling designs are tabulated. The expansive replacement method and the generalized doubling play key roles in the constructions.

Suggested Citation

  • Wenlong Li & Min-Qian Liu & Jian-Feng Yang, 2024. "Several new classes of space-filling designs," Statistical Papers, Springer, vol. 65(1), pages 357-379, February.
    • Handle: RePEc:spr:stpapr:v:65:y:2024:i:1:d:10.1007_s00362-023-01402-7
    DOI: 10.1007/s00362-023-01402-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00362-023-01402-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00362-023-01402-7?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. Rahul Mukerjee & Fasheng Sun & Boxin Tang, 2014. "Nearly orthogonal arrays mappable into fully orthogonal arrays," Biometrika, Biometrika Trust, vol. 101(4), pages 957-963.
    2. Yongdao Zhou & Boxin Tang, 2019. "Column-orthogonal strong orthogonal arrays of strength two plus and three minus," Biometrika, Biometrika Trust, vol. 106(4), pages 997-1004.
    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. 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.
    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. 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.
    3. Wang, Chunyan & Lin, Dennis K.J., 2024. "Strong orthogonal Latin hypercubes for computer experiments," Computational Statistics & Data Analysis, Elsevier, vol. 198(C).
    4. Pengnan Li & Chunjie Wang & Bochuan Jiang, 2025. "Group strong orthogonal arrays and their construction methods," Statistical Papers, Springer, vol. 66(3), pages 1-30, April.
    5. Jiang, Bochuan & Wang, Zuzheng & Wang, Yaping, 2021. "Strong orthogonal arrays of strength two-plus based on the Addelman–Kempthorne method," Statistics & Probability Letters, Elsevier, vol. 175(C).
    6. Mengmeng Liu & Min-Qian Liu & Jinyu Yang, 2022. "Construction of group strong orthogonal arrays of strength two plus," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(6), pages 657-674, August.
    7. Meng-Meng Liu & Min-Qian Liu & Jin-Yu Yang, 2024. "Strongly Coupled Designs for Computer Experiments with Both Qualitative and Quantitative Factors," Mathematics, MDPI, vol. 13(1), pages 1-15, December.
    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. Li, Hui & Yang, Liuqing & Liu, Min-Qian, 2022. "Construction of space-filling orthogonal Latin hypercube designs," Statistics & Probability Letters, Elsevier, vol. 180(C).
    10. Liangwei Qi & Yongdao Zhou, 2025. "Minimum $$\theta $$ θ -aberration criterion for designs with qualitative and quantitative factors," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 88(1), pages 99-117, January.
    11. Grömping, Ulrike, 2023. "A unifying implementation of stratum (aka strong) orthogonal arrays," Computational Statistics & Data Analysis, Elsevier, vol. 183(C).
    12. Chunwei Zheng & Wenlong Li & Jian-Feng Yang, 2024. "Nested strong orthogonal arrays," Statistical Papers, Springer, vol. 65(9), pages 5503-5528, December.
    13. 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.
    14. 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.
    15. Zujun Ou & Minghui Zhang & Hongyi Li, 2023. "Triple Designs: A Closer Look from Indicator Function," Mathematics, MDPI, vol. 11(3), pages 1-12, February.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:spr:stpapr:v:65:y:2024:i:1:d:10.1007_s00362-023-01402-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.