Research and validation on the numerical algorithm of mechanical module in a transient fuel rod performance code for fast reactor

•Models of irradiation behaviors for the fuel rod in LMFR like cracking-healing and PCMI have been established.•A numerical algorithm of mechanical module in fuel rod performance code for LMFR has been developed.•Accuracy and reliability of the numerical algorithm has been verified and validated by...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Annals of nuclear energy Ročník 171; s. 108991
Hlavní autori: Yang, Guangliang, Guo, Zixuan, Wang, Peng, Wang, Weixiang, Liao, Hailong, Ding, Tao, Chen, Hongli
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 15.06.2022
Predmet:
ISSN:0306-4549, 1873-2100
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•Models of irradiation behaviors for the fuel rod in LMFR like cracking-healing and PCMI have been established.•A numerical algorithm of mechanical module in fuel rod performance code for LMFR has been developed.•Accuracy and reliability of the numerical algorithm has been verified and validated by analytical solutions and typical code results. Mechanical performance is an important aspect for the fuel rod performance in LMFR. Operating conditions in LMFR, like large power density, high fast neutron flux and deep burnup, are hash for the fuel rod. The evolution of fuel rod behaviors is complicated and tightly coupled with each other through temperature, stress and burnup. Considering various in-pile behaviors of the fuel rod under fast neutron irradiation, the numerical iterative algorithm based on grid integration was established to deal with the complex nonlinear mechanical problem for the fuel rod in LMFR. Verification and validation have been carried out by comparing results from this algorithm with analytical solutions as well as results from typical code, which are all in good agreement with each other, proving the accuracy and reliability of this algorithm.
ISSN:0306-4549
1873-2100
DOI:10.1016/j.anucene.2022.108991