The modified matrix splitting iteration method for computing PageRank problem

DOI10.2298/FIL1903725TMaRDI QIDQ5080683zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

convergenceinner-outer iterationmatrix splittingPageRankpower method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites work

• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• A new extrapolation method for PageRank computations
• A note on the two-step matrix splitting iteration for computing PageRank
• A Power–Arnoldi algorithm for computing PageRank
• A preconditioned and extrapolation-accelerated GMRES method for pagerank
• A two-step matrix splitting iteration for computing PageRank
• A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• Accelerated Overrelaxation Method
• Adaptive methods for the computation of PageRank
• An Arnoldi-extrapolation algorithm for computing pagerank
• An Arnoldi-Inout algorithm for computing PageRank problems
• An Arnoldi-type algorithm for computing Page Rank
• An inner-outer iteration for computing PageRank
• Google's PageRank and beyond. The science of search engine rankings
• scientific article; zbMATH DE number 3760340 (Why is no real title available?)
• scientific article; zbMATH DE number 1049347 (Why is no real title available?)
• scientific article; zbMATH DE number 1433445 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• On convergence of the inner-outer iteration method for computing Pagerank
• On the multi-splitting iteration method for computing PageRank
• Paradoxical Effects in PageRank Incremental Computations
• Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems

Cited in

(8)

• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
• Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
• An extrapolation iteration and its lumped type iteration for computing PageRank
• The coupled iteration algorithms for computing PageRank
• Several relaxed iteration methods for computing PageRank
• scientific article; zbMATH DE number 7109343 (Why is no real title available?)
• The MFPIO iteration and the FPMPE method for multilinear PageRank computations
• A note on the two-step matrix splitting iteration for computing PageRank

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)