Results 11 to 20 of about 299 (58)
Some results on the partial orderings of block matrices
Journal of Inequalities and Applications, 2011 Some results relating to the block matrix partial orderings and the submatrix partial orderings are given. Special attention is paid to the star ordering of a sum of two matrices and the minus ordering of matrix product. Several equivalent conditions for
Liu Xifu, Yang Hu
doaj +2 more sources
On some trace inequalities for positive definite Hermitian matrices
Journal of Inequalities and Applications, 2014 Let A be a positive definite Hermitian matrix, we investigate the trace inequalities of A. By using the equivalence of the deformed matrix, according to some properties of positive definite Hermitian matrices and some elementary inequalities, we extend ...
Houqing Zhou
semanticscholar +2 more sources
Journal of Inequalities and Applications, 2013 The general coupled matrix equations ∑j=1qAijXjBij=Mi,i=1,2,…,p (including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory.
F. Yin, Ke Guo, G. Huang
semanticscholar +2 more sources
An extension of Haynsworth’s determinant inequality
, 1973 Let A and B be positive definite hermitian matrices of order n. This paper improves a bower bound given for 1A+B1 by E. V. Haynsworth. In [1] E. V. Haynsworth proves that if A and B are positive definite hermitian matrices of order n then JA +B?
D. Hartfiel
semanticscholar +1 more source
Uniform bounds on the 1-norm of the inverse of lower triangular Toeplitz matrices [PDF]
, 2011 A uniform bound on the 1-norm is given for the inverse of a lower triangular Toeplitz matrix with non-negative monotonically decreasing entries whose limit is zero. The new bound is sharp under certain specified constraints.
Berenhaut +16 more
core +1 more source
Some lower bounds for the Perron root of a nonnegative matrix
, 2012 In this paper, we present some lower bounds for the Perron root of a symmetric nonnegative matrix, which are then applied to give the lower bounds of the Perron root of a general nonnegative matrix. These bounds improve the corresponding ones in [3] and [
S. Shen, Guang-Bin Wang
semanticscholar +1 more source
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
Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum [PDF]
, 2005 In this paper, we present new algorithms that can replace the diagonal entries of a Hermitian matrix by any set of diagonal entries that majorize the original set without altering the eigenvalues of the matrix.
Dhillon, Inderjit S. +3 more
core +2 more sources
Self-inversive matrix polynomials with semisimple spectrum on the unit circle
, 2011 The spectrum of a class of self-inversive matrix polynomials is studied. It is shown that the characteristic values are semisimple and lie on the unit circle if the inner radius of an associated matrix polynomial is greater than 1 .
N. Ito, R. Küstner, H. K. Wimmer
semanticscholar +1 more source
Essentially hermitian matrices and inclusion relations of C -numerical ranges
, 2009 Let M denote the set of all n× n complex matrices and Mn denote the set of n× n matrices with trace 0 . For any C ∈ Mn , there exists a maximal ν(C) 0 such that ν(C)WD(A) ⊆ ‖D‖FWC(A) whenever D ∈ Mn and A ∈ Mn .
W. Cheung
semanticscholar +1 more source