A note on Newton-Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensor
From MaRDI portal
Publication:6066884
DOI10.1016/j.aml.2023.108861MaRDI QIDQ6066884
Publication date: 16 November 2023
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Cites Work
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Tensor Analysis
- Noda iteration for computing generalized tensor eigenpairs
This page was built for publication: A note on Newton-Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensor