Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Construction Methods for D-Optimum Weighing Designs when $n \equiv 3 (\operatorname{mod} 4)$

Z. Galil and J. Kiefer
The Annals of Statistics
Vol. 10, No. 2 (Jun., 1982), pp. 502-510
Stable URL: http://www.jstor.org/stable/2240684
Page Count: 9
  • Read Online (Free)
  • Download ($19.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Construction Methods for D-Optimum Weighing Designs when $n \equiv 3 (\operatorname{mod} 4)$
Preview not available

Abstract

In the setting where the weights of k objects are to be determined in n weighings on a chemical balance (or equivalent problems), for $n \equiv 3 (\operatorname{mod} 4)$, Ehlich and others have characterized certain "block matrices" C such that, if X'X = C where X(n × k) has entries $\pm1$, then X is an optimum design for the weighing problem. We give methods here for constructing X's for which X'X is a block matrix, and show that it is the optimum C for infinitely many (n, k). A table of known constructibility results for $n < 100$ is given.

Page Thumbnails

  • Thumbnail: Page 
502
    502
  • Thumbnail: Page 
503
    503
  • Thumbnail: Page 
504
    504
  • Thumbnail: Page 
505
    505
  • Thumbnail: Page 
506
    506
  • Thumbnail: Page 
507
    507
  • Thumbnail: Page 
508
    508
  • Thumbnail: Page 
509
    509
  • Thumbnail: Page 
510
    510