Results 131 to 140 of about 41,020 (249)
Completely positive map from M4(C) to M5(C) on positive semidefinite Matrices
Winda C. Akatch+2 more
openalex +2 more sources
Determinants of nonprincipal submatrices of positive semidefinite matrices
AbstractWe compute here the maximum value of the modulus of the determinant of an m×m nonprincipal submatrix of an n×n positive semidefinite matrix A, in terms of m, the eigenvalues of A, and cardinality k of the set of common row and column indices of this submatrix.
openaire +2 more sources
A note on "Remarks on some inequalities for positive semidefinite matrices and questions for Bourin" [PDF]
Jianguo Zhao, Qi Jiang
openalex +1 more source
On ㏒ majorizations for positive semidefinite matrices [PDF]
Chia-Shiang Lin, Yeol Je Cho
openaire +2 more sources
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) + det C ⥠det(A + C) + det(B + C), which includes det(A + B) ⥠det A + det B as a special case. In this article, a relation between these two inequalities is proved, namely, det(A + B + C) + det C â (det(A + C) + det(B + C)) ⥠det(A + B) â (det A + det B).
openaire +2 more sources
Semidefinite code bounds based on quadruple distances
Let $A(n,d)$ be the maximum number of $0,1$ words of length $n$, any two having Hamming distance at least $d$. We prove $A(20,8)=256$, which implies that the quadruply shortened Golay code is optimal.
Gijswijt, Dion C.+2 more
core +2 more sources
Preconditioning by an extended matrix technique for convection-diffusion-reaction equations
In this paper we consider a preconditioning technique for the ill-conditioned systems arising from discretisations of nonsymmetric elliptic boundary value problems.
Aurelian Nicola, Constantin Popa
doaj +2 more sources
Approximation in trace norm by positive semidefinite matrices
AbstractInformation is obtained about best approximation of a matrix by positive semidefinite ones, in trace norm. The situation is much different from approximation in spectral and Euclidean norms.
openaire +2 more sources
A Fast and Reliable Solution to PnP, Using Polynomial Homogeneity and a Theorem of Hilbert. [PDF]
Keren D, Osadchy M, Shahar A.
europepmc +1 more source