Results 41 to 50 of about 486 (86)
Shape optimization for an elliptic operator with infinitely many positive and negative eigenvalues
Advances in Nonlinear Analysis, 2018 This paper deals with an eigenvalue problem possessing infinitely many positive and negative eigenvalues. Inequalities for the smallest positive and the largest negative eigenvalues, which have the same properties as the fundamental frequency, are ...
Bandle Catherine, Wagner Alfred
doaj +1 more source
Singular value inequalities related to the Audenaert-Zhan inequality
, 2016 In this paper, we refine the Heinz mean inequality for singular values and give some generalizations of Audenaert-Zhan inequality for singular values and Zhan’s conjecture for the case of negative t .
Hong-liang Zuo +3 more
semanticscholar +1 more source
The Laplacian Eigenvalues and Invariants of Graphs
, 2014 In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues.
Pan, Rong-Ying +2 more
core +1 more source
, 2013 Let A and B be nonsingular M-matrices. Several new bounds on the minimum eigenvalue for the Hadamard product of B and the inverse matrix of A are given. These bounds can improve considerably some previous results.MSC:15A42, 15B34.
Yaotang Li +3 more
semanticscholar +1 more source
Hölder type inequalities for matrices
, 1998 We discuss Holder type inequalites involving (Ap + Bp)1/p for positive semi-definite matrices A , B . Matrix or trace inequalities of Holder type as well as weak majorizations of similar type are obtained.
T. Andô, F. Hiai
semanticscholar +1 more source
Riemann sums for self-adjoint operators
, 2014 This paper focuses on Riemann sums for the functional calculus of bounded selfadjoint operaors. We first obtain some monotonicity properties of operator convex functions.
J. Rooin, A. Alikhani, M. Moslehian
semanticscholar +1 more source
Linear combinations of graph eigenvalues
, 2006 Let F(G) be a fixed linear combination of the k extremal eigenvalues of a graph G and of its complement. The problem of finding max{F(G):v(G)=n} generalizes a number of problems raised previously in the literature. We show that the limit max{F(G):v(G)=n}/
Nikiforov, Vladimir
core +1 more source
Weak majorization inequalities for singular values
, 2013 In this paper, we refine an inequality due to Bhatia and Kittaneh [Linear Algebra Appl. 308 (2000) 203–211], and generalize another inequality by Bhatia and Kittaneh [Lett. Math. Phys. 43 (1998) 225–231]. Mathematics subject classification (2010): 15A18,
L. Zou, Chuanjiang He
semanticscholar +1 more source
Some inequalities for the spectral radius of the Hadamard product of two nonnegative matrices
, 2013 In this paper, we propose some sharper upper bounds for the spectral radius of the Hadamard product of two nonnegative matrices. The results involve the directed graph of the Hadamard product of associated matrices.
G. Cheng, Susie Xi Rao
semanticscholar +1 more source
Successive iterations and logarithmic means
, 2013 The successive iteration (started by Lagrange and Gauss) produces a new mean from two given ones. Several examples of matrix means are given that require the proof of the matrix monotonicity of the corresponding representing function.
Ádám Besenyei, D. Petz
semanticscholar +1 more source