Positive semidefinite matrices with a given sparsity pattern
نویسندگان
چکیده
منابع مشابه
Singular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملMatrices with High Completely Positive Semidefinite Rank
A real symmetric matrix M is completely positive semidefinite if it admits a Gram representation by positive semidefinite matrices (of any size d). The smallest such d is called the completely positive semidefinite rank of M , and it is an open question whether there exists an upper bound on this number as a function of the matrix size. We show that if such an upper bound exists, it has to be a...
متن کاملsingular value inequalities for positive semidefinite matrices
in this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. our results are similar to some inequalities shown by bhatia and kittaneh in [linear algebra appl. 308 (2000) 203-211] and [linear algebra appl. 428 (2008) 2177-2191].
متن کاملA determinantal inequality for positive semidefinite matrices
Let A,B,C be n× n positive semidefinite matrices. It is known that det(A+ B + C) + detC ≥ det(A+ C) + det(B + C), which includes det(A+B) ≥ detA+ detB as a special case. In this article, a relation between these two inequalities is proved, namely, det(A+ B + C) + detC − (det(A+ C) + det(B + C)) ≥ det(A+ B)− (detA+ detB).
متن کاملSparsity-Preserving Difference of Positive Semidefinite Matrix Representation of Indefinite Matrices
We consider the problem of writing an arbitrary symmetric matrix as the difference of two positive semidefinite matrices. We start with simple ideas such as eigenvalue decomposition. Then, we develop a simple adaptation of the Cholesky that returns a difference-of-Cholesky representation of indefinite matrices. Heuristics that promote sparsity can be applied directly to this modification.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1988
ISSN: 0024-3795
DOI: 10.1016/0024-3795(88)90240-6