arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.5876math.CO
收藏

具有三个不同特征值设计的最优性

On optimality of designs with three distinct eigenvalues

M. R. Faghihi, E. Ghorbani, G. B. Khosrovshahi, S. Tat

摘要:

令$\D_{v,b,k}$表示具有$v$处理和大小为$k$的$b$区组的所有连通区组设计的族。令$d\in\D_{v,b,k}$。治疗的复制是它出现在$d$块中的次数。矩阵$C(d)=R(d)-\frac{1}{k}N(d)N(d)^\top$称为$d$的信息矩阵,其中$N(d)$是$d$的关联矩阵,$R(d)$是重复的对角矩阵。由于$d$是连接的,因此$C(d)$具有$v-1$非零特征值$μ_1(d),...,μ_{v-1}(d)$。设$\D$是$\D_{v,b,k}$的所有二元设计的类。我们证明了,如果有一个设计$d^*\in\D$,使(i)$C(d^*)$有三个不同的特征值,(ii)$d^*$最小化跟踪$C(d)^2$在$d\in\D$,(iii)$d^*$最大化最小的非零特征值和产品的非零特征值的$C(d)$在$d\in\D$,那么对于所有的$p>0$,$d^*$最小化$(\sum_{i=1}^{v-1}μ_i(d)^{-p})^{1/p}$在$d\in\D$。在最优设计理论的背景下,这意味着如果存在设计$d^*\in\D$,使得其信息矩阵具有满足上述条件(ii)的三个不同特征值,并且$d^*$在$\D$中是E-和D-最优的,则$d^*$在$\D$中对于所有$p>0$都是$Φ_p$ -最优的。作为应用,我们证明了某些可分群设计的$Φ_p$ -最优性.我们的证明是基于非线性规划中的KKT条件的方法。

英文摘要:

Let $\D_{v,b,k}$ denote the family of all connected block designs with $v$ treatments and $b$ blocks of size $k$. Let $d\in\D_{v,b,k}$. The replication of a treatment is the number of times it appears in the blocks of $d$. The matrix $C(d)=R(d)-\frac{1}{k}N(d)N(d)^\top$ is called the information matrix of $d$ where $N(d)$ is the incidence matrix of $d$ and $R(d)$ is a diagonal matrix of the replications. Since $d$ is connected, $C(d)$ has $v-1$ nonzero eigenvalues $μ_1(d),...,μ_{v-1}(d)$. Let $\D$ be the class of all binary designs of $\D_{v,b,k}$. We prove that if there is a design $d^*\in\D$ such that (i) $C(d^*)$ has three distinct eigenvalues, (ii) $d^*$ minimizes trace of $C(d)^2$ over $d\in\D$, (iii) $d^*$ maximizes the smallest nonzero eigenvalue and the product of the nonzero eigenvalues of $C(d)$ over $d\in\D$, then for all $p>0$, $d^*$ minimizes $(\sum_{i=1}^{v-1}μ_i(d)^{-p})^{1/p}$ over $d\in\D$. In the context of optimal design theory, this means that if there is a design $d^*\in\D$ such that its information matrix has three distinct eigenvalues satisfying the condition (ii) above and that $d^*$ is E- and D-optimal in $\D$, then $d^*$ is $Φ_p$-optimal in $\D$ for all $p>0$. As an application, we demonstrate the $Φ_p$-optimality of certain group divisible designs. Our proof is based on the method of KKT conditions in nonlinear programming.

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

↑