A two-step matrix splitting iteration for computing PageRank
From MaRDI portal
Publication:475634
DOI10.1016/j.cam.2014.09.022zbMath1304.65132OpenAlexW2054215488MaRDI QIDQ475634
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
convergencenumerical examplespower methodprincipal eigenvectorPageRank algorithmdamping factortwo-step splitting iteration
Searching and sorting (68P10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items
Acceleration of the generalized FOM algorithm for computing PageRank ⋮ New explicit iteration algorithms for solving coupled continuous Markovian jump Lyapunov matrix equations ⋮ Off-diagonal low-rank preconditioner for difficult PageRank problems ⋮ An Arnoldi-Inout algorithm for computing PageRank problems ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ A GMRES-power algorithm for computing PageRank problems ⋮ A relaxed two-step splitting iteration method for computing PageRank ⋮ The modified matrix splitting iteration method for computing PageRank problem ⋮ 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 ⋮ A multi-step Smith-inner-outer iteration algorithm for solving coupled continuous Markovian jump Lyapunov matrix equations ⋮ Three-step alternating iterations for index 1 and non-singular matrices ⋮ An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank ⋮ A variant of the Power-Arnoldi algorithm for computing PageRank ⋮ Additional Results on Convergence of Alternating Iterations Involving Rectangular Matrices ⋮ An adaptive Power-GArnoldi algorithm for computing PageRank ⋮ Several relaxed iteration methods for computing PageRank ⋮ Parallel multisplitting iteration methods based on M-splitting for the PageRank problem ⋮ An iteration method for solving the linear system \(Ax=b\) ⋮ Two-stage iterations based on composite splittings for rectangular linear systems ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ A note on the two-step matrix splitting iteration for computing PageRank ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ Three-step alternating and preconditioned scheme for rectangular matrices ⋮ A general multi-splitting iteration method for computing PageRank ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ A preprocessed multi-step splitting iteration for computing PageRank ⋮ The coupled iteration algorithms for computing PageRank
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- Alternating direction methods for three space variables
- An Arnoldi-type algorithm for computing Page Rank
- An Arnoldi-extrapolation algorithm for computing pagerank
- On computing PageRank via lumping the Google matrix
- 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
- The monotone convergence of the two-stage iterative method for solving large sparse systems of linear equations
- Adaptive methods for the computation of PageRank
- On the convergence of additive and multiplicative splitting iterations for systems of linear equations
- On convergence of the inner-outer iteration method for computing Pagerank
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- An Inner-Outer Iteration for Computing PageRank
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- A Power–Arnoldi algorithm for computing PageRank
- PageRank Computation, with Special Attention to Dangling Nodes
- Rational extrapolation for the PageRank vector
- Ordinal Ranking for Google's PageRank
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- Deeper Inside PageRank
- A Reordering for the PageRank Problem
- Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
- Updating Markov Chains with an Eye on Google's PageRank
- A Survey on PageRank Computing
