Premium
A fast algorithm for the spectral radii of weakly reducible nonnegative tensors
Author(s) -
Zhou Guanglu,
Wang Gang,
Qi Liqun,
Alqahtani Mohammed
Publication year - 2018
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.2134
Subject(s) - positive definiteness , mathematics , tensor (intrinsic definition) , partition (number theory) , spectral properties , definiteness , spectral radius , partition problem , algorithm , positive definite matrix , combinatorics , pure mathematics , eigenvalues and eigenvectors , physics , quantum mechanics , linguistics , philosophy , astrophysics
Summary 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.