Results 11 to 20 of about 41,020 (249)
Sparse Sums of Positive Semidefinite Matrices [PDF]
Many fast graph algorithms begin by preprocessing the graph to improve its sparsity. A common form of this is spectral sparsification, which involves removing and reweighting the edges of the graph while approximately preserving its spectral properties. This task has a more general linear algebraic formulation in terms of approximating sums of rank-one
Marcel K. de Carli Silva+2 more
openalex +3 more sources
We investigate the Riccati matrix equation $ X A^{-1} X = B $ in which the conventional matrix products are generalized to the semi-tensor products $ \ltimes $. When $ A $ and $ B $ are positive definite matrices satisfying the factor-dimension condition,
Pattrawut Chansangiam, Arnon Ploymukda
doaj +2 more sources
Singular Value and Matrix Norm Inequalities between Positive Semidefinite Matrices and Their Blocks [PDF]
In this paper, we obtain some inequalities involving positive semidefinite 2×2 block matrices and their blocks.
Feng Zhang+3 more
doaj +2 more sources
Given matrices AA and BB of the same order, AA is called a section of BB if R(A)∩R(B−A)={0}{\mathscr{R}}\left(A)\cap {\mathscr{R}}\left(B-A)=\left\{0\right\} and R(AT)∩R((B−A)T)={0}{\mathscr{R}}\left({A}^{T})\cap {\mathscr{R}}\left({\left(B-A)}^{T ...
Eagambaram N.
doaj +2 more sources
On Certain Positive Semidefinite Matrices of Special Functions [PDF]
Special functions are often defined as a Fourier or Laplace transform of a positive measure, and the positivity of the measure manifests as positive definiteness of certain matrices. The purpose of this expository note is to give a sample of such positive definite matrices to demonstrate this connection for some well-known special functions such as ...
Ruiming Zhang
openalex +4 more sources
New properties for certain positive semidefinite matrices
We bring in some new notions associated with $2\times 2$ block positive semidefinite matrices. These notions concern the inequalities between the singular values of the off diagonal blocks and the eigenvalues of the arithmetic mean or geometric mean of the diagonal blocks. We investigate some relations between them.
Minghua Lin
openalex +4 more sources
Low-rank matrix approximations over canonical subspaces
In this paper we derive closed form expressions for the nearest rank-\(k\) matrix on canonical subspaces. We start by studying three kinds of subspaces. Let \(X\) and \(Y\) be a pair of given matrices. The first subspace contains all the \(m\times
Achiya Dax
doaj +7 more sources
On Some Matrix Trace Inequalities
We first present an inequality for the Frobenius norm of the Hadamard product of two any square matrices and positive semidefinite matrices. Then, we obtain a trace inequality for products of two positive semidefinite block matrices by using 2×2 ...
Ramazan Türkmen+1 more
doaj +2 more sources
A trace bound for integer-diagonal positive semidefinite matrices
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]
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