Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
From MaRDI portal
Publication:395333
DOI10.1007/s10915-013-9696-xzbMath1282.65045OpenAlexW2017374514MaRDI QIDQ395333
Ying Zhang, Gang Wu, Yi-Min Wei
Publication date: 29 January 2014
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-013-9696-x
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10) Information storage and retrieval of data (68P20)
Related Items (8)
An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank ⋮ Functions and eigenvectors of partially known matrices with applications to network analysis ⋮ Multipreconditioned GMRES for simulating stochastic automata networks ⋮ Block minimum perturbation algorithm based on block Arnoldi process for nonsymmetric linear systems with multiple right-hand sides ⋮ A note on the two-step matrix splitting iteration for computing PageRank ⋮ A general multi-splitting iteration method for computing PageRank ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ A Hessenberg-type algorithm for computing PageRank problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- An Arnoldi-type algorithm for computing Page Rank
- Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
- Google pageranking problem: The model and the analysis
- An Arnoldi-extrapolation algorithm for computing pagerank
- A recurrence among the elements of functions of triangular matrices
- Upper bounds for convergence rates of acceleration methods with initial iterations
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Adaptive methods for the computation of PageRank
- Complete stagnation of GMRES
- Comparison of Krylov subspace methods on the PageRank problem
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Random Alpha PageRank
- An Inner-Outer Iteration for Computing PageRank
- Further Analysis of the Arnoldi Process for Eigenvalue Problems
- 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
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- Deeper Inside PageRank
- Accuracy and Stability of Numerical Algorithms
- A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
- Algorithms and Models for the Web-Graph
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- Paradoxical Effects in PageRank Incremental Computations
- A Survey on PageRank Computing
This page was built for publication: Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
