scholarly journals Some Bounds on Eigenvalues of the Hadamard Product and the Fan Product of Matrices

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 147
Author(s):  
Qianping Guo ◽  
Jinsong Leng ◽  
Houbiao Li ◽  
Carlo Cattani
Keyword(s):  
Lower Bound ◽  
Spectral Radius ◽  
Upper Bound ◽  
Hadamard Product ◽  
Simple Type ◽  
Nonnegative Matrices ◽  
Minimum Eigenvalue ◽  
Numerical Examples ◽  
Product Of Matrices

In this paper, an upper bound on the spectral radius ρ ( A ∘ B ) for the Hadamard product of two nonnegative matrices (A and B) and the minimum eigenvalue τ ( C ★ D ) of the Fan product of two M-matrices (C and D) are researched. These bounds complement some corresponding results on the simple type bounds. In addition, a new lower bound on the minimum eigenvalue of the Fan product of several M-matrices is also presented. These results and numerical examples show that the new bounds improve some existing results.

scholarly journals Some Bounds on Eigenvalues of the Hadamard Product and the Fan Product of Matrices

2018 ◽  
Author(s):  
Qianping Guo ◽  
Jinsong Leng ◽  
Houbiao Li ◽  
Carlo Cattani
Keyword(s):  
Lower Bound ◽  
Spectral Radius ◽  
Mixed Type ◽  
Hadamard Product ◽  
Simple Type ◽  
Nonnegative Matrices ◽  
Minimum Eigenvalue ◽  
Numerical Examples ◽  
Special Cases ◽  
Product Of Matrices

In this paper, some mixed type bounds on the spectral radius $\rho(A\circ B)$ for the Hadamard product of two nonnegative matrices ($A$ and $B$) and the minimum eigenvalue $\tau(C\star D)$ of the Fan product of two $M$-matrices ($C$ and $D$) are researched. These bounds complement some corresponding results on the simple type bounds. In addition, a new lower bound on the minimum eigenvalue of the Fan product of several $M$-matrices is also presented: $$ \tau(A_{1}\star A_{2}\cdots\star A_{m})\geq \min_{1\leq i\leq n}\{\prod^{m}_{k=1}A_{k}(i,i)-\prod^{m}_{k=1}[A_{k}(i,i)^{P_{k}}-\tau(A_{k}^{(P_{k})})]^\frac{1}{P_{k}}\}, $$ where $A_{1},\ldots, A_{k}$ are $n\times n$ $M$-matrices and $P_{1},\ldots, P_{k}>0$ satisfy $\sum^{m}_{k=1}\frac{1}{P_{k}}\geq 1$. Some special cases of the above result and numerical examples show that this new bound improves some existing results.

scholarly journals Sharp Bounds on the Spectral Radius of Nonnegative Matrices and Comparison to the Frobenius’ Bounds

2020 ◽  
Vol 14 ◽  
Keyword(s):  
Lower Bound ◽  
Spectral Radius ◽  
Discrete Time ◽  
Upper Bound ◽  
Nonnegative Matrix ◽  
Nonnegative Matrices ◽  
Sharp Bounds ◽  
Similarity Transformations ◽  
Linear Invariant ◽  
The Stability

In this paper, a new upper bound and a new lower bound for the spectral radius of a nοnnegative matrix are proved by using similarity transformations. These bounds depend only on the elements of the nonnegative matrix and its row sums and are compared to the well-established upper and lower Frobenius’ bounds. The proposed bounds are always sharper or equal to the Frobenius’ bounds. The conditions under which the new bounds are sharper than the Frobenius' ones are determined. Illustrative examples are also provided in order to highlight the sharpness of the proposed bounds in comparison with the Frobenius’ bounds. An application to linear invariant discrete-time nonnegative systems is given and the stability of the systems is investigated. The proposed bounds are computed with complexity O(n2).

scholarly journals New bounds for the minimum eigenvalue of 𝓜-tensors

2017 ◽  
Vol 15 (1) ◽  
pp. 296-303 ◽  
Author(s):  
Jianxing Zhao ◽  
Caili Sang
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Minimum Eigenvalue ◽  
Numerical Examples ◽  
Theoretical Results

Abstract A new lower bound and a new upper bound for the minimum eigenvalue of an 𝓜-tensor are obtained. It is proved that the new lower and upper bounds improve the corresponding bounds provided by He and Huang (J. Inequal. Appl., 2014, 2014, 114) and Zhao and Sang (J. Inequal. Appl., 2016, 2016, 268). Finally, two numerical examples are given to verify the theoretical results.

scholarly journals Bounds for the Z-eigenpair of general nonnegative tensors

2016 ◽  
Vol 14 (1) ◽  
pp. 181-194 ◽  
Author(s):  
Qilong Liu ◽  
Yaotang Li
Keyword(s):  
Lower Bound ◽  
Spectral Radius ◽  
Upper Bound ◽  
Upper Bounds ◽  
Irreducible Tensor ◽  
Numerical Examples ◽  
Nonnegative Tensors ◽  
Weakly Symmetric

AbstractIn this paper, we consider the Z-eigenpair of a tensor. A lower bound and an upper bound for the Z-spectral radius of a weakly symmetric nonnegative irreducible tensor are presented. Furthermore, upper bounds of Z-spectral radius of nonnegative tensors and general tensors are given. The proposed bounds improve some existing ones. Numerical examples are reported to show the effectiveness of the proposed bounds.

