Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A Parameterized Multisplitting Iterative Method for Solving the PageRank Problem

Version 1 : Received: 27 June 2023 / Approved: 27 June 2023 / Online: 27 June 2023 (13:35:48 CEST)

A peer-reviewed article of this Preprint also exists.

Xie, Y.; Hu, L.; Ma, C. A Parameterized Multi-Splitting Iterative Method for Solving the PageRank Problem. Mathematics 2023, 11, 3320. Xie, Y.; Hu, L.; Ma, C. A Parameterized Multi-Splitting Iterative Method for Solving the PageRank Problem. Mathematics 2023, 11, 3320.

Abstract

In this paper, a new multi parameter iterative algorithm is proposed to address the PageRank problem based on the multi-splitting iteration method described by Gu et al . The proposed method in each iteration needs to solve two linear subsystems by splitting the coefficient matrix, therefore, we consider inner and outer iteration to find the approximate solutions of these linear subsystems. It can be shown that the iterative sequence generated by the multi parameter iterative algorithm finally converges to the PageRank vector when the parameters satisfy the certain conditions. Numerical experiments show that the proposed algorithm has better convergence and numerical stability than the existing algorithms.

Keywords

PageRank; inner-outer iterations; multi-parameter iteration; inner sub-systems

Subject

Computer Science and Mathematics, Computational Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.