Exact and inexact iterative methods for finding the largest eigenpair of a weakly irreducible nonnegative tensor
DOI10.1007/S10915-022-01852-5zbMATH Open1492.65088OpenAlexW4280635783WikidataQ114225566 ScholiaQ114225566MaRDI QIDQ2149016FDOQ2149016
Publication date: 24 June 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-022-01852-5
Recommendations
- Noda iteration for computing generalized tensor eigenpairs
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
- Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
- scientific article; zbMATH DE number 7379563
\(M\)-matrixnonnegative tensorPerron vectorpositivity preservingquadratic convergenceinner-outer iterationhigher-order Noda iteration
Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical linear algebra (65F99)
Cites Work
- Tensor Decompositions and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- \(M\)-tensors and some applications
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- Spectra of uniform hypergraphs
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
- Perron-Frobenius theorem for nonnegative tensors
- Markov chains: models, algorithms and applications
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- The Laplacian of a uniform hypergraph
- Title not available (Why is that?)
- A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
- Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- A homotopy method for solving multilinear systems with M-tensors
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- Splitting methods for tensor equations
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
Cited In (8)
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Title not available (Why is that?)
- Aitken extrapolation method for computing the largest eigenvalue of nonnegative tensors
- Noda iteration for computing generalized tensor eigenpairs
- A power-like method for finding the spectral radius of a weakly irreducible nonnegative symmetric tensor
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- The solution methods for the largest eigenvalue (singular value) of nonnegative tensors and convergence analysis
- Some properties concerning Perron vectors of weakly irreducible nonnegative tensors, and their application to rigorous enclosure
This page was built for publication: Exact and inexact iterative methods for finding the largest eigenpair of a weakly irreducible nonnegative tensor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149016)