On the Growth Problem for D-Optimal Designs

Mitrouli, M; Koukouvinos, C

dc.contributor.author	Mitrouli, M	en
dc.contributor.author	Koukouvinos, C	en
dc.date.accessioned	2014-03-01T02:48:22Z
dc.date.available	2014-03-01T02:48:22Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33772
dc.subject	d-optimal design	en
dc.subject	Gaussian Elimination	en
dc.subject	hadamard matrices	en
dc.title	On the Growth Problem for D-Optimal Designs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-62598-4_112	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-62598-4_112	en
heal.publicationDate	1996	en
heal.abstract	When Gaussian elimination with complete pivoting (GECP) is applied to a real n×n matrix A, we will call g(n, A) the associated growth of the matrix. The problem of determining the largest growth g(n) for various values of n is called the growth problem. It seems quite difficult to establish a. value or close bounds for g(n). For specific values	en
heal.journalName	Numerical Analysis and Its Applications	en
dc.identifier.doi	10.1007/3-540-62598-4_112	en