To address the computational bottlenecks of PageRank problems in large-scale sparse network analysis, particularly under high damping factors, this paper proposes a hybrid solution strategy integrating the thick restarted Arnoldi algorithm with the Power-Minus-Splitting Iteration (PMSI) technique, termed the Arnoldi-PMSI iteration method. To overcome the significant convergence slowdown of the traditional power method as the damping factor approaches 1, an alternating iteration framework based on parameter control is designed. In terms of implementation, the algorithm first utilizes the thick restarted Arnoldi process to rapidly generate high-quality approximate solutions within the Krylov subspace. When the residual precision fails to meet the target, the method automatically switches to the PMSI iteration stage to further reduce the error, feeding the resulting vector back into the Arnoldi process as a new initial vector, thereby achieving a complementary advantage of both acceleration mechanisms. The convergence of this hybrid algorithm is rigorously proved under reasonable mathematical assumptions. Numerical experiments conducted on multiple real-world web link matrices demonstrate that, compared with the classical power method, the thick restarted Arnoldi-power method, and the thick restarted Arnoldi-MSI method, the Arnoldi-PMSI method exhibits significant advantages in key metrics, including the number of iteration steps, matrix-vector multiplications, and CPU time. This study not only effectively improves the computational efficiency of solving large-scale PageRank problems but also provides a robust numerical tool for complex network analysis.