Extrapolated splitting methods for multilinear PageRank computations
From MaRDI portal
Cites work
- \(M\)-tensors and nonsingular \(M\)-tensors
- A new preconditioner of the tensor splitting iterative method for solving multi-linear systems with \(\mathcal{M}\)-tensors
- Comparison results for splitting iterations for solving multi-linear systems
- Efficient implementation of minimal polynomial and reduced rank extrapolation methods
- Eigenvalues of a real supersymmetric tensor
- Essentially positive tensors
- Google's PageRank and beyond. The science of search engine rankings
- scientific article; zbMATH DE number 2113770 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Multilinear PageRank
- On the inverse of a tensor
- On the limiting probability distribution of a transition probability tensor
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- PageRank Computation, with Special Attention to Dangling Nodes
- Preconditioned tensor splitting AOR iterative methods for \(\mathcal{H}\)-tensor equations.
- Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Tensor analysis. Spectral theory and special tensors
- Tensor Decompositions and Applications
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
- The tensor splitting with application to solve multi-linear systems
- Vector extrapolation methods with applications
- Vector extrapolation methods. Applications and numerical comparison
This page was built for publication: Extrapolated splitting methods for multilinear PageRank computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031625)
