基于分裂迭代算法求解多重线性PageRank问题

SPLITING ITERATION METHOD FOR SOLVING MULTILINEAR PAGERANK PROBLEM

本文针对多重线性PageRank问题,结合松弛技术,提出了新的张量分裂算法,并给出了相应的收敛性分析.数值实验表明,在适当选择松弛参数的情况下,新算法具有较好的数值效果.

In this paper,combined with the relaxation algorithm,we present new tensor splitting methods for solving multilinear PageRank problem.The convergence analysis of the proposed algorithms is also shown.It is shown that the proposed algorithms perform well from some numerical experiments when relaxation parameters are properly selected.