全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Algebra  2013 

Bound on the Minimum Eigenvalue of -Matrices Involving Hadamard Products

DOI: 10.1155/2013/102438

Full-Text   Cite this paper   Add to My Lib

Abstract:

We present a new lower bound on the minimum eigenvalue of -matrices involving Hadamard products , and we show that our lower bound is larger than the lower bound . Three examples verify our result. 1. Introduction In [1], it is shown by Theorem??5.7.15 that if are ?? -matrices for all , and satisfy , then where is defined as entrywise and any scalar definition of such that is allowed. This theorem provided a beautiful result about the minimum eigenvalue of -matrices involving Hadamard products, but sometimes this inequality could be very weak. For example, are -matrices, and see the details in Section 3. A lot of works have been done on the minimum eigenvalue of -matrices and -matrices involving Hadamard products, see the results in [1–6]. In this paper, we present a new lower bound by including diagonal entries and prove that our bound is larger than the bound in (1). We now introduce some notations, see [1]. The Hadamard product of and is defined by . We define and . Let and denote by for every . We denote , where , and denote by the class of all real matrices all of whose off-diagonal entries are nonpositive. Let , then the minimum eigenvalue of is defined by ; is a eigenvalue of . For two real matrices , the Fan product of and , denoted by , is defined by and then . The comparison matrix of a given matrix is defined by A matrix is an -matrix if its comparison matrix is an -matrix. For , we define . Last, for , we introduce a new definition , where 2. Main Results To prove the main theorem, we need several lemmas. Lemma 1. Let for all . If and , then Proof. When , we can prove this inequality by the H?lder inequality and by induction. When , apparently, , similarly, we can prove this inequality. If , then for some and some . Let . Then . If there is a such that , then , but this is a contradiction. So, . If is the right Perron eigenvector of , then . If is the left Perron eigenvector of , then . So, similar to the Perron-Frobenius theorem, we have the following: if became irreducible, then there exist positive vectors and such that , and , and being called right and left Perron eigenvectors of , respectively. Lemma 2. If is irreducible, and for a nonnegative nonzero vector , then . Proof. , where is irreducible and . By the Perron-Frobenius theorem, has a positive left Perron vector , that is, . Note that . Hence, . Since , we have . Lemma 3. Let for all . If and , then Proof. It is quite evident that the conclusion holds with equality for . For , we have two cases. Case??1. is irreducible. Then are irreducible for all . Thus, are irreducible for all

References

[1]  R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
[2]  H.-B. Li, T.-Z. Huang, S.-Q. Shen, and H. Li, “Lower bounds for the minimum eigenvalue of Hadamard product of an -matrix and its inverse,” Linear Algebra and Its Applications, vol. 420, no. 1, pp. 235–247, 2007.
[3]  M. Fiedler and T. L. Markham, “An inequality for the Hadamard product of an -matrix and an inverse -matrix,” Linear Algebra and Its Applications, vol. 101, pp. 1–8, 1988.
[4]  M. Fang, “Bounds on eigenvalues of the Hadamard product and the Fan product of matrices,” Linear Algebra and Its Applications, vol. 425, no. 1, pp. 7–15, 2007.
[5]  P. N. Shivakumar, J. J. Williams, Q. Ye, and C. A. Marinov, “On two-sided bounds related to weakly diagonally dominant -matrices with application to digital circuit dynamics,” SIAM Journal on Matrix Analysis and Applications, vol. 17, no. 2, pp. 298–312, 1996.
[6]  L. M. Zou, Y. Y. Jiang, J. K. Liu, and Y. M. Feng, “Bounds on the minimum eigenvalue of -matrices,” Southeast Asian Bulletin of Mathematics, vol. 34, no. 6, pp. 1165–1169, 2010.
[7]  G. H. Hardy, J. E. Littlewood, and G. Polyn, Inequalities, Cambridge University Press, Cambridage, UK, 1934.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133