A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor

DOI10.1137/15M1040128zbMath1342.65114MaRDI QIDQ3185673

Wen-Wei Lin, Chun-Hua Guo, Ching-Sung Liu

Publication date: 4 August 2016

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

\(M\)-matrixnonnegative matrixquadratic convergenceinverse iterationPerron rootnonnegative tensorPerron vectorpositivity preserving

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (16)

Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors ⋮ Exact and inexact iterative methods for finding the largest eigenpair of a weakly irreducible nonnegative tensor ⋮ Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor ⋮ Newton--Noda Iteration for Computing the Ground States of Nonlinear Schrödinger Equations ⋮ Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method ⋮ A note on Newton-Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensor ⋮ A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor ⋮ Some properties concerning Perron vectors of weakly irreducible nonnegative tensors, and their application to rigorous enclosure ⋮ Local convergence analysis of inverse iteration algorithm for computing the H-spectral radius of a nonnegative weakly irreducible tensor ⋮ Noda iteration for computing generalized tensor eigenpairs ⋮ A positivity preserving iterative method for finding the ground states of saturable nonlinear Schrödinger equations ⋮ Two-step Noda iteration for irreducible nonnegative matrices ⋮ A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor ⋮ Noda iterations for generalized eigenproblems following Perron-Frobenius theory ⋮ Inexact generalized Noda iterations for generalized eigenproblems ⋮ An SDP relaxation method for Perron pairs of a nonnegative tensor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Spectra of uniform hypergraphs
• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• Factorization strategies for third-order tensors
• An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
• Perron-Frobenius theorem for nonnegative tensors
• Z-eigenvalue methods for a global polynomial optimization problem
• Inverse iteration for calculating the spectral radius of a non-negative irreducible matrix
• The Laplacian of a uniform hypergraph
• A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
• A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
• Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix
• $M$-Tensors and Some Applications
• Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
• Finding the Largest Eigenvalue of a Nonnegative Tensor
• Regenerative Analysis and Steady State Distributions for Markov Chains
• Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
• Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging

This page was built for publication: A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor