Search NASA⌕ Search

SEARCH · Search NASA

Results for “Chebyshev rational approximation method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Global error analysis of the Chebyshev rational approximation method

The Chebyshev rational approximation method (CRAM) has become a widely adopted method for solving nuclear depletion problems. Therefore, understanding CRAM’s accuracy is important for the safe operation of nuclear power plants. This article performs a global error analysis of CRAM and finds that, as the length of the time step approaches zero, the relative error measured between the exact and CRAM solutions at a fixed end time approaches one and infinity for even and odd orders, respectively; for intermediate time step sizes, a minimum in relative error is observed. Finally, we show that the reason for CRAM’s behavior is that the method is inconsistent. Two best practices for using CRAM, derived from these results, are: (1) use CRAM order 16 or higher, (2) if necessary, increase the CRAM order when multiphysics coupling requires smaller time steps.

97 MATHEMATICS AND COMPUTING↗

Improving the Accuracy of the Chebyshev Rational Approximation Method Using Substeps

The Chebyshev Rational Approximation Method (CRAM) for solving the decay and depletion of nuclides is shown to have a remarkable decrease in error when advancing the system with the same time step and microscopic reaction rates as the previous step. This property is exploited here to achieve high accuracy in any end-of-step solution by dividing a step into equidistant sub-steps. The computational cost of identical substeps can be reduced significantly below that of an equal number of regular steps, as the LU decompositions for the linear solves required in CRAM only need to be formed on the first substep. The improved accuracy provided by substeps is most relevant in decay calculations, where there have previously been concerns about the accuracy and generality of CRAM. Lastly, with substeps, CRAM can solve any decay or depletion problem with constant microscopic reaction rates to an extremely high accuracy for all nuclides with concentrations above an arbitrary limit.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

An efficient implementation of the Chebyshev Rational Approximation Method (CRAM) for solving the burnup equations

The Chebyshev Rational Approximation Method (CRAM) has been recently introduced by the authors for solving the burnup equations with excellent results. This method has been shown to be capable of simultaneously solving an entire burnup system with thousands of nuclides both accurately and efficiently. The method was prompted by an analysis of the spectral properties of burnup matrices and it can be characterized as the best rational approximation on the negative real axis. The coefficients of the rational approximation are fixed and have been reported for various approximation orders. In addition to these coefficients, implementing the method only requires a linear solver. This paper describes an efficient method for solving the linear systems associated with the CRAM approximation. The introduced direct method is based on sparse Gaussian elimination where the sparsity pattern of the resulting upper triangular matrix is determined before the numerical elimination phase. The stability of the proposed Gaussian elimination method is discussed based on considering the numerical properties of burnup matrices. Suitable algorithms are presented for computing the symbolic factorization and numerical elimination in order to facilitate the implementation of CRAM and its adoption into routine use. The accuracy and efficiency of the described technique are demonstrated by computing the CRAM approximations for a large test case with over 1600 nuclides. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accuracy considerations for Chebyshev rational approximation method (CRAM) in Burnup calculations

The burnup equations can in principle be solved by computing the exponential of the burnup matrix. However, due to the difficult numerical characteristics of burnup matrices, the problem is extremely stiff and the matrix exponential solution has previously been considered infeasible for an entire burnup system containing over a thousand nuclides. It was recently discovered by the author that the eigenvalues of burnup matrices are generally located near the negative real axis, which prompted introducing the Chebyshev rational approximation method (CRAM) for solving the burnup equations. CRAM can be characterized as the best rational approximation on the negative real axis and it has been shown to be capable of simultaneously solving an entire burnup system both accurately and efficiently. In this paper, the accuracy of CRAM is further studied in the context of burnup equations. The approximation error is analyzed based on the eigenvalue decomposition of the burnup matrix. It is deduced that the relative accuracy of CRAM may be compromised if a nuclide concentration diminishes significantly during the considered time step. Numerical results are presented for two test cases, the first one representing a small burnup system with 36 nuclides and the second one a full a decay system with 1531 nuclides. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Solving the Bateman equations in CASMO5 using implicit ode numerical methods for stiff systems

