Parallel multisplitting iteration methods based on M-splitting for the PageRank problem

DOI10.1016/j.amc.2015.09.016zbMath1410.65115OpenAlexW2179875074MaRDI QIDQ1732194

Na Huang, Chang-Feng Ma

Publication date: 22 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.09.016

zbMATH Keywords

linear systemsiteration methodregular splittingPageRankM-splitting

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items

A relaxed two-step splitting iteration method for computing PageRank ⋮ The modified matrix splitting iteration method for computing PageRank problem ⋮ A multi-cluster time aggregation approach for Markov chains ⋮ Several relaxed iteration methods for computing PageRank ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems ⋮ A general multi-splitting iteration method for computing PageRank ⋮ The coupled iteration algorithms for computing PageRank

Uses Software

• GeneRank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two-step matrix splitting iteration for computing PageRank
• A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• On the convergence of the parallel multisplitting AOR algorithm
• An Arnoldi-type algorithm for computing Page Rank
• Models of parallel chaotic iteration methods
• Convergence of relaxed parallel multisplitting methods
• A class of asynchronous parallel nonlinear accelerated overrelaxation methods for the nonlinear complementarity problems
• Adaptive methods for the computation of PageRank
• On the convergence of additive and multiplicative splitting iterations for systems of linear equations
• A multisplitting method for symmetric linear complementarity problems
• On convergence of the inner-outer iteration method for computing Pagerank
• A preconditioned and extrapolation-accelerated GMRES method for pagerank
• On the multi-splitting iteration method for computing PageRank
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
• An Inner-Outer Iteration for Computing PageRank
• A Note on the Convergence of SOR for the PageRank Problem
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Two-Stage and Multisplitting Methods for the Parallel Solution of Linear Systems
• Deeper Inside PageRank
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Multisplitting with Different Weighting Schemes
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• A CLASS OF ASYNCHRONOUS PARALLEL NONLINEAR MULTISPLITTING RELAXATION METHODS

This page was built for publication: Parallel multisplitting iteration methods based on M-splitting for the PageRank problem