The general inner-outer iteration method based on regular splittings for the PageRank problem
type: Item
instance of: scholarly article
title: The general inner-outer iteration method based on regular splittings for the PageRank problem
zbMATH Open document ID: 1429.65079
author: Yong Liu
author: Yan Zhang
author: Maoyi Tian
author: Zhao Lu Tian
author: Zhongyun Liu
published in: Applied Mathematics and Computation
publication date: 2019-11-29T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 15A06
Mathematics Subject Classification ID: 65F08
zbMATH DE Number: 7138628
zbMATH Keywords: PageRank
zbMATH Keywords: inner-outer iteration
zbMATH Keywords: regular splitting
zbMATH Keywords: preconditioner
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: j.amc.2019.02.066
OpenAlex ID: W2937528284
cites work: Q3943082
cites work: An Arnoldi-type algorithm for computing Page Rank
cites work: Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
cites work: On the multi-splitting iteration method for computing PageRank
cites work: Adaptive methods for the computation of PageRank
cites work: An Arnoldi-Inout algorithm for computing PageRank problems
cites work: An Inner-Outer Iteration for Computing PageRank
cites work: Q4947421
cites work: Q5340130
cites work: Q5689624
cites work: On convergence of the inner-outer iteration method for computing Pagerank
cites work: A preconditioned and extrapolation-accelerated GMRES method for pagerank
cites work: Parallel iterative methods for sparse linear systems
cites work: A new extrapolation method for PageRank computations
cites work: A Power–Arnoldi algorithm for computing PageRank
cites work: A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
cites work: A note on the two-step matrix splitting iteration for computing PageRank
cites work: Q5491464
cites work: A two-step matrix splitting iteration for computing PageRank
cites work: FOM accelerated by an extrapolation method for solving PageRank problems
cites work: Q4348513
cites work: An Arnoldi-extrapolation algorithm for computing pagerank
cites work: A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
cites work: A Survey on PageRank Computing
cites work: Deeper Inside PageRank
cites work: Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
cites work: An efficient elimination strategy for solving PageRank problems
cites work: Accelerated Overrelaxation Method
Wikidata QID: Q128049725
DOI: 10.1016/J.AMC.2019.02.066
description: scientific article; zbMATH DE number 7138628