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

Three-level saturated orthogonal arrays with less β-wordlength pattern

Author

Listed:
  • Jingke Zhang
  • Beibei Fan
  • Umer Daraz
  • Yu Tang

Abstract

Saturated orthogonal array is an important type of fractional factorial designs in experimental design. On the basis of guaranteeing orthogonality, it maximizes the number of factors and saves the cost of experiments. Therefore, it is increasingly used in practical experiment. For quantitative factors, the minimum β-aberration criterion is suitable for selecting good designs under a polynomial model. However, construction methods of designs with less β-aberration have not been fully investigated. In this article, we apply the Rao-Hamming method to construct a class of three-level saturated orthogonal arrays, and perform a special level permutation on the designs of the Rao-Hamming construction, which makes the resultant designs mirror-symmetric ones. Furthermore, we analyze the distribution of elements in each row and among all possible pairs of rows of the mirror-symmetric designs, and discuss some properties of the β-wordlength pattern for three-level mirror-symmetric designs constructed by the Rao-Hamming method. In addition, we provide the explicit expressions of β3 and β4 for three-level mirror-symmetric designs, which can reduce the computational complexity of the β-wordlength pattern, and provide an effective idea for finding designs under the minimum β-aberration criterion. Finally, numerical examples are used to illustrate and verify the results.

Suggested Citation

  • Jingke Zhang & Beibei Fan & Umer Daraz & Yu Tang, 2024. "Three-level saturated orthogonal arrays with less β-wordlength pattern," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(14), pages 5218-5229, April.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:14:p:5218-5229
    DOI: 10.1080/03610926.2023.2209680
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2023.2209680
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2023.2209680?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:53:y:2024:i:14:p:5218-5229. 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.