The modified matrix splitting iteration method for computing PageRank problem
From MaRDI portal
Publication:5080683
DOI10.2298/FIL1903725TzbMATH Open1499.65130OpenAlexW2995973311MaRDI QIDQ5080683FDOQ5080683
Authors: Yudong Wang, Zhao Lu Tian, Xiaoyan Liu, P. H. Wen 
Publication date: 31 May 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1903725t
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adaptive methods for the computation of PageRank
- Title not available (Why is that?)
- Title not available (Why is that?)
- Google's PageRank and beyond. The science of search engine rankings
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- An inner-outer iteration for computing PageRank
- An Arnoldi-Inout algorithm for computing PageRank problems
- A Power–Arnoldi algorithm for computing PageRank
- A two-step matrix splitting iteration for computing PageRank
- An Arnoldi-type algorithm for computing Page Rank
- An Arnoldi-extrapolation algorithm for computing pagerank
- Accelerated Overrelaxation Method
- A new extrapolation method for PageRank computations
- Paradoxical Effects in PageRank Incremental Computations
- On convergence of the inner-outer iteration method for computing Pagerank
- A note on the two-step matrix splitting iteration for computing PageRank
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- On the multi-splitting iteration method for computing PageRank
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
Cited In (8)
- The coupled iteration algorithms for computing PageRank
- Several relaxed iteration methods for computing PageRank
- The MFPIO iteration and the FPMPE method for multilinear PageRank computations
- A note on the two-step matrix splitting iteration for computing PageRank
- An extrapolation iteration and its lumped type iteration for computing PageRank
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
- Title not available (Why is that?)
This page was built for publication: The modified matrix splitting iteration method for computing PageRank problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080683)
