arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.1896math.STstat.TH
收藏

具有大块的可解析设计

Resolvable designs with large blocks

J. P. Morgan, Brian H. Reck

摘要:

从最优性的角度研究了每个重复两个区组的可解析设计。因为在实践中,重复的数量通常小于处理的数量,所以参数可以基于信息矩阵的对偶,从而以块并发的形式给出。对于给定的块大小,并行化块并发通常是(但并不总是)最好的策略。建立了各种强最优性的充分条件,并详细研究了E-最优性,包括E-最优类的特征。发现最优设计对应于平衡阵列和仿射类推广。

英文摘要:

Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information matrix and consequently given in terms of block concurrences. Equalizing block concurrences for given block sizes is often, but not always, the best strategy. Sufficient conditions are established for various strong optimalities and a detailed study of E-optimality is offered, including a characterization of the E-optimal class. Optimal designs are found to correspond to balanced arrays and an affine-like generalization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