Non-Stationary Acceleration Strategies for PageRank Computing
In this work, a non-stationary technique based on the Power method for accelerating the parallel computation of the PageRank vector is proposed and its theoretical convergence analyzed. This iterative non-stationary model, which uses the eigenvector formulation of the PageRank problem, reduces the n...
Main Authors: | Héctor Migallón, Violeta Migallón, José Penadés |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/7/10/911 |
Similar Items
-
Efficient Subpopulation Based Parallel TLBO Optimization Algorithms
by: Alejandro García-Monzó, et al.
Published: (2018-12-01) -
PageRank Implemented with the MPI Paradigm Running on a Many-Core Neuromorphic Platform
by: Evelina Forno, et al.
Published: (2021-05-01) -
APCM: An Auto-Parallelism Computational Model. Increasing the performance of MPI applications in multi-core environments
by: André Luiz Lima da Costa, et al.
Published: (2018-04-01) -
Acceleration of an adaptive generalized Arnoldi method for computing PageRank
by: Chun Wen, et al.
Published: (2021-11-01) -
Anderson Acceleration of the Arnoldi-Inout Method for Computing PageRank
by: Xia Tang, et al.
Published: (2021-04-01)