最优正则图设计
Optimal Regular Graph Designs
摘要:
最优设计理论中的一个典型问题是在一类设计中找到一个关于某些准则最优的试验设计。最常见的标准包括A标准和D标准。规则图设计出现在许多最优性结果中,如果块的数量足够大,它们是A-和D-最优的。本文给出了用计算机精确搜索最大系统中最佳正则图设计的结果,最大系统为20个点,k<=r<=10,r(k-1)-(v-1)[r(k-1)/(v-1)]<=9.
英文摘要:
A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results and, if the number of blocks is large enough, they are A- and D-optimal. We present the results of an exact computer search for the best regular graph designs in large systems for up to 20 points, k<=r<=10 and r(k-1)-(v-1)[r(k-1)/(v-1)]<=9.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。