A numerical algorithm is proposed for computing interval vectors containing Perron vectors of weakly irreducible nonnegative (WIN) tensors. This algorithm is applicable to all the WIN tensors, whereas algorithms previously developed by the author are applicable only to a subclass of the WIN tensors. Numerical results show the efficiency of the algorithm.
Topics
Numerical algorithms
REFERENCES
1.
L.
Qi
and Z.
Luo
, Tensor Analysis: Spectral Theory and Special Tensors
(SIAM Publications
, Philadelphia
, 2017
).2.
K.-C.
Chang
, K. J.
Pearson
, and T.
Zhang
, “Primitivity, the convergence of the NQZ method, and the largest eigenvalue for nonnegative tensors
”, SIAM J. Matrix Anal. Appl.
32
, 806
–819
(2011
).3.
C.-S.
Liu
, “Exact and inexact iterative methods for finding the largest eigenpair of a weakly irreducible nonnegative tensor
”, J. Sci. Comput.
91
, 78
(2022
).4.
Y.
Liu
, G.
Zhou
, and N. F.
Ibrahim
, “An always convergent algorithm for the largest eigenvalue of an irre-ducible nonnegative tensor
”, J. Comput. Appl. Math.
235
, 286
–292
(2010
).5.
S.
Miyajima
, “Fast verified computation for positive solutions to-tensor multi-linear systems and Perron vectors of a kind of weakly irreducible nonnegative tensors
”, J. Comput. Appl. Math.
406
, 113930
(2022
).
This content is only available via PDF.
© 2024 Author(s). Published under an exclusive license by AIP Publishing.
2024
Author(s)
You do not currently have access to this content.
