• 検索結果がありません。

BOUNDSONTHESPECTRALRADIUSOFAHADAMARDPRODUCTOFNONNEGATIVEORPOSITIVESEMIDEFINITEMATRICES ELA

N/A
N/A
Protected

Academic year: 2022

シェア "BOUNDSONTHESPECTRALRADIUSOFAHADAMARDPRODUCTOFNONNEGATIVEORPOSITIVESEMIDEFINITEMATRICES ELA"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

ELA

BOUNDS ON THE SPECTRAL RADIUS OF A HADAMARD PRODUCT OF NONNEGATIVE OR

POSITIVE SEMIDEFINITE MATRICES

ROGER A. HORN AND FUZHEN ZHANG

Abstract. X. Zhan has conjectured that the spectral radius of the Hadamard product of two square nonnegative matrices is not greater than the spectral radius of their ordinary product. We prove Zhan’s conjecture, and a related inequality for positive semidefinite matrices, using standard facts about principal submatrices, Kronecker products, and the spectral radius.

Key words. Hadamard product, Nonnegative matrix, Positive semidefinite matrix, Positive definite matrix, Spectral radius, Kronecker product, Matrix inequality.

AMS subject classifications. 15A45, 15A48, 15A69.

Received by the editors November 4, 2009. Accepted for publication February 8, 2010. Handling Editor: Bit-Shun Tam.

Mathematics Department, University of Utah, Salt Lake City, Utah 84112, USA ([email protected]).

Division of Math, Science and Technology, Nova Southeastern University, Fort Lauderdale, Florida 33314, USA ([email protected]).

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 20, pp. 90-94, February 2010

http://math.technion.ac.il/iic/ela

参照

関連したドキュメント

EQUIVALENCE AND CONGRUENCE OF MATRICES UNDER THE ACTION OF STANDARD PARABOLIC SUBGROUPS ∗.. FERNANDO

An application of our results gives simple upper and lower bounds for the spectral radius of a product of positive operators in terms of positive eigenvectors corresponding to

To prove that a given allowable pair is actually a pair of standard generators, we use the following facts about G (which can be derived from the character table and power maps of

We study the signless Laplacian spectral radius of graphs and prove three conjectures of Cvetković, Rowlinson, and Simić [Eigenvalue bounds for the signless Laplacian,

Using an upper bound for the Laplacian spectral radius of graphs obtained by Shu et al., we in this note present su¢ cient conditions which are based on the Laplacian spectral

The transmission of the graph, also called a distance of the graph, is defined as the sum of distances between all pairs of vertices (for general properties of the distance see

The results are related to the (partly open) problem of finding connected graphs of maximal spectral radius with given number of vertices and edges (but arbitrary degree

In an earlier paper from 1970, entitled “Minimal Gerschgorin sets for partitioned matrices,” a Spectral Conjecture, related to norms and spectral radii of special partitioned