Finding D-optimal designs by randomised decomposition and switching

Brent, Richard

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Finding D-optimal designs by randomised decomposition and switching

Date

2013

Authors

Brent, Richard

Publisher

University of Queensland

Abstract

A square {+1,-1}-matrix of order n with maximal determinant is called a saturated D-optimal design. We consider some cases of saturated Doptimal designs where n > 2, n ≢ 0 mod 4, so the Hadamard bound is not attainable, but bounds due to Barba or Ehlich

URI

http://hdl.handle.net/1885/74321

Collections

ANU Research Publications

Source

Australasian Journal of Combinatorics

Type

Journal article

Access Statement

Open Access

Downloads

File

Description

01_Brent_Finding_D-optimal_designs_by_2013.pdf (176.74 KB)

Full item page

Cultural advice

Finding D-optimal designs by randomised decomposition and switching

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

Downloads