首页> 外文学位 >Projection, Search, and Optimality in Fractional Factorial Experiments.
【24h】

Projection, Search, and Optimality in Fractional Factorial Experiments.

机译:分数阶乘实验中的投影,搜索和最优性。

获取原文
获取原文并翻译 | 示例

摘要

We propose a general Up-Down method to search for efficient 2 m fractional factorial designs in fitting a class of models when the number of factors is m, and the number of runs is n. The orthogonal array designs exist for some specific values of n. The orthogonal array designs are optimal under the resolution assumptions. The proposed Up-Down method searches for efficient designs having the number of runs in between two values of n for orthogonal array designs satisfying a resolution assumption. We present the efficient resolution III designs obtained by the Up-Down method for 3 ≤ m ≤ 10 and a range of practical values of n. While many of these designs are found to be the global optimal resolution III designs by exhaustive computer search, the other designs are near global optimal designs. For m=4 and 5, we compare our designs with the optimal resolution III+k (k=0,1,2,...) designs in Ghosh and Tian (2006). Moreover, we utilize the method to obtain unbalanced Up-Res V designs performing slightly better than the balanced optimal fractional factorial designs (BOFFD) given in Srivastava and Chopra (1971) with respect to A- and D-optimality criteria. For a given n, all our designs are isomorphic having same optimality properties. For general m and n, the conditions are derived for obtaining such isomorphic designs with respect to Trace and Determinant.;Several interesting projection properties are known in the literature for orthogonal arrays and in particular for the Plackett-Burman (PB) designs. In this dissertation, the projection properties are investigated for both orthogonal and non-orthogonal array designs under different model assumptions. The structure of the variance-covariance matrix for the estimates of the model parameters is characterized. The optimality properties of these designs are also investigated. For m=5, we consider seven 12-run designs di,i=1,...,7 and a collection of classes of models. The designs di,i = 1,...,5 are balanced arrays of full strength, d6 and d 7 are orthogonal arrays of strength 2. The designs d 6 and d7 are two non-isomorphic designs obtained from the PB design by projecting 11 factors onto 5 factors. Overall, our designs d1 and d3 are at the top of their performances. By projection, all possible t (≤ m) factors out of m factors are considered. As t increases from 2, to 3 and 4, the design d1 becomes better and better compared to the design d3. When t=5, the design d 3 is optimal under resolution III model. For fitting resolution III plus k (k=1,2,3) models, the design d1 again becomes better and better compared to the design d3 as k increases.
机译:我们提出了一种通用的上下方法,以在因子数为m,行程数为n时,在拟合一类模型中搜索有效的2 m分数阶因子设计。对于n的某些特定值,存在正交阵列设计。在分辨率假设下,正交阵列设计是最佳的。对于满足分辨率假设的正交阵列设计,提出的上下方法可搜索有效运行的设计,其运行次数在n的两个值之间。我们介绍了通过Up-Down方法获得的3≤m≤10的有效分辨率III设计,以及一系列实际值n。尽管通过详尽的计算机搜索发现其中许多设计是全局最佳分辨率III设计,但其他设计却接近全局最佳设计。对于m = 4和5,我们在Ghosh和Tian(2006)中将我们的设计与最佳分辨率III + k(k = 0,1,2,...)设计进行了比较。此外,我们利用该方法获得的非平衡Up-Res V设计相对于A-和D-最佳性标准,其性能优于Srivastava和Chopra(1971)中给出的平衡的最优分数因子设计(BOFFD)。对于给定的n,我们所有的设计都是同构的,具有相同的最优性。对于一般的m和n,推导了获得关于迹线和行列式的同构设计的条件。正交阵列,尤其是Plackett-Burman(PB)设计在文献中已知几个有趣的投影特性。本文研究了在不同模型假设下正交和非正交阵列设计的投影特性。表征用于模型参数估计的方差-协方差矩阵的结构。还研究了这些设计的最佳性能。对于m = 5,我们考虑七个12次运行设计di,i = 1,...,7和模型类别的集合。设计di,i = 1,...,5是全强度的平衡阵列,d6和d 7是强度2的正交阵列。设计d 6和d7是从PB设计中通过投影获得的两个非同构设计11个因素变为5个因素。总体而言,我们的设计d1和d3是其性能的佼佼者。通过投影,考虑了m个因子中的所有可能的t(≤m)因子。随着t从2增加到3和4,与设计d3相比,设计d1变得越来越好。当t = 5时,设计d 3在分辨率III模型下最佳。对于拟合分辨率III加k(k = 1,2,3)的模型,随着k的增加,设计d1与设计d3相比变得越来越好。

著录项

  • 作者

    Zheng, Zongpeng.;

  • 作者单位

    University of California, Riverside.;

  • 授予单位 University of California, Riverside.;
  • 学科 Statistics.
  • 学位 Ph.D.
  • 年度 2014
  • 页码 147 p.
  • 总页数 147
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

  • 入库时间 2022-08-17 11:53:52

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号