Results 31 to 40 of about 5,647,728 (213)
Analysis of Fixing Nodes Used in Generalized Inverse Computation
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
Poisson Quantum Information [PDF]
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
Positive Semidefinite Matrices, Exponential Convexity for Majorization, and Related Cauchy Means
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
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
Positive semidefinite 3 x 3 block matrices [PDF]
Several results related to positive semidefinite 3 by 3 block matrices are presented. In particular, a question of Audenaert is answered affirmatively and some determinantal inequalities are ...
Lin, Minghua, van den Driessche, Pauline
core +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, are extended to the case of symplectic ...
Son, Nguyen Thanh, Stykel, Tatjana
core +1 more source
A counterexample to the Drury permanent conjecture
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
Hilbert’s 17th problem in free skew fields
This paper solves the rational noncommutative analogue of Hilbert’s 17th problem: if a noncommutative rational function is positive semidefinite on all tuples of Hermitian matrices in its domain, then it is a sum of Hermitian squares of noncommutative ...
Jurij Volčič
doaj +1 more source
The positive semidefiniteness of partitioned matrices
The author gives the character of the Löwner order, i.e. for symmetric matrices A and C such that \(C\leq A\), a symmetric matrix B satisfies \(C\leq B\leq A\) if and only if \(tr(R'B)\leq 1/2tr\{R'(A+C)\}+1/4tr(Q_ R)\) for all possible R, where \(Q_ R=\{(A-C)^{1/2}(R+R')(A-C)(R+R')(A- C)^{1/2}\}^{1/2}.\) An application to varieties of problems ...
openaire +3 more sources
Gap inequalities for non-convex mixed-integer quadratic programs [PDF]
Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs ...
Galli, Laura +2 more
core +4 more sources

