Optimal Regular Graph Designs
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.