Perron-based algorithms for the multilinear PageRank
From MaRDI portal
Recommendations
Cited in
(16)- An SDP relaxation method for Perron pairs of a nonnegative tensor
- Convergence of the fixed‐point iteration for multilinear PageRank
- Ergodicity Coefficients for Higher-Order Stochastic Processes
- Computing tensor Z-eigenvectors with dynamical systems
- A residual-based error bound for the multilinear PageRank vector
- Extrapolation methods for fixed‐point multilinear PageRank computations
- Higher Order Extended Dynamic Mode Decomposition Based on the Structured Total Least Squares
- Multi-linear pseudo-PageRank for hypergraph partitioning
- Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
- Improved uniqueness conditions of solution for multilinear pagerank and its application
- Perron-based algorithms for the multilinear pagerank
- The MFPIO iteration and the FPMPE method for multilinear PageRank computations
- Extrapolation methods for multilinear PageRank
- Spliting iteration method for solving multilinear PageRank problem
- Preconditioned iterative methods with Anderson acceleration for solving multilinear PageRank and applications
- On certain classes of nonlinear matrix equations: theory, applications, and numerical solution
This page was built for publication: Perron-based algorithms for the multilinear PageRank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120345)