anderson acceleration
Recently Published Documents


TOTAL DOCUMENTS

43
(FIVE YEARS 25)

H-INDEX

11
(FIVE YEARS 2)

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 636
Author(s):  
Xia Tang ◽  
Chun Wen ◽  
Xian-Ming Gu ◽  
Zhao-Li Shen

Anderson(m0) extrapolation, an accelerator to a fixed-point iteration, stores m0+1 prior evaluations of the fixed-point iteration and computes a linear combination of those evaluations as a new iteration. The computational cost of the Anderson(m0) acceleration becomes expensive with the parameter m0 increasing, thus m0 is a common choice in most practice. In this paper, with the aim of improving the computations of PageRank problems, a new method was developed by applying Anderson(1) extrapolation at periodic intervals within the Arnoldi-Inout method. The new method is called the AIOA method. Convergence analysis of the AIOA method is discussed in detail. Numerical results on several PageRank problems are presented to illustrate the effectiveness of our proposed method.


Sign in / Sign up

Export Citation Format

Share Document