Full metadata record
DC FieldValueLanguage
dc.contributor.authorGau, Hwa-Longen_US
dc.contributor.authorWang, Kuo-Zhongen_US
dc.contributor.authorWu, Pei Yuanen_US
dc.date.accessioned2017-04-21T06:56:11Z-
dc.date.available2017-04-21T06:56:11Z-
dc.date.issued2016-12en_US
dc.identifier.issn1846-3886en_US
dc.identifier.urihttp://dx.doi.org/10.7153/oam-10-49en_US
dc.identifier.urihttp://hdl.handle.net/11536/133272-
dc.description.abstractThe (generalized) Crawford number C(A) of an n-by-n complex matrix A is, by definition, the distance from the origin to the boundary of the numerical range W(A) of A. If A is a companion matrix [GRAPHICS] then it is easily seen that C(A) >= cos(pi/n). The main purpose of this paper is to determine when the equality C(A) = cos(pi/n) holds. A sufficient condition for this is that the boundary of W(A) contains a point lambda for which the subspace of C-n spanned by the vectors x with < Ax, x > = lambda parallel to x parallel to(2) has dimension 2, while a necessary condition is Sigma(n-2)(j=0) a(n-j)e((n-j)i theta) sin ((j + 1)pi/n) = sin(pi/n) for some real theta. Examples are given showing that in general these conditions are not simultaneously necessary and sufficient. We then prove that they are if A is (unitarily) reducible. We also establish a lower bound for the numerical radius w(A) of A: w(A) >= cos(pi/(n+ 1)), and show that the equality holds if and only if A is equal to the n-by-n Jordan block.en_US
dc.language.isoen_USen_US
dc.subjectCompanion matrixen_US
dc.subjectnumerical rangeen_US
dc.subjectCrawford numberen_US
dc.titleCRAWFORD NUMBERS OF COMPANION MATRICESen_US
dc.identifier.doi10.7153/oam-10-49en_US
dc.identifier.journalOPERATORS AND MATRICESen_US
dc.citation.volume10en_US
dc.citation.issue4en_US
dc.citation.spage863en_US
dc.citation.epage879en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000393210900004en_US
Appears in Collections:Articles