On the E- and MV-optimality of spring balance designs with string property
In this paper we consider the problem of optimally measuring the distances between \(p+1\) objects which are fixed in position along a line. It is assumed throughout that n measurements are to be taken on the distances between various pairs of objects occurring along the line. Such a problem gives rise to \(p\times n\) design matrices whose entries are all 0's and 1's with the string property, i.e., the property that each row of the design matrix contains only strings of 0's and 1's. Here we develop some methods for constructing designs which are E-optimal and MV-optimal for estimating the p distances of interest.
scientific article; zbMATH DE number 3940502