Results 41 to 50 of about 424 (74)
Hadamard duals, retractability and Oppenheim's inequality
Oppenheim’s determinantal inequality was originally proved for positive semidefinite matrices and has produced many interesting consequences and applications.
Shaun M. Fallat, Charles R. Johnson
semanticscholar +1 more source
Refinements on the interlacing of eigenvalues of certain totally nonnegative matrices
It has long been known that the eigenvalues of a totally positive matrix interlace the eigenvalues of its maximal leading principal submatrix. Motivated by recent questions arising from studying the roots of certain biorthogonal polynomials, we extend ...
Shaun M. Fallat, H. Woerdeman
semanticscholar +1 more source
Infinite and finite dimensional Hilbert tensors
For an $m$-order $n-$dimensional Hilbert tensor (hypermatrix) $\mathcal{H}_n=(\mathcal{H}_{i_1i_2\cdots i_m})$, $$\mathcal{H}_{i_1i_2\cdots i_m}=\frac1{i_1+i_2+\cdots+i_m-m+1},\ i_1,\cdots, i_m=1,2,\cdots,n$$ its spectral radius is not larger than $n^{m ...
Qi, Liqun, Song, Yisheng
core +1 more source
Tensor Complementarity Problem and Semi-positive Tensors
The tensor complementarity problem $(\q, \mathcal{A})$ is to $$\mbox{ find } \x \in \mathbb{R}^n\mbox{ such that }\x \geq \0, \q + \mathcal{A}\x^{m-1} \geq \0, \mbox{ and }\x^\top (\q + \mathcal{A}\x^{m-1}) = 0.$$ We prove that a real tensor $\mathcal ...
Qi, Liqun, Song, Yisheng
core +1 more source
Spectrum preserving lower triangular completions - the nonnegative nilpotent case
Nonnegative nilpotent lower triangular completions of a nonnegative nilpotent matrix are studied. It is shown that for every natural number between the index of the matrix and its order, there exists a completion that has this number as its index.
A. Berman, M. Krupnik
semanticscholar +1 more source
The Luk\'{a}cs--Olkin--Rubin theorem on symmetric cones [PDF]
In this paper we prove a Luk\'{a}cs type characterization theorem of the Wishart distribution on Euclidean simple Jordan algebras under weak regularity assumptions (e.g.
Gselmann, Eszter
core
On the rate of convergence of the image space reconstruction algorithm
The Image Space Reconstruction Algorithm (ISRA) of Daube–Witherspoon and Muehllehner is a multiplicative algorithm for solving nonnegative least squares problems. Eggermont has proved the global convergence of this algorithm.
Jianda Han+3 more
semanticscholar +1 more source
This paper is concerned with the problem of existence of invariant sublattices for a positive matrix or a positive operator on Lp(μ). Common invariant sublattices for certain semigroups of positive operators are constructed.
H. Radjavi, V. G. Troitsky
semanticscholar +1 more source
Exposed faces of semidefinitely representable sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite.
Netzer, Tim+2 more
core +1 more source
Nonnegative matrices with nonnegative inverses
We generalize a result stating that a nonnegative finite square matrix has a nonnegative inverse if and only if it is the product of a permutation matrix by a diagonal matrix.
R. Demarr
semanticscholar +1 more source