An Arnoldi-Inout algorithm for computing PageRank problems

DOI10.1016/j.cam.2016.05.026zbMath1468.65033OpenAlexW2461039811MaRDI QIDQ313604

Wenwen Wang, Chuanqing Gu

Publication date: 12 September 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.05.026

zbMATH Keywords

PageRankinner-outer iterationPIO iterationthick restarted Arnoldi algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (16)

A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ A GMRES-power algorithm for computing PageRank problems ⋮ The modified matrix splitting iteration method for computing PageRank problem ⋮ Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank ⋮ An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank ⋮ Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors ⋮ An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank ⋮ A variant of the Power-Arnoldi algorithm for computing PageRank ⋮ An adaptive Power-GArnoldi algorithm for computing PageRank ⋮ Several relaxed iteration methods for computing PageRank ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ A general multi-splitting iteration method for computing PageRank ⋮ The coupled iteration algorithms for computing PageRank ⋮ A Hessenberg-type algorithm for computing PageRank problems

Uses Software

• eigs
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• A two-step matrix splitting iteration for computing PageRank
• An Inner-Outer Iteration for Computing PageRank
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• A Power–Arnoldi algorithm for computing PageRank
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: An Arnoldi-Inout algorithm for computing PageRank problems