Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor

2011 ◽  
Vol 19 (5) ◽  
pp. 830-841 ◽  
Author(s):  
Liping Zhang ◽  
Liqun Qi
Keyword(s):  
Linear Convergence ◽  
Nonnegative Tensor ◽  
Largest Eigenvalue ◽  
Convergence Of An Algorithm ◽  
The Largest Eigenvalue

scholarly journals On the largest eigenvalue of a symmetric nonnegative tensor

2013 ◽  
Vol 20 (6) ◽  
pp. 913-928 ◽  
Author(s):  
Guanglu Zhou ◽  
Liqun Qi ◽  
Soon-Yi Wu
Keyword(s):  
Nonnegative Tensor ◽  
Largest Eigenvalue ◽  
The Largest Eigenvalue

scholarly journals The Perturbation Bound for the Spectral Radius of a Nonnegative Tensor

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Wen Li ◽  
Michael K. Ng
Keyword(s):  
Spectral Radius ◽  
Perturbation Analysis ◽  
Absolute Difference ◽  
Nonnegative Tensor ◽  
Backward Error ◽  
Perturbation Bound ◽  
Error Matrix ◽  
Largest Eigenvalue ◽  
The Stability ◽  
The Largest Eigenvalue

We study the perturbation bound for the spectral radius of an mth-order n-dimensional nonnegative tensor A. The main contribution of this paper is to show that when A is perturbed to a nonnegative tensor A~ by ΔA, the absolute difference between the spectral radii of A and A~ is bounded by the largest magnitude of the ratio of the ith component of ΔAxm-1 and the ith component xm-1, where x is an eigenvector associated with the largest eigenvalue of A in magnitude and its entries are positive. We further derive the bound in terms of the entries of A only when x is not known in advance. Based on the perturbation analysis, we make use of the NQZ algorithm to estimate the spectral radius of a nonnegative tensor in general. On the other hand, we study the backward error matrix ΔA and obtain its smallest error bound for its perturbed largest eigenvalue and associated eigenvector of an irreducible nonnegative tensor. Based on the backward error analysis, we can estimate the stability of computation of the largest eigenvalue of an irreducible nonnegative tensor by the NQZ algorithm. Numerical examples are presented to illustrate the theoretical results of our perturbation analysis.

scholarly journals Finding the Largest Eigenvalue of a Nonnegative Tensor

2010 ◽  
Vol 31 (3) ◽  
pp. 1090-1099 ◽  
Author(s):  
Michael Ng ◽  
Liqun Qi ◽  
Guanglu Zhou
Keyword(s):  
Nonnegative Tensor ◽  
Largest Eigenvalue ◽  
The Largest Eigenvalue

scholarly journals Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian

2021 ◽  
Author(s):  
Jürgen Jost ◽  
Raffaella Mulas ◽  
Florentin Münch
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Spectral Gap ◽  
Complete Bipartite Graph ◽  
Graph Laplacian ◽  
New Method ◽  
Single Edge ◽  
Largest Eigenvalue ◽  
Complement Graph ◽  
The Largest Eigenvalue

AbstractWe offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least $$\frac{n+1}{n-1}$$ n + 1 n - 1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $$\frac{n-1}{2}$$ n - 1 2 . With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $$\frac{n-1}{2}$$ n - 1 2 .

scholarly journals A note on a walk-based inequality for the index of a signed graph

2021 ◽  
Vol 9 (1) ◽  
pp. 19-21
Author(s):  
Zoran Stanić
Keyword(s):  
Adjacency Matrix ◽  
Signed Graph ◽  
Arbitrary Length ◽  
Largest Eigenvalue ◽  
The Largest Eigenvalue

Abstract We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.

scholarly journals The Laplacian Spread of Tricyclic Graphs

10.37236/169 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Yanqing Chen ◽  
Ligong Wang
Keyword(s):  
Laplacian Matrix ◽  
Largest Eigenvalue ◽  
Smallest Eigenvalue ◽  
Fixed Order ◽  
Tricyclic Graphs ◽  
The Difference ◽  
The Largest Eigenvalue

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we investigate Laplacian spread of graphs, and prove that there exist exactly five types of tricyclic graphs with maximum Laplacian spread among all tricyclic graphs of fixed order.

Sign in / Sign up

Export Citation Format

Share Document