Primitive tensors and convergence of an iterative process for the eigenvalues of a primitive tensor

2010/04/14 by K. PEARSON, Pearson, K. J. · 1 citation
Mathematics · Computer Science · #Tensor decomposition and applications #Matrix Theory and Algorithms

paper · pdf · doi:10.48550/arxiv.1004.2423

Abstract

An algorithm for finding the eigenvalue of a nonnegative irreducible tensor was recently proposed by Michael Ng, Liqun Qi, and Guanglu Zhou in \it Finding the largest eigenvalue of a nonnegative tensor. However, the authors did not prove the proposed algorithm converges. In this paper, primitive tensors are defined and the algorithm is shown to converge for primitive tensors.

Cited by

• On some properties of nonnegative weakly irreducible tensors

Related

• A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
• An algorithm to find the spectral radius of nonnegative tensors and its convergence analysis
• Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
• Real Eigenvalues of nonsymmetric tensors
• A modified Newton iteration for finding nonnegative Z-eigenpairs of a nonnegative tensor