Results 31 to 40 of about 2,871 (211)
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
A Characterization on Singular Value Inequalities of Matrices
We obtain a characterization of pair matrices A and B of order n such that sjA≤sjB, j=1, …, n, where sjX denotes the j-th largest singular values of X. It can imply not only some well-known singular value inequalities for sums and direct sums of matrices
Wei Dai, Yongsheng Ye
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
有关矩阵广义逆的惯性指数及其应用(Inertia formulae related to the generalized inverse with applications)
In this paper, firstly, we establish the inertia formulae for some matrix expressions related to the generalized inverse . Then, as applications, based on the derived inertia formulae, we study the definiteness of some matrices.
WUZhongcheng(吴中成) +1 more
doaj +1 more source
Elsner L, Mehrmann V. Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations. Numerische Mathematik.
Mehrmann, Volker, Elsner, Ludwig
core +1 more source
Measuring Sphericity in Positive Semi-Definite Matrices
The measure of sphericity for positive semi-definite matrices plays a crucial role in understanding their geometric properties, especially in high-dimensional settings.
Dário Ferreira, Sandra S. Ferreira
doaj +1 more source
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
A successful computational approach for solving large-scale positive semidefinite (PSD) programs is to enforce PSD-ness on only a collection of submatrices. For our study, we let $\mathcal{S}^{n,k}$ be the convex cone of $n\times n$ symmetric matrices where all $k\times k$ principal submatrices are PSD.
Grigoriy Blekherman +3 more
openaire +2 more sources
Using distance on the Riemannian manifold to compare representations in brain and in models
Representational similarity analysis (RSA) summarizes activity patterns for a set of experimental conditions into a matrix composed of pairwise comparisons between activity patterns.
Mahdiyar Shahbazi +3 more
doaj +1 more source
Trace-Inequalities and Matrix-Convex Functions
A real-valued continuous function f(t) on an interval (α,β) gives rise to a map X↦f(X) via functional calculus from the convex set of n×n Hermitian matrices all of whose eigenvalues belong to the interval. Since the subpace of
Tsuyoshi Ando
doaj +2 more sources
A class of positive semidefinite matrices
It is a known fact that, given a positive definite matrix \(y_{ij}\), the ``standardized'' matrix \(y_{ij}(y_{ii}y_{jj})^{-}\) is again positive definite. The authors investigate more general standardization methods of the form \(a_{ij}(\alpha)y_{ij}\) where \(\alpha\) is a positive number and \(a_{ij}(\alpha)=(\phi (x_ i,\alpha)+\phi (x_ j,\alpha))^{-}
Russell, A.M., Upton, C.J.F.
openaire +2 more sources

