D-optimal (0, 1)-weighing designs for eight objects

Linear Algebra and Its Applications

Volumn 432, Issue 10, 2010, Pages 2634-2657

  Neubauer, Michael G ^a   Pace, Richard G ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b IBM   (United States)

Author keywords

D optimal design; DETMAX; Threshold graph; Weighing design

Indexed keywords

D-OPTIMAL; D-OPTIMAL DESIGNS; DETMAX; MATRIX; THRESHOLD GRAPH; THRESHOLD GRAPHS;

DESIGN; MEASUREMENT THEORY; OPTIMAL SYSTEMS; PHOTOLITHOGRAPHY; WEIGHING;

OPTIMIZATION;

EID: 77349093018     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2009.12.007     Document Type: Article

References (29)

1. Mood A.M. On Hotelling's weighing problem. Ann. Math. Statist. 17 (1946) 432-446
2. Hotelling H. Some improvements in weighing and other experimental techniques. Ann. Math. Statist. 15 (1944) 297-306
3. Sloane N.J. Multiplexing methods in spectroscopy. Math. Mag. 52 (1979) 71-80
4. Pukelsheim F. Optimal Design of Experiments (1993), Wiley & Sons
5. Neubauer M., and Watkins W. E-optimal Spring Balance Weighing designs for n ≡ 3 mod 4 Objects. SIAM J. Matrix Anal. Appl. 24 (2002) 91-105
6. Abrego B., Fernandez-Merchant S., Neubauer M., and Watkins W. D-optimal weighing designs for n ≡ - 1 mod 4 objects and a large number of weighings. Linear Algebra Appl. 374 (2003) 175-218
7. Neubauer M., Watkins W., and Zeitlin J. Maximal j-simplices in the real d-dimensional unit cube. J. Combin. Theory A 80 (1997) 1-12
8. Neubauer M., Watkins W., and Zeitlin J. Notes on D-optimal designs. Linear Algebra Appl. 280 (1998) 109-127
9. Hudelson M., Klee V., and Larman D. Largest j-simplices in d-cubes: some relatives of the Hadamard determinant problem. Linear Algebra Appl. 241 (1996) 519-598
10. R.G. Pace, D-optimal weighing designs with eight objects, Master's Thesis, California State University, Northridge, 2006.
11. Neubauer M., and Radcliffe A.J. The maximum determinant of (+ 1, - 1)-matrices. Linear Algebra Appl. 257 (1997) 289-306
12. Kaplansky I. Never too late. Amer. Math. Monthly 102 (1995) 259
13. Galil Z., and Kiefer J. D-optimum weighing designs. Ann. Statist. 8 (1980) 1293-1306
14. Galil Z., and Kiefer J. Construction methods for D-optimum weighing designs when n ≡ 3 (mod 4). Ann. Statist. 10 (1982) 502-510
15. Neubauer M., Watkins W., and Zeitlin J. Maximal D-optimal weighing designs for 4 and 5 objects. Electron. J. Linear Algebra 4 (1998) 48-72
16. Neubauer M., Watkins W., and Zeitlin J. D-optimal weighing designs for 6 objects. Metrika 52 (2002) 185-211
17. Neubauer M., and Watkins W. D-optimal designs for seven objects and large number of weighings. Linear and Multilinear Algebra 50 (2002) 61-74
18. Abrego B., Fernandez-Merchant S., Neubauer M., and Watkins W. Trace-minimal graphs and D-optimal weighing designs. Lineat Algebra Appl. 412 (2006) 161-221
19. Fedorov V.V. Theory of Optimal Experiments (1972), Academic Press, New York
20. John R.C.St., and Draper N.R. D-optimality for regression designs: a review. Technometrics 17 (1975) 15-23
21. Wynn H.P. Results in the theory and construction of D-optimum experimental designs. J. Roy. Statist. Soc. Ser. B (Statist. Methodol.) 34 (1972) 133-147
22. Mitchell T.J. An algorithm for the construction of D-optimal experimental designs. Technometrics 20 (1974) 203-210
23. Cook R., and Nachtsheim C. A comparison of algorithms for constructing exact D-optimal designs. Technometrics 22 (1980) 315-324
24. Neubauer M. An inequality for positive definite matrices with applications to combinatorial matrices. Linear Algebra Appl. 267 (1997) 163-174
25. Anderson S., and Perlman M. Group-invariant analogues of Hadamard's inequality. Linear and Multilinear Algebra 110 (1988) 91-116
26. Cohn J.H.E. On determinants with elements ± 1. J. London Math. Soc. 42 (1967) 436-442
27. Marshall A.W., and Olkin I. Inequalities: Theory of Majorization and its Applications (1979), Academic Press
28. Ruch E., and Gutman I. The branching extent of graphs. J. Combin. Inform. System Sci. 4 (1979) 285-295
29. Merris R., and Roby T. The lattice of threshold graphs. J. Inequal. Pure Appl. Math. 6 (2005) (Article 2)