The numerical range of certain 0,1-matrices †
暂无分享,去创建一个
Let A be a 0, 1-matrix with at most one 1 in each row and column. The authors prove that the numerical range of A is the convex hull of a polygon and a circular disk, both centered at the origin and contained in the unit disk. The proof uses a permutation similarity to reduce A to a direct sum of matrices whose numerical ranges can be determined. A computer program, developed by the authors, which plots the boundary of the numerical range of an arbitrary complex matrix is also discussed.
[1] K. Fan. On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations: II. , 1949, Proceedings of the National Academy of Sciences of the United States of America.
[2] K. D. Tocher,et al. Basic theorems in matrix theory , 1960 .
[3] Charles R. Johnson. NUMERICAL DETERMINATION OF THE FIELD OF VALUES OF A GENERAL COMPLEX MATRIX , 1978 .
[4] O. Toeplitz. Das algebraische Analogon zu einem Satze von Fejér , 1918 .
[5] F. Hausdorff. Der Wertvorrat einer Bilinearform , 1919 .