ANALYSIS OF THE ACCELERATION EFFECT OF ANDERSON'S FIXED-POINT ACCELERATION METHOD IN CORE NEUTRONICS CALCULATIONS

被引:0
|
作者
An, Ping [1 ]
Lu, Wei [1 ]
Liu, Rui [2 ]
Li, Zhigang [1 ]
Tang, Qifen [1 ]
Shen, Jie [2 ]
机构
[1] Nucl Power Inst China, Chengdu, Peoples R China
[2] Nankai Univ, Tianjin, Peoples R China
关键词
Fixed-point iteration; Source iteration; Boron critical searching calculation; Anderson acceleration method;
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
Fixed-point iteration is the most widely used iterative format in numerical calculations. The Seidel iterative method is a traditional acceleration method, which is generally used in the source iteration process of core neutronics calculations. During the fixed-point iteration process, the Anderson acceleration method is using the least squares method to find the direction that converges the fastest, based on previous iteration values. The Anderson acceleration method can replace the Seidel iteration directly. So, it can be easily implemented in existing numerical software iteration. In this paper, the Anderson method with depth n is derived, where depth n represents the value of the previous n iterations. The Anderson acceleration formats with depths of 1 and 2 are used to calculate neutron flux of the reactor core. We calculate Boron critical searching calculation of the first-cycle loading. The calculation results show that the Anderson method reduces the number of iterations by 20% and the calculation time by about 15% on average compared with the source Seidel iteration while ensuring the same convergence accuracy. This improves the efficiency of neutronics calculations and provides a theoretical basis for subsequent transport calculations or other fixed-point iteration acceleration methods.
引用
收藏
页数:6
相关论文
共 50 条
  • [21] A Fast Method for Overflow Effect Analysis in Fixed-point Systems
    Nehmeh, R.
    Menard, D.
    Banciu, A.
    Michel, T.
    Rocher, R.
    PROCEEDINGS OF THE 2014 CONFERENCE ON DESIGN AND ARCHITECTURES FOR SIGNAL AND IMAGE PROCESSING, 2014,
  • [22] DECOMPOSITION METHOD AND ACCELERATION TECHNIQUES FOR A FIXED POINT ALGORITHM.
    Yamamura, Kiyotaka
    Oishi, Shin'ichi
    Horiuchi, Kazuo
    Electronics & communications in Japan, 1984, 67 (10): : 1 - 9
  • [24] An analysis for the DIIS acceleration method used in quantum chemistry calculations
    Thorsten Rohwedder
    Reinhold Schneider
    Journal of Mathematical Chemistry, 2011, 49
  • [25] An analysis for the DIIS acceleration method used in quantum chemistry calculations
    Rohwedder, Thorsten
    Schneider, Reinhold
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2011, 49 (09) : 1889 - 1914
  • [26] Convergence analysis of Anderson-type acceleration of Richardson's iteration
    Pasini, Massimiliano Lupo
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2019, 26 (04)
  • [27] Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
    Hideaki Iiduka
    Mathematical Programming, 2015, 149 : 131 - 165
  • [28] Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
    Iiduka, Hideaki
    MATHEMATICAL PROGRAMMING, 2015, 149 (1-2) : 131 - 165
  • [29] Acceleration of the Modified S-Algorithm to Search for a Fixed Point of a Nonexpansive Mapping
    Kitkuan, D.
    Zhao, J.
    Zong, H.
    Kumam, W.
    COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2019, 10 (02): : 231 - 243
  • [30] Understanding Nesterov's Acceleration via Proximal Point Method
    Ahn, Kwangjun
    Sra, Suvrit
    2022 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2022, : 117 - 130