Show simple item record

dc.contributor.authorZhou, Guanglu
dc.contributor.authorWang, G.
dc.contributor.authorQi, L.
dc.contributor.authorAlqahtani, M.
dc.identifier.citationZhou, G. and Wang, G. and Qi, L. and Alqahtani, M. 2018. A fast algorithm for the spectral radii of weakly reducible nonnegative tensors. Numerical Linear Algebra with Applications. 25 (2).

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.

dc.publisherJohn Wiley & Sons
dc.titleA fast algorithm for the spectral radii of weakly reducible nonnegative tensors
dc.typeJournal Article
dcterms.source.titleNumerical Linear Algebra with Applications
curtin.departmentSchool of Electrical Engineering, Computing and Mathematical Science (EECMS)
curtin.accessStatusFulltext not available

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record