A Power–Arnoldi algorithm for computing PageRank
From MaRDI portal
Publication:3392852
DOI10.1002/nla.531zbMath1199.65125MaRDI QIDQ3392852
Publication date: 17 August 2009
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.531
numerical tests; largest eigenvalue; Krylov subspace method; PageRank algorithm; Google matrix; thick restarted Arnoldi method; Power-Arnoldi method; principle eigenvector; search engine technology
68P10: Searching and sorting
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
On adaptively accelerated Arnoldi method for computing PageRank, The modified matrix splitting iteration method for computing PageRank problem, A parallel pagerank algorithm for undirected graph, Deflated and restarted Krylov subspace methods for Sylvester tensor equations, An Arnoldi-Inout algorithm for computing PageRank problems, A new extrapolation method for PageRank computations, An adaptive reordered method for computing PageRank, Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem, Practical acceleration for computing the HITS expertrank vectors, A two-step matrix splitting iteration for computing PageRank, A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems, A note on the two-step matrix splitting iteration for computing PageRank, FOM accelerated by an extrapolation method for solving PageRank problems, On the eigenvalues of a specially updated complex matrix, An Arnoldi-extrapolation algorithm for computing pagerank, On computing PageRank via lumping the Google matrix, A GMRES-power algorithm for computing PageRank problems, A relaxed two-step splitting iteration method for computing PageRank, An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank, Inexact and incremental bilinear Lanczos components algorithms for high dimensionality reduction and image reconstruction, The general inner-outer iteration method based on regular splittings for the PageRank problem, The coupled iteration algorithms for computing PageRank, A Hessenberg-type algorithm for computing PageRank problems, 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, Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank, A variant of the Power-Arnoldi algorithm for computing PageRank, An adaptive Power-GArnoldi algorithm for computing PageRank, A general multi-splitting iteration method for computing PageRank, Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations, A preprocessed multi-step splitting iteration for computing PageRank, On the multi-splitting iteration method 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, Unnamed Item, Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
Uses Software
Cites Work
