On the computation of maximum minors of Hadamard matrices

Koukouvinos, C; Lappas, E; Mitrouli, M

dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Lappas, E	en
dc.contributor.author	Mitrouli, M	en
dc.date.accessioned	2014-03-01T02:42:54Z
dc.date.available	2014-03-01T02:42:54Z
dc.date.issued	2004	en
dc.identifier.issn	0378-4754	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31131
dc.subject	Algorithm	en
dc.subject	Hadamard matrices	en
dc.subject	Maximum determinants	en
dc.subject	Minors	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Algorithms	en
dc.subject.other	Computational methods	en
dc.subject.other	Parameter estimation	en
dc.subject.other	Problem solving	en
dc.subject.other	Vectors	en
dc.subject.other	Computer algebra	en
dc.subject.other	Hadamard matrices	en
dc.subject.other	Maximum determinants	en
dc.subject.other	Minors	en
dc.subject.other	Matrix algebra	en
dc.title	On the computation of maximum minors of Hadamard matrices	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1016/j.matcom.2004.05.006	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.matcom.2004.05.006	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	In this paper, we use an algebraic method to compute the j x j, j = 1, 2, n minors of Hadamard matrices of order n. Specifically, we investigate the appearance of maximum values of minors. The presented algorithm is tested for several values of j and for Hadamard matrices of order 20. This algorithm is useful in the study of the growth factor for Hadamard matrices, which is a very interesting unsolved problem in the area of Numerical Analysis. (C) 2004 IMACS. Published by Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Mathematics and Computers in Simulation	en
dc.identifier.doi	10.1016/j.matcom.2004.05.006	en
dc.identifier.isi	ISI:000224205900004	en
dc.identifier.volume	67	en
dc.identifier.issue	1-2	en
dc.identifier.spage	33	en
dc.identifier.epage	44	en