On the largest eigenvalue of a symmetric nonnegative tensor
MetadataShow full item record
In this paper, some important spectral characterizations of symmetric nonnegative tensors are analyzed. In particular, it is shown that a symmetric nonnegative tensor has the following properties: (i) its spectral radius is zero if and only if it is a zero tensor; (ii) it is weakly irreducible (respectively, irreducible) if and only if it has a unique positive (respectively, nonnegative) eigenvalue–eigenvector; (iii) the minimax theorem is satisfied without requiring the weak irreducibility condition; and (iv) if it is weakly reducible, then it can be decomposed into some weakly irreducible tensors. In addition, the problem of finding the largest eigenvalue of a symmetric nonnegative tensor is shown to be equivalent to finding the global solution of a convex optimization problem. Subsequently, algorithmic aspects for computing the largest eigenvalue of symmetric nonnegative tensors are discussed.
Showing items related by title, author, creator and subject.
Zhang, L.; Qi, L.; Zhou, Guanglu (2014)We introduce M-tensors. This concept extends the concept of M-matrices. We denote Z-tensors as the tensors with nonpositive off-diagonal entries. We show that M-tensors must be Z-tensors and the maximal diagonal entry ...
Ibrahim, Nur Fadhilah (2013)In this thesis we study the methods for finding the largest eigenvalue of tensors. In particular, we study the convergence of the methods and show that the method for rectangular tensors is Q-linear convergence under weak ...
Zhou, Guanglu; Qi, Liqun; Wu, Soon-Yi (2013)Consider the problem of computing the largest eigenvalue for nonnegative tensors. In this paper, we establish the Q-linear convergence of a power type algorithm for this problem under a weak irreducibility condition. ...