Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
Abstract
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. Moreover, we present a convergent algorithm for calculating the largest eigenvalue for any nonnegative tensors.
Citation
Zhou, Guanglu and Qi, Liqun and Wu, Soon-Yi. 2013. Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor. Frontiers of Mathematics in China. 8 (1): pp. 155-168.
Source Title
Frontiers of Mathematics in China
ISSN
Collection
Related items
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 ...
-
Zhou, Guanglu; Qi, L.; Wu, S. (2013)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 ...
-
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 ...