Some bounds for the spectral radius of the Hadamard product of matrices.
Cheng, Guang-Hui, Cheng, Xiao-Yu, Huang, Ting-Zhu, Tam, Tin-Yau (2005)
Applied Mathematics E-Notes [electronic only]
Similarity:
Cheng, Guang-Hui, Cheng, Xiao-Yu, Huang, Ting-Zhu, Tam, Tin-Yau (2005)
Applied Mathematics E-Notes [electronic only]
Similarity:
Yang, Shi-Ming, Huang, Ting-Zhu (2005)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Feng Wang, Deshu Sun (2016)
Open Mathematics
Similarity:
Some new bounds for the minimum eigenvalue of M-matrices are obtained. These inequalities improve existing results, and the estimating formulas are easier to calculate since they only depend on the entries of matrices. Finally, some examples are also given to show that the bounds are better than some previous results.
Clive Elphick, Pawel Wocjan (2015)
Discussiones Mathematicae Graph Theory
Similarity:
One of the best known results in spectral graph theory is the following lower bound on the chromatic number due to Alan Hoffman, where μ1 and μn are respectively the maximum and minimum eigenvalues of the adjacency matrix: χ ≥ 1+μ1/−μn. We recently generalised this bound to include all eigenvalues of the adjacency matrix. In this paper, we further generalize these results to include all eigenvalues of the adjacency, Laplacian and signless Laplacian matrices. The various known bounds...
Guang-Da Hu, Qiao Zhu (2010)
Kybernetika
Similarity:
This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper bounds of modulus of eigenvalues are given by the Stein equation. Furthermore, two sequences are presented which converge to the minimal and the maximal modulus of eigenvalues, respectively. We have to point out that the two sequences are not recommendable for practical use for finding the minimal and the maximal modulus of eigenvalues.
Zeng, Li, Xiao, Ming, Huang, Tin-Zhu (2009)
Applied Mathematics E-Notes [electronic only]
Similarity:
Jorma K. Merikoski, Pentti Haukkanen, Mika Mattila, Timo Tossavainen (2018)
Special Matrices
Similarity:
Consider the recursion g0 = a, g1 = b, gn = gn−1 + gn−2, n = 2, 3, . . . . We compute the Frobenius norm of the r-circulant matrix corresponding to g0, . . . , gn−1. We also give three lower bounds (with equality conditions) for the spectral norm of this matrix. For this purpose, we present three ways to estimate the spectral norm from below in general.
Elhashash, Abed, Szyld, Daniel B. (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Xiaogen Chen (2015)
Special Matrices
Similarity:
Let B2m denote the Brualdi-Li matrix of order 2m, and let ρ2m = ρ(B2m ) denote the spectral radius of the Brualdi-Li Matrix. Then [...] . where m > 2, e = 2.71828 · · · , [...] and [...] .