摘要
本文研究复杂网络中计算Katz指标的迭代法,基于网络拓扑结构,在快速Katz指标算法的基础上,运用二级分裂迭代思想,提出了具有两个参数的二级分裂迭代法,并研究了该方法的收敛性.基于该方法的收缩因子的计算公式,讨论了迭代参数可能的选择,通过参数的选择能有效提高二级迭代法的收敛效率.最后通过数值实例验证了此方法的有效性.
In this paper, we study the iterative method to approximate the katz status score in the complex networks. Based on the network topology structure and faster katz status score algorithm, we present a two-stage iterative method with two parameters which cover faster katz status score method. Under some suitable conditions, the convergence results are given. Based on the formula of the contraction factor of the method, we discuss possible choices of the iteration parameters, which could be practically useful for accelerating the convergence rate of the two-stage iterative method. Also numerical results shows that the new method is effective.
出处
《计算数学》
CSCD
北大核心
2015年第4期390-400,共11页
Mathematica Numerica Sinica
基金
浙江省教育厅科研项目资助(Y201432547)
全国教育信息技术研究课题(126240641)
浙江省社会科学界联合会研究课题成果(2013B157)
