论文检索

通过最大化最低 D 与 D₁ 效率构造多项式回归稳健设计AI 解读

In the common polynomial regression of degree m we determine the design which maximizes the minimum of the $D$-efficiency in the model of degree $m$ and the $D_1$-efficiencies in the models of degree $m-j,\dots, m +k$ ($j, k\ge 0$ given). The resulting designs allow an efficient estimation of the parameters in the chosen regression and have reasonable efficiencies for checking the goodness-of-fit of the assumed model of degree $m$ by testing the highest coefficients in the…

多项式回归的受约束 D 与 D₁ 最优设计AI 解读

In the common polynomial regression model of degree m we consider the problem of determining the $D$- and $D_1$-optimal designs subject to certain constraints for the $D_1$-efficiencies in the models of degree $m - j, m - j + 1,\dots, m + k(m > j \geq 0, k \geq 0 \text{given})$.We present a complete solution of these problems, which on the one hand allow a fast computation of the constrained optimal designs and, on the other hand, give an answer to the question of the…