Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
type: Item
instance of: scholarly article
title: Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
zbMATH Open document ID: 1410.65115
author: Na Huang
author: Changfeng Ma
published in: Applied Mathematics and Computation
publication date: 2019-03-22T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 7040902
zbMATH Keywords: PageRank
zbMATH Keywords: linear systems
zbMATH Keywords: regular splitting
zbMATH Keywords: M-splitting
zbMATH Keywords: iteration method
describes a project that uses: GeneRank
MaRDI profile type: Publication
full work available at URL: j.amc.2015.09.016
OpenAlex ID: W2179875074
cites work: On convergence of the inner-outer iteration method for computing Pagerank
cites work: On the convergence of additive and multiplicative splitting iterations for systems of linear equations
cites work: On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
cites work: A class of asynchronous parallel nonlinear accelerated overrelaxation methods for the nonlinear complementarity problems
cites work: Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
cites work: Models of parallel chaotic iteration methods
cites work: Q3835933
cites work: Q3943082
cites work: A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
cites work: Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
cites work: Convergence of relaxed parallel multisplitting methods
cites work: Q5340130
cites work: An Arnoldi-type algorithm for computing Page Rank
cites work: An Inner-Outer Iteration for Computing PageRank
cites work: A Note on the Convergence of SOR for the PageRank Problem
cites work: On the multi-splitting iteration method for computing PageRank
cites work: A two-step matrix splitting iteration for computing PageRank
cites work: Adaptive methods for the computation of PageRank
cites work: Deeper Inside PageRank
cites work: Q5491464
cites work: A multisplitting method for symmetric linear complementarity problems
cites work: Multi-Splittings of Matrices and Parallel Solution of Linear Systems
cites work: A preconditioned and extrapolation-accelerated GMRES method for pagerank
cites work: Two-Stage and Multisplitting Methods for the Parallel Solution of Linear Systems
cites work: Q4947421
cites work: On the convergence of the parallel multisplitting AOR algorithm
cites work: Multisplitting with Different Weighting Schemes
cites work: A CLASS OF ASYNCHRONOUS PARALLEL NONLINEAR MULTISPLITTING RELAXATION METHODS
DOI: 10.1016/J.AMC.2015.09.016
Recommended article: On the multi-splitting iteration method for computing PageRank
Recommended article: A general multi-splitting iteration method for computing PageRank
Recommended article: The modified matrix splitting iteration method for computing PageRank problem
Recommended article: An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
Recommended article: Q4623849
Recommended article: A multi-power and multi-splitting inner-outer iteration for PageRank computation
Recommended article: A preprocessed multi-step splitting iteration for computing PageRank
Recommended article: Parallelizing the Computation of PageRank
description: scientific article; zbMATH DE number 7040902