IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v33y2018i2d10.1007_s00180-017-0737-z.html
   My bibliography  Save this article

Generalized good lattice point sets

Author

Listed:
  • Zong-Feng Qi

    (State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System)

  • Xue-Ru Zhang

    (Sichuan University)

  • Yong-Dao Zhou

    (Sichuan University)

Abstract

Good lattice point (GLP) sets are frequently used in quasi-Monte Carlo method and computer experiments. However, the space-filling property of GLP sets needs to be improved especially when the number of factors is large. This paper shows that the generalized GLP (GGLP) sets, constructed simply and fast by the linear level permutation of the GLP sets, have better space-filling property than the GLP sets and the orthogonal Latin hypercube designs (OLHD) in the sense of maximin distance criterion and uniformity criterion, especially for high dimensional cases. Unlike the OLHD, the number of runs of the GGLP sets can be chosen as any integer. It is also shown that the GLP sets are better than Latin hypercube designs as the starting design for linear and nonlinear level permutation. The GGLP sets are recommended for the designs with large number of factors and/or large number of runs.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:compst:v:33:y:2018:i:2:d:10.1007_s00180-017-0737-z
    DOI: 10.1007/s00180-017-0737-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-017-0737-z
    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/s00180-017-0737-z?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. 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.
    2. 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.
    3. Winker, Peter & Fang, Kai-Tai, 1995. "Application of threshold accepting to the evaluation of the discrepancy of a set of points," Discussion Papers, Series II 248, University of Konstanz, Collaborative Research Centre (SFB) 178 "Internationalization of the Economy".
    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.
    5. Yong-Dao Zhou & Hongquan Xu, 2014. "Space-Filling Fractional Factorial Designs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 109(507), pages 1134-1144, September.
    6. 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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Li, Hui & Yang, Liuqing & Liu, Min-Qian, 2022. "Construction of space-filling orthogonal Latin hypercube designs," Statistics & Probability Letters, Elsevier, vol. 180(C).
    8. 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.
    9. Su, Zheren & Wang, Yaping & Zhou, Yingchun, 2020. "On maximin distance and nearly orthogonal Latin hypercube designs," Statistics & Probability Letters, Elsevier, vol. 166(C).
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    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. Weiping Zhou & Jinyu Yang & Min-Qian Liu, 2021. "Construction of orthogonal marginally coupled designs," Statistical Papers, Springer, vol. 62(4), pages 1795-1820, August.
    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. Qing Liu & Neeraj Arora, 2011. "Efficient Choice Designs for a Consider-Then-Choose Model," Marketing Science, INFORMS, vol. 30(2), pages 321-338, 03-04.
    18. A. M. Elsawah & Hong Qin, 2016. "Asymmetric uniform designs based on mixture discrepancy," Journal of Applied Statistics, Taylor & Francis Journals, vol. 43(12), pages 2280-2294, September.
    19. A. M. Elsawah, 2021. "Multiple doubling: a simple effective construction technique for optimal two-level experimental designs," Statistical Papers, Springer, vol. 62(6), pages 2923-2967, December.
    20. Bochuan Jiang & Yaping Wang & Mingyao Ai, 2022. "Search for minimum aberration designs with uniformity," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 74(2), pages 271-287, April.

    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:compst:v:33:y:2018:i:2:d:10.1007_s00180-017-0737-z. 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.