Two Stage Chebyshev Semi-Iterative Method for PageRank Problem

2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)(2022)

引用 0|浏览0
暂无评分
摘要
In this article, we have experimented with the Chebyshev semi-iterative (CSI) method for PageRank computation. The CSI method is slow, and for a few PageRank matrices, the method diverges. To overcome such difficulties, we have introduced a two stage Chebyshev semi-iterative (TSCI) method. TSCI method is convergent for all PageRank matrices and comparatively faster than some of the recently developed iterative methods. The numerical experiment has been performed for Multiple PageRank matrices. The computational results show how the TSCI algorithm is efficient.
更多
查看译文
关键词
PageRank Problem,Chebyshev semi-iterative method,two stage iteration
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要