skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A relaxed two-step splitting iteration method for computing PageRank

Abstract

In this paper, we extend the two-step matrix splitting iteration approach by introducing a new relaxation parameter. The main idea is based on the inner–outer iteration for solving the PageRank problems proposed by Gleich et al. (J Sci Comput 32(1): 349–371, 2010) and Bai (Numer Algebra Cont Optim 2(4): 855–862, 2012) and the two-step splitting iteration presented by Gu et al. (Appl Math Comput 271: 337–343, 2015). The theoretical analysis results show that the proposed method is efficient. Numerical experiments demonstrate that the convergence performances of the method are better than the existing methods.

Authors:
 [1];  [2]
  1. Fujian Jiangxia University, Department of Mathematics and Physics (China)
  2. Fujian Normal University, School of Mathematics and Computer Science (China)
Publication Date:
OSTI Identifier:
22769390
Resource Type:
Journal Article
Journal Name:
Computational and Applied Mathematics
Additional Journal Information:
Journal Volume: 37; Journal Issue: 1; Other Information: Copyright (c) 2018 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 0101-8205
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICAL METHODS AND COMPUTING; ALGEBRA; CONVERGENCE; ITERATIVE METHODS; MATRICES

Citation Formats

Xie, Ya-Jun, and Ma, Chang-Feng. A relaxed two-step splitting iteration method for computing PageRank. United States: N. p., 2018. Web. doi:10.1007/S40314-016-0338-4.
Xie, Ya-Jun, & Ma, Chang-Feng. A relaxed two-step splitting iteration method for computing PageRank. United States. doi:10.1007/S40314-016-0338-4.
Xie, Ya-Jun, and Ma, Chang-Feng. Thu . "A relaxed two-step splitting iteration method for computing PageRank". United States. doi:10.1007/S40314-016-0338-4.
@article{osti_22769390,
title = {A relaxed two-step splitting iteration method for computing PageRank},
author = {Xie, Ya-Jun and Ma, Chang-Feng},
abstractNote = {In this paper, we extend the two-step matrix splitting iteration approach by introducing a new relaxation parameter. The main idea is based on the inner–outer iteration for solving the PageRank problems proposed by Gleich et al. (J Sci Comput 32(1): 349–371, 2010) and Bai (Numer Algebra Cont Optim 2(4): 855–862, 2012) and the two-step splitting iteration presented by Gu et al. (Appl Math Comput 271: 337–343, 2015). The theoretical analysis results show that the proposed method is efficient. Numerical experiments demonstrate that the convergence performances of the method are better than the existing methods.},
doi = {10.1007/S40314-016-0338-4},
journal = {Computational and Applied Mathematics},
issn = {0101-8205},
number = 1,
volume = 37,
place = {United States},
year = {2018},
month = {3}
}