The Bateman equations, which describe the transmutation of nuclides over time as a result of radioactive decay, absorption, and fission, are often numerically stiff. This is especially true if short-lived nuclides are included in the system. This paper describes the use of implicit numerical methods for o D Es applied to the stiff Bateman equations, specifically employing the Backward Differentiation Formulas (BDF) form of the linear multistep method. As is true in other domains, using an implicit method removes or lessens the (sometimes severe) step-length constraints by which explicit methods must abide. To gauge its accuracy and speed, the BDF method is compared to a variety of other solution methods, including Runge-Kutta explicit methods and matrix exponential methods such as the Chebyshev Rational Approximation Method (CRAM). A preliminary test case was chosen as representative of a PWR lattice depletion step and was solved with numerical libraries called from a Python front-end. The Figure of Merit (a combined measure of accuracy and efficiency) for the BDF method was nearly identical to that for CRAM, while explicit methods and other matrix exponential approximations trailed behind. The test case includes 319 nuclides, in which the shortest-lived nuclide is {sup 98}Nb with a half-life of 2.86 seconds. Finally, the BDF and CRAM methods were compared within CASMO5, where CRAM had a FOM about four times better than BDF, although the BDF implementation was not fully optimized. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Introduction of the Adding and Doubling Method for Solving Bateman Equations for Nuclear Fuel Depletion

This paper introduces and evaluates the Adding and Doubling Method (ADM) for solving the Bateman equations for depletion systems with varying numbers of nuclides and compares it to the Chebyshev Rational Approximation Method (CRAM), both implemented in the reactor physics analysis application Griffin. ADM, when applied to the Crank-Nicolson Finite Difference method, can produce results comparable in accuracy and precision to CRAM with comparable run times for systems with 35 or 297 nuclides. For systems with more than 300 nuclides, the matrix-matrix operations required by ADM are significantly more costly than the matrix-vector operations required by CRAM, making CRAM the more efficient method for systems with large numbers of nuclides. ADM is an accurate method that maintains other advantages over CRAM in that it does not depend on pre-generated coefficients or require complex number operations. ADM also manages to outperform CRAM by a factor of more than 250 in terms of run time for depletion systems that require multiple Bateman solves while the depletion matrix and time step size remain constant over all depletion intervals.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Calculating Time-Integral Quantities in Depletion Calculations

A method referred to as tally nuclides is presented for accurately and efficiently calculating the time-step averages and integrals of any quantities that are weighted sums of atomic densities with constant weights during the step. The method allows all such quantities to be calculated simultaneously as a part of a single depletion solution with existing depletion algorithms. Some examples of the results that can be extracted include step-average atomic densities and macroscopic reaction rates, the total number of fissions during the step, and the amount of energy released during the step. Furthermore, the method should be applicable with several depletion algorithms, and the integrals or averages should be calculated with an accuracy comparable to that reached by the selected algorithm for end-of-step atomic densities. The accuracy of the method is demonstrated in depletion calculations using the Chebyshev rational approximation method. Here, we demonstrate how the ability to calculate energy release in depletion calculations can be used to determine the accuracy of the normalization in a constant-power burnup calculation during the calculation without a need for a reference solution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A method for including external feed in depletion calculations with CRAM and implementation into ORIGEN

A method for including external feed with polynomial time dependence in depletion calculations with the Chebyshev Rational Approximation Method (CRAM) is presented and the implementation of CRAM to the ORIGEN module of the SCALE suite is described. In addition to being able to handle time-dependent feed rates, the new solver also adds the capability to perform adjoint calculations. Results obtained with the new CRAM solver and the original depletion solver of ORIGEN are compared to high precision reference calculations, which shows the new solver to be orders of magnitude more accurate. Lastly, in most cases, the new solver is up to several times faster due to not requiring similar substepping as the original one.

97 MATHEMATICS AND COMPUTING↗

Depletion capabilities in the OpenMC Monte Carlo particle transport code

