0
Research Papers

Research on MMPA Algorithm for Solving Detailed Depletion Chain With the NUIT Code

[+] Author and Article Information
Jian Li

Collaborative Innovation Center of
Advanced Nuclear Energy Technology,
Institute of Nuclear and New Energy Technology,
Tsinghua University,
Nengke Building, Haidian District,
Beijing 100084, China
e-mail: l-j16@mails.tsinghua.edu.cn

Ding She

Collaborative Innovation Center of
Advanced Nuclear Energy Technology,
Institute of Nuclear and New Energy Technology,
Tsinghua University,
Nengke Building, Haidian District,
Beijing 100084, China
e-mail: sheding@tsinghua.edu.cn

Lei Shi

Collaborative Innovation Center of
Advanced Nuclear Energy Technology,
Institute of Nuclear and New Energy Technology,
Tsinghua University,
Nengke Building, Haidian District,
Beijing 100084, China
e-mail: shinet@tsinghua.edu.cn

1Corresponding author.

Manuscript received August 24, 2017; final manuscript received November 26, 2017; published online March 5, 2018. Assoc. Editor: Leon Cizelj.

ASME J of Nuclear Rad Sci 4(2), 021007 (Mar 05, 2018) (4 pages) Paper No: NERS-17-1089; doi: 10.1115/1.4038771 History: Received August 24, 2017; Revised November 26, 2017

In depletion and transmutation calculation, it is important to solve detailed burnup chains with high computational accuracy and efficiency. This requires the good performance of the burnup algorithms. Nuclide inventory tool (NUIT) is a newly developed nuclide inventory calculation code, which is capable of handling detailed depletion chains by implementing various advanced algorithms. Based on the NUIT code, this paper investigates the accuracy and efficiency of the mini-max polynomial approximation (MMPA) method, and compares it with other burnup solvers in NUIT code. It is concluded that the MMPA method is numerically accurate and efficient for dealing with detailed depletion chains with extremely short half-lived nuclides.

FIGURES IN THIS ARTICLE
<>
Copyright © 2018 by ASME
Your Session has timed out. Please sign back in to continue.

References

Croff, A. G. , 1980, “ A User's Manual for the ORIGEN2 Computer Code,” Union Carbide Corporation for the Department of Energy, Washington, DC, Report No. ORNL/TM-7175. http://www.iaea.org/inis/collection/NCLCollectionStore/_Public/11/560/11560149.pdf
Wilson, W. B. , 1993, “ Accelerator Transmutation Studies at Los Alamos With LAHET, MCNP and CINDER'90,” Workshop on Simulation of Accelerator Radiation Environment, Santa Fe, NM, Jan. 11–15, pp. 3–5. https://inis.iaea.org/search/search.aspx?orig_q=RN:25015509
Leppanen, J. , 2013, “ Serpent—A Continuous-Energy Monte Carlo Reactor Physics Burnup Calculation Code,” VTT Technical Research Center of Finland, Espoo, Finland, Report No. NEA-1840. http://montecarlo.vtt.fi/download/Serpent_manual.pdf
Cetnar, J. , 2006, “ General Solution of Bateman Equation for Nuclear Transmutations,” Ann. Nucl. Energy, 33(7), pp. 640–645.
Pusa, M. , 2011, “ Rational Approximation to the Matrix Exponential in Burnup Calculations,” Nucl. Sci. Eng., 169, pp. 155–167. [CrossRef]
She, D. , Zhu, A. , and Wang, K. , 2012, “ Using Laguerre Polynomials to Compute the Matrix Exponential in Burnup Calculations,” International Topical Meeting on Advances in Reactor Physics (PHYSOR 2012), Knoxville, TN, Apr. 15–20.
Yosuke, K. , Go, C. , Masashi, T. , and Tadashi, N. , 2015, “ Numerical Solution of Matrix Exponential in Burn-up Equation Using Mini-Max Polynomial Approximation,” Ann. Nucl. Energy, 80, pp. 219–224. [CrossRef]
Brookhaven National Laboratory, 2009, “ ENDF/B-VII.0 Library,” Brookhaven National Laboratory, Upton, NY.

Figures

Grahic Jump Location
Fig. 1

Relative errors between CRAM TTA and MMPA other matrix exponential methods in case 2

Grahic Jump Location
Fig. 2

Relative errors by MMPA through different burnup steps

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In