Results 21 to 30 of about 375 (52)

Some new bounds of the minimum eigenvalue for the Hadamard product of an M-matrix and an inverse M-matrix

Open Mathematics, 2016
Some convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of a nonsingular M-matrix B and the inverse of a nonsingular M-matrix A are given by using Brauer’s theorem.
Zhao Jianxing, Sang Caili
doaj   +1 more source

Eigenvalue Localization Inequalities for Complex Matrices With Order n≥3

Advances in Mathematical Physics
MSC2020 Classification: 15A18, 15A60 ...
Rong Ma, Feng Zhang
doaj   +1 more source

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

The trace norm of r-partite graphs and matrices

, 2015
The trace norm $\left\Vert G\right\Vert _{\ast}$ of a graph $G$ is the sum of its singular values, i.e., the absolute values of its eigenvalues. The norm $\left\Vert G\right\Vert _{\ast}$ has been intensively studied under the name of graph energy, a ...
Nikiforov, V.
core   +1 more source

Further refinements of the Cauchy-Schwarz inequality for matrices [PDF]

, 2014
Let $A, B$ and $X$ be $n\times n$ matrices such that $A, B$ are positive semidefinite. We present some refinements of the matrix Cauchy-Schwarz inequality by using some integration techniques and various refinements of the Hermite--Hadamard inequality ...
Bakherad, Mojtaba
core  

Maximum norms of graphs and matrices, and their complements

, 2013
In this paper, we mainly study the trace norm of the adjacency matrix of a graph, also known as the energy of graph. We give the maximum trace norms for the graph and its complement. In fact, the above problem is stated and solved in a more general setup
Nikiforov, Vladimir, Yuan, Xiying
core   +1 more source

Minimum trace norm of real symmetric and Hermitian matrices with zero diagonal

Special Matrices
We establish tight lower bounds for the trace norm (‖⋅‖1)\left(\Vert \cdot {\Vert }_{1}) of real symmetric and Hermitian matrices with zero diagonal entries in terms of their entrywise L1{L}^{1}-norms (‖⋅‖(1))\left(\Vert \cdot {\Vert }_{\left(1)}).
Einollahzadeh Mostafa, Nematollahi Mohammad Ali   +1 more
doaj   +1 more source

The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs

, 2015
Let $\mathcal{A(}G\mathcal{)},\mathcal{L(}G\mathcal{)}$ and $\mathcal{Q(}% G\mathcal{)}$ be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph $G$, respectively.
Qi, Liqun, Shao, Jiayu, Yuan, Xiying
core   +1 more source

Equality in Wielandt's eigenvalue inequality

, 2015
In this paper we give necessary and sufficient conditions for the equality case in Wielandt's eigenvalue inequality.Comment: 6 pages, few typos are ...
Friedland, Shmuel
core   +2 more sources

On an argument of J.--F. Cardoso dealing with perturbations of joint diagonalizers

, 2012
B. Afsari has recently proposed a new approach to the matrix joint diagonalization, introduced by J.--F. Cardoso in 1994, in order to investigate the independent component analysis and the blind signal processing in a wider prospective.
Russo, Francesco G.
core   +1 more source