Results 21 to 30 of about 424 (74)
Reverses and variations of Young's inequalities with Kantorovich constant
, 2016 In this paper, we obtain some improved Young and Heinz inequalities and the reverse versions for scalars and matrices with Kantorovich constant, equipped with the Hilbert-Schmidt norm, and then we present the corresponding interpolations of recent ...
Haisong Cao, Junliang Wu
semanticscholar +1 more source
New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
Open Mathematics, 2019 A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola ...
Hou Zhiwu, Jing Xia, Gao Lei
doaj +1 more source
On semidefinite representations of non-closed sets [PDF]
, 2009 Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in semidefinite ...
Netzer, Tim
core +2 more sources
Sharpening of the inequalities of Schur, Eberlein, Kress and Huang, and new location of eigenvalues
, 2014 Let A = (ai j) be an n×n complex matrix with eigenvalues λ1 ,λ2 , · · · ,λn . We determine the new upper bounds of n ∑ j=1 |λ j |2 , which will sharpen Schur, Eberlein, Kress and Huang’s inequalities. We also exhibit new methods to locate the eigenvalues
Junliang Wu, Dafei Wang
semanticscholar +1 more source
A bound on the scrambling index of a primitive matrix using Boolean rank [PDF]
, 2009 The scrambling index of an $n\times n$ primitive matrix $A$ is the smallest positive integer $k$ such that $A^k(A^{t})^k=J$, where $A^t$ denotes the transpose of $A$ and $J$ denotes the $n\times n$ all ones matrix.
Akelbek, Mahmud +2 more
core +2 more sources
The Correlation Numerical Range of a Matrix and Connes' Embedding Problem [PDF]
, 2011 We define a new numerical range of an n\timesn complex matrix in terms of correlation matrices and develop some of its properties.
Hadwin, Don, Han, Deguang
core +2 more sources
An algorithm for determining copositive matrices [PDF]
, 2011 In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial subdivision of
Xu, Jia, Yao, Yong
core +2 more sources
, 1998 The matrix pencil (A,B) = {tB-A | t \in C} is considered under the assumptions that A is entrywise nonnegative and B-A is a nonsingular M-matrix. As t varies in [0,1], the Z-matrices tB-A are partitioned into the sets L_s introduced by Fiedler and ...
Driessche, P. van den +4 more
core +2 more sources
Monotone matrix functions of successive orders [PDF]
, 2004 This paper extends a result obtained by Wigner and von Neumann. We prove that a non-constant real-valued function, f(x), in C^3(I) where I is an interval of the real line, is a monotone matrix function of order n+1 on I if and only if a related, modified
Nayak, Suhas
core
Positive commutators and collections of operators
, 2012 Let A and B be completely decomposable nonnegative matrices such that the commutator AB− BA is also a nonnegative matrix. We prove that the set {A,B} is completely decomposable, i.e., there exists a permutation matrix P such that PAP−1 and PBP−1 are ...
R. Drnovšek, Martin Jesenko, M. Kandić
semanticscholar +1 more source