Browse > Article
http://dx.doi.org/10.4134/BKMS.2006.43.2.343

COMPLETION FOR TIGHT SIGN-CENTRAL MATRICES  

Cho, Myung-Sook (DEPARTMENT OF MATHEMATICS EDUCATION, KYUNGPOOK NATIONAL UNIVERSITY)
Hwang, Suk-Geun (DEPARTMENT OF MATHEMATICS EDUCATION, KYUNGPOOK NATIONAL UNIVERSITY)
Publication Information
Bulletin of the Korean Mathematical Society / v.43, no.2, 2006 , pp. 343-352 More about this Journal
Abstract
A real matrix A is called a sign-central matrix if for, every matrix $\tilde{A}$ with the same sign pattern as A, the convex hull of columns of $\tilde{A}$ contains the zero vector. A sign-central matrix A is called a tight sign-central matrix if the Hadamard (entrywise) product of any two columns of A contains a negative component. A real vector x = $(x_1,{\ldots},x_n)^T$ is called stable if $\|x_1\|{\leq}\|x_2\|{\leq}{\cdots}{\leq}\|x_n\|$. A tight sign-central matrix is called a $tight^*$ sign-central matrix if each of its columns is stable. In this paper, for a matrix B, we characterize those matrices C such that [B, C] is tight ($tight^*$) sign-central. We also construct the matrix C with smallest number of columns among all matrices C such that [B, C] is $tight^*$ sign-central.
Keywords
sign-central mztrix; tight sign-central matrix;
Citations & Related Records

Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 S.-G. Hwang, I.-P. Kim, S.-J. Kim and X. D. Zhang, Tight sign-central matrices, Linear Algebra Appl. 371 (2003), 225-240   DOI   ScienceOn
2 S.-G. Hwang, I.-P. Kim, S.-J. Kim and S.-G. Lee, The number of zeros of a tight sign-central matrix, Linear Algebra Appl. 407 (2005), 296-310   DOI   ScienceOn
3 T. Ando and R. A. Brualdi, Sign-central matrices, Linear Algebra Appl. 208/209 (1994), 283-295   DOI   ScienceOn
4 R. A. Brualdi and B. L. Shader, Matrices of sign-solvable linear systems, Cambride Tracts in Mathematics 116, Cambridge University Press, New York, 1995