Results 31 to 40 of about 71,699 (272)
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
Positive Semidefinite Matrices, Exponential Convexity for Majorization, and Related Cauchy Means
Journal of Inequalities and Applications, 2010 We prove positive semidefiniteness of matrices generated by differences deduced from majorization-type results which implies exponential convexity and log-convexity of these differences and also obtain Lyapunov's and Dresher's inequalities for these ...
Latif N, Pečarić J, Anwar M
doaj +2 more sources
A New Algorithm for Positive Semidefinite Matrix Completion
Journal of Applied Mathematics, 2016 Positive semidefinite matrix completion (PSDMC) aims to recover positive semidefinite and low-rank matrices from a subset of entries of a matrix. It is widely applicable in many fields, such as statistic analysis and system control.
Fangfang Xu, Peng Pan
doaj +1 more source
Poisson Quantum Information [PDF]
Quantum, 2021 By taking a Poisson limit for a sequence of rare quantum objects, I derive simple formulas for the Uhlmann fidelity, the quantum Chernoff quantity, the relative entropy, and the Helstrom information.
Mankei Tsang
doaj +1 more source
A Sparse Decomposition of Low Rank Symmetric Positive Semidefinite Matrices [PDF]
Multiscale Modeling & simulation, 2016 Suppose that $A \in \mathbb{R}^{N \times N}$ is symmetric positive semidefinite with rank $K \le N$. Our goal is to decompose $A$ into $K$ rank-one matrices $\sum_{k=1}^K g_k g_k^T$ where the modes $\{g_{k}\}_{k=1}^K$ are required to be as sparse as ...
T. Hou, Qin Li, Pengchuan Zhang
semanticscholar +1 more source
Generic Spectrahedral Shadows [PDF]
, 2015 Spectrahedral shadows are projections of linear sections of the cone of positive semidefinite matrices. We characterize the polynomials that vanish on the boundaries of these convex sets when both the section and the projection are generic.Comment ...
Sinn, Rainer, Sturmfels, Bernd
core +1 more source
A counterexample to the Drury permanent conjecture
Special Matrices, 2017 We offer a counterexample to a conjecture concerning the permanent of positive semidefinite matrices. The counterexample is a 4 × 4 complex correlation matrix.
Hutchinson George
doaj +1 more source
Logarithmic barriers for sparse matrix cones
, 2012 Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse matrices with ...
Andersen, Martin S. +2 more
core +1 more source