On adaptively accelerated Arnoldi method for computing PageRank
From MaRDI portal
Publication:4909729
DOI10.1002/nla.789zbMath1274.65109OpenAlexW2119299188MaRDI QIDQ4909729
Jun-Feng Yin, Guojian Yin, Michael Kwok-Po Ng
Publication date: 21 March 2013
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.789
convergencenumerical resultseigenvalue problempower methodArnoldi processweighted least squares problemPageRank
Computational methods for sparse matrices (65F50) Searching and sorting (68P10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items
Acceleration of the generalized FOM algorithm for computing PageRank ⋮ Acceleration of an adaptive generalized Arnoldi method for computing PageRank ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ A relaxed two-step splitting iteration method for computing PageRank ⋮ Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors ⋮ Recent advances in bibliometric indexes and the PaperRank problem ⋮ An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank ⋮ FOM accelerated by an extrapolation method for solving PageRank problems ⋮ A variant of the Power-Arnoldi algorithm for computing PageRank ⋮ Unnamed Item ⋮ An adaptive Power-GArnoldi algorithm for computing PageRank ⋮ Numerical stability of orthogonalization methods with a non-standard inner product ⋮ On the multi-splitting iteration method for computing PageRank ⋮ A Hessenberg-type algorithm for computing PageRank problems
Cites Work
- An Arnoldi-type algorithm for computing Page Rank
- Weighted FOM and GMRES for solving nonsymmetric linear systems
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Adaptive methods for the computation of PageRank
- Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- Numerical Methods for Large Eigenvalue Problems
- Square and stretch multigrid for stochastic matrix eigenproblems
- Recursively Accelerated Multilevel Aggregation for Markov Chains
- A Power–Arnoldi algorithm for computing PageRank
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Numerical Methods in Markov Chain Modeling
- Deeper Inside PageRank
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A Reordering for the PageRank Problem
- A Survey on PageRank Computing
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
