Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    A fast algorithm for the spectral radii of weakly reducible nonnegative tensors

    Access Status
    Fulltext not available
    Authors
    Zhou, Guanglu
    Wang, G.
    Qi, L.
    Alqahtani, M.
    Date
    2018
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Zhou, 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).
    Source Title
    Numerical Linear Algebra with Applications
    DOI
    10.1002/nla.2134
    ISSN
    1070-5325
    School
    School of Electrical Engineering, Computing and Mathematical Science (EECMS)
    URI
    http://hdl.handle.net/20.500.11937/66329
    Collection
    • Curtin Research Publications
    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.

    Related items

    Showing items related by title, author, creator and subject.

    • Numerical Algorithms for Polynomial Optimisation Problems with Applications
      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 ...
    • M-Tensors and Some Applications
      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 ...
    • On the largest eigenvalue of a symmetric nonnegative tensor
      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 ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.