Results 11 to 20 of about 71,800 (235)
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
Restricted Riemannian geometry for positive semidefinite matrices [PDF]
A. Martina Neuman, Yuying Xie, Qiang Sun
openalex +3 more sources
Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices [PDF]
As a generalization of the standard phase retrieval problem,we seek to reconstruct symmetric rank- 1 matrices from inner products with subclasses of positive semidefinite matrices.
M. Ehler, Manuel Graef, F. Király
semanticscholar +4 more sources
Disjoint sections of positive semidefinite matrices and their applications in linear statistical models [PDF]
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
Inertia of partial transpose of positive semidefinite matrices [PDF]
We show that the partial transpose of 9×9 positive semidefinite matrices do not have inertia (4,1,4) and (3,2,4) . It solves an open problem in ‘LINEAR AND MULTILINEAR ALGEBRA. Changchun Feng et al, 2022’.
Yixuan Liang +3 more
semanticscholar +1 more source
Symplectic eigenvalues of positive-semidefinite matrices and the trace minimization theorem [PDF]
Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Williamson's diagonal form. Many properties of standard eigenvalues, including the trace minimization theorem, have been extended to the case of symplectic ...
N. T. Son, T. Stykel
semanticscholar +1 more source
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
New properties for certain positive semidefinite matrices [PDF]
Minghua Lin
openalex +3 more sources
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices [PDF]
In order to solve positive semidefinite (PSD) programs efficiently, a successful computational trick is to consider a relaxation, where PSD-ness is enforced only on a collection of submatrices. In order to study this formally, we consider the class of $n\
Grigoriy Blekherman +3 more
semanticscholar +1 more source
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

