...
首页> 外文期刊>Annals of nuclear energy >Acceleration of the exponential function expansion nodal SP_3 method by multi-group GMRES algorithm for PWR pin-by-pin calculation
【24h】

Acceleration of the exponential function expansion nodal SP_3 method by multi-group GMRES algorithm for PWR pin-by-pin calculation

机译:用多组GMRES算法加速指数函数展开节点SP_3方法的PWR逐引脚计算

获取原文
获取原文并翻译 | 示例

摘要

For PWR whole-core pin-by-pin calculation, a parallel multi-group neutron transport calculation code named EFEN was developed based on the Exponential Function Expansion Nodal SP3method. Considering the large number of unknowns, it was accelerated by using Coarse Mesh Rebalance (CMR) method. However, its efficiency still requires further improvement. In this paper, the acceleration of EFEN with Wielandt shift algorithm and multi-group Generalized Minimal Residual (GMRES) algorithm are studied. To deal with the high dominance ratio for PWR pin-by-pin problems, Wielandt shift algorithm is employed by transferring part of the fission source to pseudo scattering source. However, the pseudo scattering treatment would lead to an extra up-scattering issue which would increase the burden of the classical multi-group iteration for scattering source. Consequently, instead of using the multi-group Gauss-Seidel (GS) algorithm, a multi-group GMRES algorithm that solves all the energy groups simultaneously is adopted to deal with the extra up-scattering problem. Verifications and analysis of these algorithms are performed on a 10 × 1 multi-assembly pin-by-pin problem and a more realistic multi-group PWR whole-core pin-by-pin problem. Encouraging conclusions are demonstrated by the numerical results. (1) The number of power iteration can be reduced by a factor of about 6–10 by utilizing the Wielandt shift algorithm with a shifting factor of 0.01. (2) Multi-group GMRES algorithm accelerates the multi-group iteration significantly. The combination of these two can provide a speedup of 3.6 for a typical 8-group pin-by-pin calculation with 289 × 289 × 56 meshes. In addition, higher speedup of 14.0 can be obtained by combining the multi-group GMRES algorithm with the existing CMR method.
机译:为了进行PWR全核逐针计算,基于指数函数扩展节点SP3方法开发了名为EFEN的并行多组中子输运计算代码。考虑到大量未知数,可以通过使用粗网格重平衡(CMR)方法来加速。但是,其效率仍然需要进一步提高。本文研究了Wielandt移位算法和多组广义最小残差(GMRES)算法对EFEN的加速。为了解决PWR逐引脚问题的高支配比问题,采用Wielandt移位算法将部分裂变源转移到伪散射源。然而,伪散射处理将导致额外的向上散射问题,这将增加散射源的经典多组迭代的负担。因此,不是使用多组高斯-赛德尔(GS)算法,而是同时解决所有能量组的多组GMRES算法来处理额外的向上散射问题。对这些算法的验证和分析是在10××1的多组件引脚对引脚问题和更现实的多组PWR全核引脚对引脚问题上进行的。数值结果证明了令人鼓舞的结论。 (1)通过使用偏移因子为0.01的Wielandt偏移算法,可以将幂迭代的次数减少大约6-10。 (2)多组GMRES算法大大加快了多组迭代的速度。两种方法的结合可以为使用289××289××56网格的典型8组针对针计算提供3.6的加速。此外,通过将多组GMRES算法与现有的CMR方法结合,可以获得更高的14.0加速比。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号