A depletion solver has been implemented in OpenMC and is described herein. The depletion solver is implemented in Python and interfaces with OpenMC’s transport solver through a C++ application programming interface, which enables an in-memory transport-depletion coupling. Multiple integration methods for advancing in time have been implemented and exhibit tradeoffs in cost, accuracy, and memory use. For all time integration methods, evaluation of the matrix exponential is performed by using the incomplete partial fraction form of the Chebyshev rational approximation method. Simulations of a pressurized water reactor (PWR) pincell and a sodium-cooled fast reactor (SFR) assembly were carried out with OpenMC and Serpent. For both problems, the use of a high-fidelity depletion chain results in predictions of k eff that agree within 20–30 pcm between OpenMC and Serpent. Predicted actinide concentrations were found to agree to a fraction of a percent, and most fission product concentrations were found to agree within 1%. Here, the few cases where larger differences were observed can be attributed either to differences in how the energy dependence of fission product yields is handled or deficiencies in the nuclear data used. OpenMC simulations of the PWR and SFR problems using a simplified 228-nuclide depletion chain demonstrate that it achieves accuracy close to that of the full, high-fidelity depletion chain with respect to the studied responses.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Using Laguerre polynomials to compute the matrix exponential in burnup calculations

An essential part of burnup analysis is to solve the burnup equations. The burnup equations can be regarded as a first-order linear system and solved by means of matrix exponential methods. Because of its large spectrum, it is difficult to compute the exponential of the burnup matrix. Conventional methods of computing the matrix exponential, such as the truncated Taylor expansion and the Pade approximation, are not applicable to burnup calculations. Recently the Chebyshev Rational Approximation Method (CRAM) has been applied to solve burnup matrix exponential and shown to be robust and accurate. However, the main defect of CRAM is that its coefficients are not easy to obtain. In this paper, an orthogonal polynomial expansion method, called Laguerre Polynomial Approximation Method (LPAM), is proposed to compute the matrix exponential in burnup calculations. The polynomial sequence of LPAM can be easily computed in any order and thus LPAM is quite convenient to be utilized into burnup codes. Two typical test cases with the decay and cross-section data taken from the standard ORIGEN 2.1 libraries are calculated for validation, against the reference results provided by CRAM of 14 order. Numerical results show that, LPAM is sufficiently accurate for burnup calculations. The influences of the parameters on the convergence of LPAM are also discussed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

SCALE Code System

The SCALE Code System is a widely-used modeling and simulation suite for nuclear safety analysis and design that is developed, maintained, tested, and managed by the Reactor and Nuclear Systems Division (RNSD) of Oak Ridge National Laboratory (ORNL). SCALE provides a comprehensive, verified and validated, user-friendly tool set for criticality safety, reactor and lattice physics, radiation shielding, spent fuel and radioactive source term characterization, and sensitivity and uncertainty analysis. Since 1980, regulators, licensees, and research institutions around the world have used SCALE for safety analysis and design. SCALE provides an integrated framework with dozens of computational modules including three deterministic and three Monte Carlo radiation transport solvers that are selected based on the desired solution strategy. SCALE includes current nuclear data libraries and problem-dependent processing tools for continuous-energy (CE) and multigroup (MG) neutronics and coupled neutron-gamma calculations, as well as activation, depletion, and decay calculations. SCALE includes unique capabilities for automated variance reduction for shielding calculations, as well as sensitivity and uncertainty analysis. SCALE’s graphical user interfaces assist with accurate system modeling, visualization of nuclear data, and convenient access to desired results.SCALE 6.2 provides many new capabilities and significant improvements of existing features.New capabilities include:• ENDF/B-VII.1 nuclear data libraries CE and MG with enhanced group structures,• Neutron covariance data based on ENDF/B-VII.1 and supplemented with ORNL data,• Covariance data for fission product yields and decay constants,• Stochastic uncertainty and correlation quantification for any SCALE sequence with Sampler,• Parallel calculations with KENO,• Problem-dependent temperature corrections for CE calculations,• CE shielding and criticality accident alarm system analysis with MAVRIC,• CE depletion with TRITON (T5-DEPL/T6-DEPL),• CE sensitivity/uncertainty analysis with TSUNAMI-3D,• Simplified and efficient LWR lattice physics with Polaris,• Large scale detailed spent fuel characterization with ORIGAMI and ORIGAMI Automator,• Advanced fission source convergence acceleration capabilities with Sourcerer,• Nuclear data library generation with AMPX, and• Integrated user interface with Fulcrum.Enhanced capabilities include:• Accurate and efficient CE Monte Carlo methods for eigenvalue and fixed source calculations,• Improved MG resonance self-shielding methodologies and data,• Resonance self-shielding with modernized and efficient XSProc integrated into most sequences,• Accelerated calculations with TRITON/NEWT (generally 4x faster than SCALE 6.1),• Spent fuel characterization with 1470 new reactor-specific libraries for ORIGEN,• Modernization of ORIGEN (Chebyshev Rational Approximation Method [CRAM] solver, API for high-performance depletion, new keyword input format)• Extension of the maximum mixture number to values well beyond the previous limit of 2147 to ~2 billion,• Nuclear data formats enabling the use of more than 999 energy groups,• Updated standard composition library to provide more accurate use of natural abundances, andvi• Numerous other enhancements for improved usability and stability.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

