Off-diagonal low-rank preconditioner for difficult PageRank problems
type: Item
instance of: scholarly article
title: Off-diagonal low-rank preconditioner for difficult PageRank problems
zbMATH Open document ID: 1402.65028
author: Zhaoli Shen
author: Ting-Zhu Huang
author: Bruno Carpentieri
author: Chun Wen
author: Xian-Ming Gu
author: Xueyuan Tan
published in: Journal of Computational and Applied Mathematics
publication date: 2018-11-16T00:00:00Z
full work available at URL: 1 s2.0 S0377042718304357 main.pdf
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 6980361
zbMATH Keywords: PageRank
zbMATH Keywords: off-diagonal
zbMATH Keywords: low-rank factorization
zbMATH Keywords: matrix partition
zbMATH Keywords: preconditioner
describes a project that uses: SparseMatrix
describes a project that uses: ILUPACK
describes a project that uses: UbiCrawler
describes a project that uses: WebGraph
MaRDI profile type: Publication
OpenAlex ID: W2883327543
cites work: A two-step matrix splitting iteration for computing PageRank
cites work: PageRank beyond the web
cites work: A Reordering for the PageRank Problem
cites work: Q5491464
cites work: Q5471426
cites work: An Arnoldi-type algorithm for computing Page Rank
cites work: Adaptive methods for the computation of PageRank
cites work: An Inner-Outer Iteration for Computing PageRank
cites work: A new extrapolation method for PageRank computations
cites work: A note on the two-step matrix splitting iteration for computing PageRank
cites work: FOM accelerated by an extrapolation method for solving PageRank problems
cites work: An Arnoldi-extrapolation algorithm for computing pagerank
cites work: A Survey on PageRank Computing
cites work: A preconditioned and extrapolation-accelerated GMRES method for pagerank
cites work: A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
cites work: Comparison of Krylov subspace methods on the PageRank problem
cites work: An efficient elimination strategy for solving PageRank problems
cites work: Updating the Inverse of a Matrix
cites work: An explicit formula for the inverse of a pentadiagonal Toeplitz matrix
cites work: A lower bound for the smallest singular value of a matrix
cites work: Q4479208
cites work: The university of Florida sparse matrix collection
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Preconditioning techniques for large linear systems: A survey
cites work: Q4692877
Wikidata QID: Q129457057
DOI: 10.1016/J.CAM.2018.07.015
Recommended article: A preconditioning approach to the pagerank computation problem
Recommended article: A preconditioned and extrapolation-accelerated GMRES method for pagerank
Recommended article: An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
Recommended article: Regularization-based solution of the PageRank problem for large matrices
Recommended article: Euler-Richardson method preconditioned by weakly stochastic matrix algebras: a potential contribution to Pagerank computation
Recommended article: A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
Recommended article: Preconditioners for rank deficient least squares problems
Recommended article: Comparison of Krylov subspace methods on the PageRank problem
Recommended article: Preconditioned conjugate gradient method for rank deficient least-squares problems
Recommended article: Algorithms and Models for the Web-Graph
description: scientific article; zbMATH DE number 6980361