Calculation of the C5G7 3-D extension benchmark by ARES transport code

Zhang, Liang; Zhang, Bin; Liu, Cong; Zheng, Junxiao; Zheng, Yukun; Chen, Yixue

doi:10.1016/j.nucengdes.2017.04.011

Cited by 8 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The efficient parallel algorithms and the acceleration methods of discrete ordinates methods (Sn) (Carlson, 1953) for multi-dimensional large-scale neutron transport models are research hotspots in the reactor simulation field. In the past few decades, many parallel Sn neutron transport codes are developed by using overloading spatial domain decomposition (Bailey and Falgout, 2009) or Koch-Baker-Alcouffe (KBA) algorithms (Baker and Koch, 1998), including DENOVO (Evans et al, 2010), PARTISN (Alcouffe et al, 2005), NECP-hydra (Xu et al, 2018), ARES (Zhang et al, 2017) and so on. To…”

Section: Introductionmentioning

confidence: 99%

Parallel Jacobian-free Newton Krylov discrete ordinates method for pin-by-pin neutron transport models

Zhang

Zhou

2023

Front. Energy Res.

View full text Add to dashboard Cite

A parallel Jacobian-Free Newton Krylov discrete ordinates method (comePSn_JFNK) is proposed to solve the multi-dimensional multi-group pin-by-pin neutron transport models, which makes full use of the good efficiency and parallel performance of the JFNK framework and the high accuracy of the Sn method for the large-scale models. In this paper, the k-eigenvalue and the scalar fluxes (rather than the angular fluxes) are chosen as the global solution variables of the parallel JFNK method, and the corresponding residual functions are evaluated by the Koch–Baker–Alcouffe (KBA) algorithm with the spatial domain decomposition in the parallel Sn framework. Unlike the original Sn iterative strategy, only a “flattened” power iterative process which includes a single outer iteration without nested inner iterations is required for the JFNK strategy. Finally, the comePSn_JFNK code is developed in C++ language and, the numerical solutions of the 2-D/3-D KAIST-3A benchmark problems and the 2-D/3-D full-core MOX/UOX pin-by-pin models with different control rod distribution show that comePSn_JFNK method can obtain significant efficiency advantage compared with the original power iteration method (comePSn) for the parallel simulation of the large-scale complicated pin-by-pin models.

show abstract