A trace bound for integer-diagonal positive semidefinite matrices
Special Matrices, 2020 We prove that an n-by-n complex positive semidefinite matrix of rank r whose graph is connected, whose diagonal entries are integers, and whose non-zero off-diagonal entries have modulus at least one, has trace at least n + r − 1.
Mitchell Lon
doaj +1 more source
Separability for mixed states with operator Schmidt rank two [PDF]
Quantum, 2019 The operator Schmidt rank is the minimum number of terms required to express a state as a sum of elementary tensor factors. Here we provide a new proof of the fact that any bipartite mixed state with operator Schmidt rank two is separable, and can be ...
Gemma De las Cuevas +2 more
doaj +1 more source
Decomposition of arrow type positive semidefinite matrices with application to topology optimization [PDF]
Mathematical programming, 2019 Decomposition of large matrix inequalities for matrices with chordal sparsity graph has been recently used by Kojima et al. (Math Program 129(1):33–68, 2011) to reduce problem size of large scale semidefinite optimization (SDO) problems and thus increase
M. Kočvara
semanticscholar +1 more source
On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings [PDF]
, 2015 We investigate structural properties of the completely positive semidefinite cone $\mathcal{CS}_+^n$, consisting of all the $n \times n$ symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size. This cone has been
Burgdorf, Sabine +2 more
core +5 more sources
Fischer Type Log-Majorization of Singular Values on Partitioned Positive Semidefinite Matrices
Journal of Function Spaces, 2021 In this paper, we establish a Fischer type log-majorization of singular values on partitioned positive semidefinite matrices, which generalizes the classical Fischer's inequality. Meanwhile, some related and new inequalities are also obtained.
Benju Wang, Yun Zhang
doaj +1 more source
Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2017 We show how to compute a relative-error low-rank approximation to any positive semidefinite (PSD) matrix in sublinear time, i.e., for any n x n PSD matrix A, in Õ(n ⋅ poly(k/ε)) time we output a rank-k matrix B, in factored form, for ...
Cameron Musco, David P. Woodruff
semanticscholar +1 more source
Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone [PDF]
, 2015 We investigate the completely positive semidefinite cone $\mathcal{CS}_+^n$, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size).
Laurent, Monique, Piovesan, Teresa
core +3 more sources
An elementary proof of Chollet’s permanent conjecture for 4 × 4 real matrices
Special Matrices, 2021 A proof of the statement per(A ∘ B) ≤ per(A)per(B) is given for 4 × 4 positive semidefinite real matrices. The proof uses only elementary linear algebra and a rather lengthy series of simple inequalities.
Hutchinson George
doaj +1 more source
Analysis of Fixing Nodes Used in Generalized Inverse Computation
Advances in Electrical and Electronic Engineering, 2014 In various fields of numerical mathematics, there arises the need to compute a generalized inverse of a symmetric positive semidefinite matrix, for example in the solution of contact problems.
Pavla Hruskova
doaj +1 more source
Semidefinite descriptions of the convex hull of rotation matrices [PDF]
, 2014 We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e. both it and its
Parrilo, Pablo A. +2 more
core +1 more source