Abstract
The PageRank algorithm has become the core technology for web search engines. For the linear equations derived from the PageRank problem, firstly, the restarted GMRES (generalized minimal residual) method of the Krylov subspace methods was combined with the multi-splitting iterative method, and a modified multi-splitting iterative method with the restarted GMRES was proposed. Then, the detailed calculating process and the convergence analysis of this new algorithm were given. Finally, the effectiveness of the algorithm was demonstrated through some numerical experiments.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
