IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v49y2020i10p2498-2513.html
   My bibliography  Save this article

Three-level blocked regular designs with general minimum lower order confounding

Author

Listed:
  • Yanfei Wang
  • Zhiming Li
  • Runchu Zhang

Abstract

When the experimental units are heterogeneous, blocking the units into groups is a crucial way. In this paper we consider the selection of optimal three-level blocked regular designs. A blocked aliased component-number pattern (B-ACNP) is introduced and a blocked general minimum lower order confounding (B1-GMC) criterion for selecting three-level blocked designs is proposed. Some relations of this criterion with other existing criteria are given. Some results of constructing three-level B1-GMC designs are obtained. For comparison, all the B1-GMC, B-GMC and four MA-type 3n−m:3p designs with 27, 81 and 243 runs, n=4,5,…,10 and p = 1, 2, 3 are tabulated.

Suggested Citation

  • Yanfei Wang & Zhiming Li & Runchu Zhang, 2020. "Three-level blocked regular designs with general minimum lower order confounding," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(10), pages 2498-2513, May.
    • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:10:p:2498-2513
    DOI: 10.1080/03610926.2019.1576891
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2019.1576891
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2019.1576891?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:49:y:2020:i:10:p:2498-2513. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.