scholarly journals The Algebraic Degree of Phase-Type Distributions

2010 ◽  
Vol 47 (03) ◽  
pp. 611-629
Author(s):  
Mark Fackrell ◽  
Qi-Ming He ◽  
Peter Taylor ◽  
Hanqin Zhang
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Polynomial Algorithm ◽  
Algebraic Degree ◽  
Nonnegative Matrices ◽  
Stieltjes Transform ◽  
Special Cases ◽  
Phase Type ◽  
Phase Type Distributions ◽  
The Matrix

This paper is concerned with properties of the algebraic degree of the Laplace-Stieltjes transform of phase-type (PH) distributions. The main problem of interest is: given a PH generator, how do we find the maximum and the minimum algebraic degrees of all irreducible PH representations with that PH generator? Based on the matrix exponential (ME) order of ME distributions and the spectral polynomial algorithm, a method for computing the algebraic degree of a PH distribution is developed. The maximum algebraic degree is identified explicitly. Using Perron-Frobenius theory of nonnegative matrices, a lower bound and an upper bound on the minimum algebraic degree are found, subject to some conditions. Explicit results are obtained for special cases.

scholarly journals New Bounds for the α-Indices of Graphs

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1668
Author(s):  
Eber Lenes ◽  
Exequiel Mallea-Zepeda ◽  
Jonnathan Rodríguez
Keyword(s):  
Lower Bound ◽  
Spectral Radius ◽  
Upper Bound ◽  
Adjacency Matrix ◽  
Independence Number ◽  
Minimal Degree ◽  
Diagonal Matrix ◽  
The Matrix

Let G be a graph, for any real 0≤α≤1, Nikiforov defines the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal matrix of degrees of the vertices of G. This paper presents some extremal results about the spectral radius ρα(G) of the matrix Aα(G). In particular, we give a lower bound on the spectral radius ρα(G) in terms of order and independence number. In addition, we obtain an upper bound for the spectral radius ρα(G) in terms of order and minimal degree. Furthermore, for n>l>0 and 1≤p≤⌊n−l2⌋, let Gp≅Kl∨(Kp∪Kn−p−l) be the graph obtained from the graphs Kl and Kp∪Kn−p−l and edges connecting each vertex of Kl with every vertex of Kp∪Kn−p−l. We prove that ρα(Gp+1)<ρα(Gp) for 1≤p≤⌊n−l2⌋−1.

scholarly journals Lower bounds to eigenvalues of the Schrödinger equation by solution of a 90-y challenge

2020 ◽  
Vol 117 (28) ◽  
pp. 16181-16186
Author(s):  
Rocco Martinazzo ◽  
Eli Pollak
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Spectral Features ◽  
Numerical Examples ◽  
Tunneling Splittings ◽  
Order Of Magnitude ◽  
Bound Theorem ◽  
Math Phys ◽  
Better Than

The Ritz upper bound to eigenvalues of Hermitian operators is essential for many applications in science. It is a staple of quantum chemistry and physics computations. The lower bound devised by Temple in 1928 [G. Temple,Proc. R. Soc. A Math. Phys. Eng. Sci.119, 276–293 (1928)] is not, since it converges too slowly. The need for a good lower-bound theorem and algorithm cannot be overstated, since an upper bound alone is not sufficient for determining differences between eigenvalues such as tunneling splittings and spectral features. In this paper, after 90 y, we derive a generalization and improvement of Temple’s lower bound. Numerical examples based on implementation of the Lanczos tridiagonalization are provided for nontrivial lattice model Hamiltonians, exemplifying convergence over a range of 13 orders of magnitude. This lower bound is typically at least one order of magnitude better than Temple’s result. Its rate of convergence is comparable to that of the Ritz upper bound. It is not limited to ground states. These results complement Ritz’s upper bound and may turn the computation of lower bounds into a staple of eigenvalue and spectral problems in physics and chemistry.

An upper bound for the velocity of first-passage percolation

1981 ◽  
Vol 18 (01) ◽  
pp. 256-262 ◽  
Author(s):  
Svante Janson
Keyword(s):  
Lower Bound ◽  
Time Constant ◽  
Upper Bound ◽  
Square Lattice ◽  
First Passage Percolation ◽  
First Passage ◽  
Numerical Examples ◽  
Asymptotic Velocity

An upper bound for the asymptotic velocity in various directions of first-passage percolation on the square lattice is derived. In particular this gives a lower bound for the so-called time constant. The result is generalized to other lattices. Numerical examples are included.

scholarly journals New Sufficient Condition for the Positive Definiteness of Fourth Order Tensors

Mathematics ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 303 ◽  
Author(s):  
Jun He ◽  
Yanmin Liu ◽  
Junkang Tian ◽  
Zhuanzhou Zhang
Keyword(s):  
Spectral Radius ◽  
Fourth Order ◽  
Upper Bound ◽  
Positive Definiteness ◽  
Sufficient Condition ◽  
Numerical Examples ◽  
Eigenvalue Localization ◽  
Weakly Symmetric ◽  
Localization Set

In this paper, we give a new Z-eigenvalue localization set for Z-eigenvalues of structured fourth order tensors. As applications, a sharper upper bound for the Z-spectral radius of weakly symmetric nonnegative fourth order tensors is obtained and a new Z-eigenvalue based sufficient condition for the positive definiteness of fourth order tensors is also presented. Finally, numerical examples are given to verify the efficiency of our results.

Sign in / Sign up

Export Citation Format

Share Document