.png){kind=icon}
返回
Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2015.09.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A class of iterative schemes based on the regular splitting is proposed for PageRank computation. By some specific splitting, these methods will reduce to some well-known iterative schemes, like Jacobi method and successive overrelaxation method. To suit computational requirements of the modern high-speed multiprocessor environments, we further study synchronous parallel counterparts for the new splitting iteration methods. By using the Msplitting of the coefficient matrix, we establish the convergence theory of these synchronous multisplitting iteration methods. Finally, some numerical experiments are presented to illustrate the feasibility, stability and effectiveness of the proposed algorithms. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
PageRank
Linear systems
Regular splitting
M-splitting
Iteration method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏Minimum area thresholds for rattlesnakes and colubrid snakes on islands in the Gulf of California, Mexico墨西哥加利福尼亚湾岛屿上响尾蛇和游蛇的最小面积阈值
OAAI
OAAI分享收藏A Unified Jacobian-Torsor Model for Analysis in Computer Aided Tolerancing一种统一的雅可比-扭量模型用于计算机辅助公差分析
PREAI
分享收藏
查看更多内容