Skip navigation
Skip navigation

Finding D-optimal designs by randomised decomposition and switching

Brent, Richard

Description

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

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
URI: http://hdl.handle.net/1885/74321
Source: Australasian Journal of Combinatorics

Download

File Description SizeFormat Image
01_Brent_Finding_D-optimal_designs_by_2013.pdf176.74 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator