求解PageRank的修正多步幂-多分裂内外迭代法  

A MODIFIED MULTIPLE POWER ITERATION AND MULTIPLE INTERNAL AND EXTERNAL ITERATION METHOD FOR SOLVING PAGERANK

作　　者：罗慧 马昌凤[1] LUO Hui;MA Chang-feng(School of Mathematics and Statistics,Fujian Normal University,Fuzhou,Fujian 350007,China)

机构地区：[1]福建师范大学数学与统计学院,福建福州350117

出　　处：《井冈山大学学报（自然科学版）》2022年第5期1-7,共7页Journal of Jinggangshan University (Natural Science)

基　　金：国家自然科学基金项目(11901098);福建省自然科学基金项目(2020J05034)。

摘　　要：在一种基于多步幂法和多步分裂的IO迭代的变体(用MPMIO来表示)的基础上,提出了一种IO(PIO)迭代的变式,将多步幂法和多步分裂的IO迭代的结合扩展到更为一般的情形,讨论了该算法的全局收敛性,并通过数值算例说明了该方法的有效性。Based on a variant of IO iteration(expressed by MPMIO)based on multi-step power method and multi-step splitting introduced by Pu et al,a variant of IO(PIO)iteration was proposed,which extended the combination of multi-step power method and multi-step split IO iteration to more general cases.Its convergence is proved theoretically and a numerical examples were carried out to explain the effectiveness of the method.

关 键 词：PageTank 幂法 两步分裂迭代 

分 类 号：O224.2[理学—运筹学与控制论]