The MFPIO iteration and the FPMPE method for multilinear PageRank computations
From MaRDI portal
Recommendations
Cites work
- A continuation method for computing the multilinear PageRank
- A general multi-splitting iteration method for computing PageRank
- A GMRES-power algorithm for computing PageRank problems
- A note on the two-step matrix splitting iteration for computing PageRank
- A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors
- A relaxed two-step splitting iteration method for computing PageRank
- A two-step matrix splitting iteration for computing PageRank
- Acceleration of Convergence of Vector Sequences
- Algorithm 862
- An Arnoldi-extrapolation algorithm for computing pagerank
- An inner-outer iteration for computing PageRank
- Anderson accelerated fixed‐point iteration for multilinear PageRank
- Convergence of the fixed‐point iteration for multilinear PageRank
- Extrapolation methods for fixed‐point multilinear PageRank computations
- Extrapolation Methods for Vector Sequences
- Higher-order multivariate Markov chains and their applications
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Inner and Outer Iterations for the Chebyshev Algorithm
- Iterative solution of large sparse systems of equations. Transl. from the German
- Markov chains: models, algorithms and applications
- Minimal polynomial and reduced rank extrapolation methods are related
- Multilinear PageRank
- Multilinear PageRank: uniqueness, error bound and perturbation analysis
- On a multivariate Markov chain model for credit risk measurement
- On the limiting probability distribution of a transition probability tensor
- Perron-based algorithms for the multilinear PageRank
- Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains
- SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
- Shanks sequence transformations and Anderson acceleration
- The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems
- The modified matrix splitting iteration method for computing PageRank problem
- The uniqueness of multilinear PageRank vectors.
- The University of Florida sparse matrix collection
- Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
- Vector Aitken extrapolation method for multilinear PageRank computations
Cited in
(2)
This page was built for publication: The MFPIO iteration and the FPMPE method for multilinear PageRank computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593345)