科研之友
微信
新浪微博
Facebook
分享链接
摘要
The positive semidefinite minimum rank of a sign pattern matrix Lambda, denoted by pmr(A), is the smallest possible rank among all real positive semidefinite matrices M with sgn(M) = A. By counting the number of signs and using the inner structure of A and the underlying graph G(Lambda), various bounds for pmr(Lambda) are given in this paper.
