On the optimality of block designs (Q1073512)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the optimality of block designs |
scientific article; zbMATH DE number 3945149
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the optimality of block designs |
scientific article; zbMATH DE number 3945149 |
Statements
On the optimality of block designs (English)
0 references
1986
0 references
A family of highly efficient designs in the sense of the E-criterion is described. These designs have strictly better E-performance than regular graph designs, yet the off-diagonal entries of their C-matrix differ by as much as two. Some counterexamples to conjectures in experimental design are then supplied. Asymptotic behavior and equivalence of the A- and D-criteria under a certain condition of uniqueness are analyzed as well.
0 references
E-optimality
0 references
A-optimality
0 references
D-optimality
0 references
eigenvalue
0 references
positive definite matrix
0 references
line graph
0 references
spanning tree
0 references
E-criterion
0 references
regular graph designs
0 references
counterexamples
0 references
Asymptotic behavior
0 references
equivalence of the A- and D- criteria
0 references
