A fast algorithm for the spectral radii of weakly reducible nonnegative tensors
Abstract
Copyright © 2017 John Wiley & Sons, Ltd. In this paper, we propose a fast algorithm for computing the spectral radii of symmetric nonnegative tensors. In particular, by this proposed algorithm, we are able to obtain the spectral radii of weakly reducible symmetric nonnegative tensors without requiring the partition of the tensors. As we know, it is very costly to determine the partition for large-sized weakly reducible tensors. Numerical results are reported to show that the proposed algorithm is efficient and also able to compute the spectral radii of large-sized tensors. As an application, we present an algorithm for testing the positive definiteness of Z-tensors. By this algorithm, it is guaranteed to determine the positive definiteness for any Z-tensor.
Citation
Source Title
DOI
ISSN
School
Collection
Related items
Showing items related by title, author, creator and subject.
-
Alqahtani, Mohammed Aeyed M (2019)In this thesis, we study tensor eigenvalue problems and polynomial optimization problems. In particular, we present a fast algorithm for computing the spectral radii of symmetric nonnegative tensors without requiring the ...
-
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 ...