%0 Journal Article
%T 基于Anderson加速分裂迭代算法求解多重线性PageRank问题<br>Solving Multilinear PageRank Problem Based on Anderson Accelerated Splitting Iteration Algorithm
%A 陆思雅
%J Pure Mathematics
%P 229-236
%@ 2160-7605
%D 2025
%I Hans Publishing
%R 10.12677/pm.2025.151026
%X 本文针对多重线性PageRank问题&#65292;结合松弛技术&#65292;提出了一般形式的张量分裂迭代算法&#65292;并给出了相应的收敛性分析。进一步&#65292;结合Anderson加速技术&#65292;提出了新的张量分裂算法。<br>In this paper, combining relaxation techniques, a general form of tensor splitting iterative algorithm is proposed for the multilinear PageRank problem, and the corresponding convergence analysis is given. Furthermore, a new tensor splitting algorithm is proposed by incorporating Anderson acceleration techniques.
%K 多重线性PageRank问题&#65292
%K 张量分裂&#65292
%K Anderson加速<br>Multilinear PageRank Problem
%K Tensor Splitting
%K Anderson Acceleration
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=106263