A two-step matrix splitting iteration for computing PageRank

DOI10.1016/J.CAM.2014.09.022zbMATH Open1304.65132OpenAlexW2054215488MaRDI QIDQ475634FDOQ475634

Authors: J. Herrera, Sumit K. Garg 

Publication date: 27 November 2014

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.2014.09.022

Recommendations

• On the multi-splitting iteration method for computing PageRank
• A note on the two-step matrix splitting iteration for computing PageRank
• 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
• A preprocessed multi-step splitting iteration for computing PageRank

zbMATH Keywords

convergencenumerical examplesprincipal eigenvectorpower methodPageRank algorithmdamping factortwo-step splitting iteration

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Searching and sorting (68P10) Iterative numerical methods for linear systems (65F10)

Cites Work

• Probability and random processes.
• Title not available (Why is that?)
• Title not available (Why is that?)
• PageRank Computation, with Special Attention to Dangling Nodes
• Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
• Deeper Inside PageRank
• Adaptive methods for the computation of PageRank
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
• Alternating direction methods for three space variables
• Google's PageRank and beyond. The science of search engine rankings
• A Survey on PageRank Computing
• The monotone convergence of the two-stage iterative method for solving large sparse systems of linear equations
• On the convergence of additive and multiplicative splitting iterations for systems of linear equations
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• A class of two-stage iterative methods for systems of weakly nonlinear equations
• On computing PageRank via lumping the Google matrix
• An inner-outer iteration for computing PageRank
• A Power–Arnoldi algorithm for computing PageRank
• Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
• An Arnoldi-type algorithm for computing Page Rank
• An Arnoldi-extrapolation algorithm for computing pagerank
• Title not available (Why is that?)
• Updating Markov Chains with an Eye on Google's PageRank
• A Reordering for the PageRank Problem
• Rational extrapolation for the PageRank vector
• On convergence of the inner-outer iteration method for computing Pagerank
• Ordinal Ranking for Google's PageRank

Cited In (33)

• Two-stage iterations based on composite splittings for rectangular linear systems
• A GMRES-power algorithm for computing PageRank problems
• An iteration method for solving the linear system \(Ax=b\)
• 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
• New explicit iteration algorithms for solving coupled continuous Markovian jump Lyapunov matrix equations
• Off-diagonal low-rank preconditioner for difficult PageRank problems
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• The modified matrix splitting iteration method for computing PageRank problem
• Acceleration of the generalized FOM algorithm for computing PageRank
• The MFPIO iteration and the FPMPE method for multilinear PageRank computations
• A note on the two-step matrix splitting iteration for computing PageRank
• A multi-step Smith-inner-outer iteration algorithm for solving coupled continuous Markovian jump Lyapunov matrix equations
• Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
• Three-step alternating and preconditioned scheme for rectangular matrices
• An Arnoldi-Inout algorithm for computing PageRank problems
• A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
• An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
• The eigenvectors corresponding to the second eigenvalue of the google matrix and their relation to link spamming
• An extrapolation iteration and its lumped type iteration for computing PageRank
• A relaxed two-step splitting iteration method for computing PageRank
• A generalized two-step splitting iterative method modified with the multi-step power method for computing PageRank
• Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
• Three-step alternating iterations for index 1 and non-singular matrices
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• A preprocessed multi-step splitting iteration for computing PageRank
• Additional results on convergence of alternating iterations involving rectangular matrices
• A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations
• 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

This page was built for publication: A two-step matrix splitting iteration for computing PageRank

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