Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
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...
Main Authors: | Zhou, Guanglu, Qi, Liqun, Wu, Soon-Yi |
---|---|
Format: | Journal Article |
Published: |
Springer
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/20.500.11937/38761 |
Similar Items
-
On the largest eigenvalue of a symmetric nonnegative tensor
by: Zhou, Guanglu, et al.
Published: (2013) -
Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor
by: Zhou, Guanglu, et al.
Published: (2013) -
A new Z-eigenvalue localization set for tensors
by: Jianxing Zhao
Published: (2017-04-01) -
Two S-type Z-eigenvalue inclusion sets for tensors
by: Yanan Wang, et al.
Published: (2017-06-01) -
New bounds for the minimum eigenvalue of 𝓜-tensors
by: Zhao Jianxing, et al.
Published: (2017-03-01)