Preconditioned iterative methods with Anderson acceleration for solving multilinear PageRank and applications
From MaRDI portal
Cites work
- A modified Newton method for multilinear PageRank
- A new preconditioned AOR-type method for \(\mathcal{M}\)-tensor equation
- A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
- Anderson accelerated fixed‐point iteration for multilinear PageRank
- Anderson acceleration for fixed-point iterations
- Comparison results for splitting iterations for solving multi-linear systems
- Eigenvalues of a real supersymmetric tensor
- Ergodicity coefficients defined by vector norms
- Ergodicity Coefficients for Higher-Order Stochastic Processes
- Improved uniqueness conditions of solution for multilinear pagerank and its application
- Improvements of two preconditioned AOR iterative methods for \(Z\)-matrices
- Multilinear PageRank
- Multilinear PageRank: uniqueness, error bound and perturbation analysis
- On the limiting probability distribution of a transition probability tensor
- Perron-based algorithms for the multilinear PageRank
- Preconditioned iterative methods for multi-linear systems based on the majorization matrix
- Preconditioned tensor splitting iterations method for solving multi-linear systems
- Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains
- Splitting methods for tensor equations
- Tensor analysis. Spectral theory and special tensors
- Tensor Decompositions and Applications
- The tensor splitting with application to solve multi-linear systems
- The uniqueness of multilinear PageRank vectors.
- The University of Florida sparse matrix collection
- Vector Aitken extrapolation method for multilinear PageRank computations
Cited in
(1)
This page was built for publication: Preconditioned iterative methods with Anderson acceleration for solving multilinear PageRank and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007052)
