The coupled iteration algorithms for computing PageRank

DOI10.1007/s11075-021-01166-xzbMath1485.65040OpenAlexW3196932851MaRDI QIDQ2118952

Yinghui Dong, Zhong-Yun Liu, Zhao Lu Tian

Publication date: 23 March 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-021-01166-x

zbMATH Keywords

convergencematrix splittingoptimal parameterPageRank problemcoupled iteration algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accelerated SOR-like method for augmented linear systems
• An Arnoldi-Inout algorithm for computing PageRank problems
• Recent advances in bibliometric indexes and the PaperRank problem
• Towards Google matrix of brain
• A two-step matrix splitting iteration for computing PageRank
• Competitivity groups on social network sites
• A note on the two-step matrix splitting iteration for computing PageRank
• An Arnoldi-type algorithm for computing Page Rank
• On parameterized inexact Uzawa methods for generalized saddle point problems
• Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
• An Arnoldi-extrapolation algorithm for computing pagerank
• On the convergence of the MAOR method
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• Adaptive methods for the computation of PageRank
• Off-diagonal low-rank preconditioner for difficult PageRank problems
• A GMRES-power algorithm for computing PageRank problems
• A relaxed two-step splitting iteration method for computing PageRank
• Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
• The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(A X B = C\)
• An efficient elimination strategy for solving PageRank problems
• The monotonicity of two-stage iterative methods
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• A variant of the Power-Arnoldi algorithm for computing PageRank
• Several relaxed iteration methods for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• A preprocessed multi-step splitting iteration for computing PageRank
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• On the multi-splitting iteration method for computing PageRank
• An Inner-Outer Iteration for Computing PageRank
• A Power–Arnoldi algorithm for computing PageRank
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• Accelerated Overrelaxation Method
• Deeper Inside PageRank
• The modified matrix splitting iteration method for computing PageRank problem
• Coupled iterative algorithms based on optimisation for solving Sylvester matrix equations
• Paradoxical Effects in PageRank Incremental Computations
• A Survey on PageRank Computing

This page was built for publication: The coupled iteration algorithms for computing PageRank