Results 11 to 20 of about 424 (74)
Bounds on normalized Laplacian eigenvalues of graphs
Journal of Inequalities and Applications, 2014 Let G be a simple connected graph of order n, where n≥2. Its normalized Laplacian eigenvalues are 0=λ1≤λ2≤⋯≤λn≤2. In this paper, some new upper and lower bounds on λn are obtained, respectively.
Jianxi Li, Ji-Ming Guo, W. Shiu
semanticscholar +2 more sources
Some inequalities for the Hadamard product of an M-matrix and an inverse M-matrix
Journal of Inequalities and Applications, 2013 Let A and B be nonsingular M-matrices. Some new lower bounds on the minimum eigenvalue q(A∘B−1) for the Hadamard product of A and B−1 are given. These bounds improve the corresponding results of Chen (Linear Algebra Appl.
D. Zhou +3 more
semanticscholar +2 more sources
The improved disc theorems for the Schur complements of diagonally dominant matrices
Journal of Inequalities and Applications, 2013 The theory of Schur complement is very important in many fields such as control theory and computational mathematics. In this paper, applying the properties of Schur complement, utilizing some inequality techniques, some new estimates of diagonally ...
Juan Zhang, Jianzhou Liu, Gen Tu
semanticscholar +2 more sources
Journal of Inequalities and Applications, 2013 By applying the properties of Schur complement and some inequality techniques, some new estimates of diagonally dominant degree on the Schur complement of matrices are obtained, which improve the main results of Liu (SIAM J. Matrix Anal. Appl. 27:665-674,
Yaotang Li, Feng Wang
semanticscholar +2 more sources
Some new inequalities for the Hadamard product of M-matrices
Journal of Inequalities and Applications, 2013 If A and B are n×n nonsingular M-matrices, a new lower bound for the minimum eigenvalue τ(B∘A−1) for the Hadamard product of B and A−1 is derived. As a consequence, a new lower bound for the minimum eigenvalue τ(A∘A−1) for the Hadamard product of A and ...
Fu-bin Chen
semanticscholar +2 more sources
Interior points of the completely positive cone. [PDF]
, 2008 A matrix A is called completely positive if it can be decomposed as A = BB^T with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone.
Dür, Mirjam, Still, Georg
core +6 more sources
Matrix measure and application to stability of matrices and interval dynamical systems
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 2, Page 75-85, 2003., 2003 Using some properties of the matrix measure, we obtain a general condition for the stability of a convex hull of matrices that will be applied to study the stability of interval dynamical systems. Some classical results from stability theory are reproduced and extended.
Ziad Zahreddine
wiley +1 more source
The almost semimonotone matrices
Special Matrices, 2019 A (strictly) semimonotone matrix A ∈ ℝn×n is such that for every nonzero vector x ∈ ℝn with nonnegative entries, there is an index k such that xk > 0 and (Ax)k is nonnegative (positive).
Wendler Megan
doaj +1 more source
The Dittert′s function on a set of nonnegative matrices
International Journal of Mathematics and Mathematical Sciences, Volume 13, Issue 4, Page 709-716, 1990., 1990 Let Kn denote the set of all n × n nonnegative matrices with entry sum n. For X ∈ Kn with row sum vector (r1, …, rn), column sum vector (c1, …, cn), Let ϕ(X)=∏iri+∏jcj−perX. Dittert′s conjecture asserts that ϕ(X) ≤ 2 − n!/nn for all X ∈ Kn with equality iff X = [1/n]n×n. This paper investigates some properties of a certain subclass of Kn related to the
Suk Geun Hwang, Mun-Gu Sohn, Si-Ju Kim
wiley +1 more source
A new upper bound on the largest normalized Laplacian eigenvalue
, 2013 Let G be a simple undirected connected graph on n vertices. Suppose that the vertices of G are labelled 1,2, . . . ,n. Let di be the degree of the vertex i.
O. Rojo, R. Soto
semanticscholar +1 more source