ONIX: An open-source depletion code

Open Source software enables innovative, community-based software development. ONIX brings this concept to the field of depletion calculations. It is an open-source depletion software to be used for nuclear reactor simulations, for fissile material production analysis as well as for nuclear arms control applications. ONIX provides a module to solve the depletion equation using a Chebyshev Rational Approximation Method. For the generation of one-group cross sections, it includes a coupling interface for the open-source neutron transport code, OpenMC, as well as a module to read pre-computed values in a stand-alone mode. ONIX has special features to optimize nuclear data libraries, to update isomeric branching ratio during burnup, and to support automation of simulations for nuclear archaeology. In conclusion, ONIX has been validated against results from numerical and experimental benchmarks, and its results agree with other methods within expected error ranges.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

pyDecay: A CRAM-Based Isotope Decay Solver

This module (pyDecay) implements a Chebyshev Rational Approximation Method (CRAM) for solving isotope decay equations, based on the work of M. Pusa. It provides a numerically stable and efficient method for evaluating the matrix exponential involved in nuclear decay calculations. This implementation of CRAM relies on the incomplete partial factorization (IPF) algorithm published by Pusa [3], with corrections noted by Romano et al.

Skutnik, SteveEugene [Oak Ridge National Laborator↗

Initial Testing of the Microscopic Depletion Implementation in the MAMMOTH Reactor Physics Application

Present and new nuclear fuels that will be tested at the Transient Reactor Test (TREAT) facility will be analyzed with the MAMMOTH reactor physics application, currently under development, at Idaho National Laboratory. MAMMOTH natively couples the BISON, RELAP-7, and Rattlesnake applications within the MOOSE framework. This system allows the irradiation of fuel from beginning of life in a nuclear reactor until it is placed in TREAT for fuel testing within the same analysis mesh and, thus, retaining a very high level of resolution and fidelity. The calculation of the isotopic distribution in fuel requires the solution to the decay and transmutation equations coupled to the neutron transport equation. The Chebyshev Rational Approximation Method (CRAM) is the current state-of-the-art in the field, as was chosen to be the solver for the decay and transmutation equations. This report shows that the implementation of the CRAM solver within MAMMOTH is correct with various analytic benchmarks for decay and transmutation of nuclides. The results indicate that the solutions with CRAM order 16 achieve the level of precision of the benchmark. The CRAM solutions show little sensitivity to the time step size and consistently produce a high level of accuracy for isotopic decay for time steps of 1x10^11 years. Comparisons to DRAGON5 with 297 isotopes yield comparable results, but some differences need to be further analyzed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

PHISICS: New Features and Advancements

The PHISICS (Parallel and Highly Innovative Simulation for INL Code System) software is under an intensive development at INL. In the last months new features have been added and improvements of the previously existing one performed. The modular approach has created a friendly development environment that allows a quick expansion of the capabilities. In the last months a little amount of work has been dedicated to the improvement of the spherical harmonics based nodal transport solver while the implementation of a solver based on the self adjoint formulation of the discrete ordinate is in the test phase on structured mesh. PHISICS now include a depletion solver with the option to use two different algorithms for the solution of the Bateman equation: the Taylor development of the exponential matrix and the Chebyshev Rational Approximation Method. The coupling with RELAP5 is also available at least in the steady state search mode. The coupling between RELAP5 and PHISICS can also take advantage of the new cross section interpolation module so that the coupling could be performed using an arbitrary number of energy groups.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