Finding D-optimal designs by randomised decomposition and switching

dc.contributor.author	Brent, Richard
dc.date.accessioned	2015-12-13T22:28:42Z
dc.date.issued	2013
dc.date.updated	2015-12-11T08:40:44Z
dc.description.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
dc.identifier.issn	1034-4942
dc.identifier.uri	http://hdl.handle.net/1885/74321
dc.publisher	University of Queensland
dc.rights	Author/s retain copyright	en_AU
dc.source	Australasian Journal of Combinatorics
dc.title	Finding D-optimal designs by randomised decomposition and switching
dc.type	Journal article
dcterms.accessRights	Open Access	en_AU
local.bibliographicCitation.lastpage	30
local.bibliographicCitation.startpage	15
local.contributor.affiliation	Brent, Richard, College of Physical and Mathematical Sciences, ANU
local.contributor.authoruid	Brent, Richard, u4241028
local.description.notes	Imported from ARIES
local.identifier.absfor	010104 - Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)
local.identifier.absseo	970101 - Expanding Knowledge in the Mathematical Sciences
local.identifier.ariespublication	f5625xPUB4060
local.identifier.citationvolume	55
local.identifier.scopusID	2-s2.0-84875195824
local.type.status	Published Version

Downloads

Now showing 1 - 1 of 1