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

ℓ -SPACES BOUNDSONTHESPECTRALRADIUSOFHADAMARDPRODUCTSOFPOSITIVEOPERATORSON ELA

N/A
N/A
Info
ダウンロード
Protected

Academic year: 2022

シェア "ℓ -SPACES BOUNDSONTHESPECTRALRADIUSOFHADAMARDPRODUCTSOFPOSITIVEOPERATORSON ELA"

Copied!
1
0
0

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

今ダウンロードする ( 1 ページ )

全文

(1)

ELA

BOUNDS ON THE SPECTRAL RADIUS OF HADAMARD PRODUCTS OF POSITIVE

OPERATORS ON ℓ

P

-SPACES

∗

ANTON R. SCHEP†

Abstract. Recently, K.M.R. Audenaert (2010), and R.A. Horn and F. Zhang (2010) proved inequalities between the spectral radius of Hadamard products of finite nonnegative matrices and the spectral radius of their ordinary matrix product. We will prove these inequalities in such a way that they extend to infinite nonnegative matricesAand Bthat define bounded operators on the classical sequence spacesℓp.

Key words.Hadamard product, Spectral radius, Nonnegative matrix, Positive operator, Matrix Inequality.

AMS subject classifications. 15A45, 15B48, 47B65.

∗Received by the editors on November 15, 2010. Accepted for publication on April 16, 2011.

Handling Editor: Roger A. Horn.

†Department of Mathematics, University of South Carolina, Columbia, SC 29212, USA ([email protected]).

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 22, pp. 443-447, April 2011

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

参照

今ダウンロードする ( PDF - 1 ページ - 24.21 KB )

関連したドキュメント

LetBn∗(0)be the 5-vertex graph, obtained by identifying a vertex of K3 with a vertex of K30

The spectral radius (the greatest graph eigenvalue, also called “index”) is an important and much studied spectral property of graphs [1–3]... Solving this seemingly simple problem

LihuaFengandGuihaiYu ONTHREECONJECTURESINVOLVINGTHESIGNLESSLAPLACIANSPECTRALRADIUSOFGRAPHS

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

Laplacian Spectral Radius And Some Hamiltonian Properties Of Graphs

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

We introduce the concept of (k, l)-radius of a graph and prove that for any fixed pairk, lthe (k, l)-radius is equal to 2 k2 − l 2 for almost all graphs

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

Graphs with Given Degree Sequence and Maximal Spectral Radius

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

(1)SHARP UPPER BOUNDS ON THE SPECTRAL RADIUS OF THE LAPLACIAN MATRIX OF GRAPHS K

The eigenvalues of the Laplacian matrix are important in graph theory, because they have relations to numerous graph invariants including connectivity, expand- ing

A Simple Method For Estimating The Bounds Of Spectral Radius Of Nonnegative Irreducible Matrices

Based on the Perron complement P(A=A[ ]) and generalized Perron comple- ment P t (A=A[ ]) of a nonnegative irreducible matrix A, we derive a simple and practical method that

SOME BOUNDS FOR THE SPECTRAL RADIUS OF THE HADAMARD PRODUCT OF MATRICES ∗

Some bounds for the spectral radius of the Hadamard product of two nonneg- ative matrices are given.. See [3] for