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

Sphere packing design for experiments with mixtures

Author

Listed:
  • Xiong, Zikang
  • Liu, Liwei
  • Ning, Jianhui
  • Qin, Hong

Abstract

Rotated sphere packing design is constructed by scaling, rotating and translating the lattice that has asymptotically lowest fill distance, its space-filling properties are very well. Currently, it can only be used for experimental design in hypercube. In this paper, we generalize the sphere packing design to simplex, which is the domain of experimental design with mixtures. In order to use the lattice method in simplex, a distance preserving transformation function is implemented to transform the simplex into the hyperplane, and then the iteration of rotating, scaling and disturbing is used to extract n lattice points as the design array. Some numerical comparisons between our method and several other popular methods are also provided. The results show that the designs generated by our algorithm are excellent according to the maximin distance criterion and its predictive ability is well. An additional searching method is also suggested to further improve the design.

Suggested Citation

  • Xiong, Zikang & Liu, Liwei & Ning, Jianhui & Qin, Hong, 2020. "Sphere packing design for experiments with mixtures," Statistics & Probability Letters, Elsevier, vol. 164(C).
  • Handle: RePEc:eee:stapro:v:164:y:2020:i:c:s0167715220301103
    DOI: 10.1016/j.spl.2020.108807
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715220301103
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spl.2020.108807?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. Xu He, 2017. "Rotated Sphere Packing Designs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 112(520), pages 1612-1622, October.
    2. Yan Liu & Min-Qian Liu, 2016. "Construction of uniform designs for mixture experiments with complex constraints," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 45(8), pages 2172-2180, April.
    3. Chuang, S.C. & Hung, Y.C., 2010. "Uniform design over general input domains with applications to target region estimation in computer experiments," Computational Statistics & Data Analysis, Elsevier, vol. 54(1), pages 219-232, January.
    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. 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.
    2. Chen, Ray-Bing & Hsu, Yen-Wen & Hung, Ying & Wang, Weichung, 2014. "Discrete particle swarm optimization for constructing uniform design on irregular regions," Computational Statistics & Data Analysis, Elsevier, vol. 72(C), pages 282-297.
    3. Lin, D.K.J. & Sharpe, C. & Winker, P., 2010. "Optimized U-type designs on flexible regions," Computational Statistics & Data Analysis, Elsevier, vol. 54(6), pages 1505-1515, June.
    4. Zhang, Mei & Zhou, Yong-Dao, 2016. "Spherical discrepancy for designs on hyperspheres," Statistics & Probability Letters, Elsevier, vol. 119(C), pages 226-234.
    5. Xu He, 2017. "Interleaved lattice-based minimax distance designs," Biometrika, Biometrika Trust, vol. 104(3), pages 713-725.
    6. Ray-Bing Chen & Ying-Chao Hung & Weichung Wang & Sung-Wei Yen, 2013. "Contour estimation via two fidelity computer simulators under limited resources," Computational Statistics, Springer, vol. 28(4), pages 1813-1834, August.

    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:stapro:v:164:y:2020:i:c:s0167715220301103. 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/wps/find/journaldescription.cws_home/622892/description#description .

    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.