An Arnoldi-Inout algorithm for computing PageRank problems

DOI10.1016/J.CAM.2016.05.026zbMATH Open1468.65033OpenAlexW2461039811MaRDI QIDQ313604FDOQ313604

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)

Cites Work

• Title not available (Why is that?)
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Numerical methods for large eigenvalue problems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• An Inner-Outer Iteration for Computing PageRank
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• A Power–Arnoldi algorithm for computing PageRank
• A two-step matrix splitting iteration for computing PageRank
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems

Cited In (22)

• A GMRES-power algorithm for computing PageRank problems
• A Hessenberg-type algorithm for computing PageRank problems
• The coupled iteration algorithms for computing PageRank
• An adaptive Power-GArnoldi algorithm for computing PageRank
• Several relaxed iteration methods for computing PageRank
• A multi-power and multi-splitting inner-outer iteration for PageRank computation
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• The modified matrix splitting iteration method for computing PageRank problem
• On the spectrum of two-layer approach and multiplex PageRank
• Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
• A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
• Effective Computation of a Feedback Arc Set Using PageRank
• An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
• Saddle point mirror descent algorithm for the robust PageRank problem
• An Arnoldi-type algorithm for computing Page Rank
• A weighted block Arnoldi method for solving PageRank problem with high damping factors
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• Title not available (Why is that?)
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
• A variant of the Power-Arnoldi algorithm for computing PageRank
• Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank

Uses Software

• eigs
• IRAM

   Recommendations

• Title not available (Why is that?) 👍 👎
• An Arnoldi-type algorithm for computing Page Rank 👍 👎
• Title not available (Why is that?) 👍 👎
• An Arnoldi-extrapolation algorithm for computing pagerank 👍 👎
• A Power–Arnoldi algorithm for computing PageRank 👍 👎
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank 👍 👎
• 求解PageRank 问题的Arnoldi-PIO 算法 👍 👎
• Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem 👍 👎
• A variant of the Power-Arnoldi algorithm for computing PageRank 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313604)