A preconditioned and extrapolation-accelerated GMRES method for pagerank
From MaRDI portal
Publication:2349378
DOI10.1016/j.aml.2014.05.017zbMath1314.65057OpenAlexW2075133888MaRDI QIDQ2349378
Bing-Yuan Pu, Ting-Zhu Huang, Chun Wen
Publication date: 22 June 2015
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2014.05.017
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 (21)
Acceleration of the generalized FOM algorithm for computing PageRank ⋮ Off-diagonal low-rank preconditioner for difficult PageRank problems ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ A GMRES-power algorithm for computing PageRank problems ⋮ The modified matrix splitting iteration method for computing PageRank problem ⋮ A cost-effective smoothed multigrid with modified neighborhood-based aggregation for Markov chains ⋮ Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank ⋮ 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 ⋮ An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank ⋮ A variant of the Power-Arnoldi algorithm for computing PageRank ⋮ Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems ⋮ An adaptive Power-GArnoldi algorithm for computing PageRank ⋮ Parallel multisplitting iteration methods based on M-splitting for the PageRank problem ⋮ Global FOM and GMRES algorithms for a class of complex matrix equations ⋮ An iteration method for solving the linear system \(Ax=b\) ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ Flexible and deflated variants of the block shifted GMRES method ⋮ A note on the two-step matrix splitting iteration for computing PageRank ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ A general multi-splitting iteration method for computing PageRank
Cites Work
- Unnamed Item
- An Arnoldi-type algorithm for computing Page Rank
- Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
- An Arnoldi-extrapolation algorithm for computing pagerank
- Généralisations de la transformation de Shanks, de la table de Padé et de l'\(\varepsilon\)-algorithme
- Convergence acceleration for the iterative solution of the equations X = AX + f
- An Inner-Outer Iteration for Computing PageRank
- Acceleration Techniques for Iterated Vector and Matrix Problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Polynomial Extrapolation Method for Finding Limits and Antilimits of Vector Sequences
- A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
This page was built for publication: A preconditioned and extrapolation-accelerated GMRES method for pagerank
