Noda iteration for computing generalized tensor eigenpairs

From MaRDI portal



Abstract: In this paper, we propose the tensor Noda iteration (NI) and its inexact version for solving the eigenvalue problem of a particular class of tensor pairs called generalized mathcalM-tensor pairs. A generalized mathcalM-tensor pair consists of a weakly irreducible nonnegative tensor and a nonsingular mathcalM-tensor within a linear combination. It is shown that any generalized mathcalM-tensor pair admits a unique positive generalized eigenvalue with a positive eigenvector. A modified tensor Noda iteration(MTNI) is developed for extending the Noda iteration for nonnegative matrix eigenproblems. In addition, the inexact generalized tensor Noda iteration method (IGTNI) and the generalized Newton-Noda iteration method (GNNI) are also introduced for more efficient implementations and faster convergence. Under a mild assumption on the initial values, the convergence of these algorithms is guaranteed. The efficiency of these algorithms is illustrated by numerical experiments.



Cites work









This page was built for publication: Noda iteration for computing generalized tensor eigenpairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175192)