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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
