An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank

DOI10.1007/s10092-016-0211-2zbMath1380.65072OpenAlexW2569613274MaRDI QIDQ1675429

Zhibing Chen, Yongxin Dong, Chuanqing Gu

Publication date: 27 October 2017

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-016-0211-2

zbMATH Keywords

numerical exampleArnoldi algorithmPageRankinner-outer iterationtwo-stage splittingpreconditioned Arnoldi-Inout

Mathematics Subject Classification ID

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

Related Items (2)

Two-stage iterations based on composite splittings for rectangular linear systems ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank

Uses Software

• TRLan
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Arnoldi-Inout algorithm for computing PageRank problems
• Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
• A two-step matrix splitting iteration for computing PageRank
• An Arnoldi-type algorithm for computing Page Rank
• FOM accelerated by an extrapolation method for solving PageRank problems
• Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
• An Arnoldi-extrapolation algorithm for computing pagerank
• 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 convergence of the inner-outer iteration method for computing Pagerank
• A preconditioned and extrapolation-accelerated GMRES method for pagerank
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• On the multi-splitting iteration method for computing PageRank
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• An Inner-Outer Iteration for Computing PageRank
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• A Power–Arnoldi algorithm for computing PageRank
• PageRank Computation, with Special Attention to Dangling Nodes
• Rational extrapolation for the PageRank vector
• Extrapolation Methods for Vector Sequences
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• 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
• 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

This page was built for publication: An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank