Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cartesian”

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 1,333 records · Page 74

An Autonomous Robot for Shell and Tube Heat Exchanger Inspection

Shell and tube heat exchangers (STHEs) are critical to energy conversion efficiency of power plants. Eddy current examination is a way to evaluate working conditions of these tubes. However, the current testing apparatus requires human to manually insert an eddy current testing (ECT) probe into and extract it out of individual tubes, and meanwhile monitor measurement results for diagnosis. It is a time-consuming and labor-intensive procedure even for an experienced technician. To tackle this challenge, in this work, we developed a robot enabled ECT system for autonomous inspection of STHEs. The robotic platform employs Mecanum wheeled chassis for high mobility, machine vision to locate tube bundle and tube inlets, a rotational Cartesian mechanism to operate at planes with all possible inclinations, and a task-specific mechanism for ECT probe delivery. Machine vision locates tube bundle and tube inlets by an April tag detection algorithm and a Circle Hough Transform (CHT) algorithm, respectively. Assisted by a guidance cone, the ECT probe is continuously fed into the tubes with a fill factor of 0.819. During this process, the eddy current data are automatically collected and real-time analyzed by convolutional neural networks (CNN), showing accuracy of nearly 100% for identifying defective and non-defective tubes and 85% for four types of defective tubes and non-defective tubes.

autonomy, deep learning, eddy current testing, hea↗

Mesoflow: An Open-Source Reacting Flow Solver for Catalysis at Mesoscale

We present the capabilities and software performance metrics of our open-source continuum solver for catalysis, Mesoflow, developed specifically for modeling transport and chemistry at the mesoscale. Our solver utilizes Cartesian block-structured adaptive mesh refinement to resolve complex catalyst surface morphologies directly obtained from X-ray tomography data. An immersed boundary based formulation enables rapid representation of complex geometries prevalent in most mesoporous catalyst interfaces. The solver is developed on top of open-source performance portable library, AMReX, providing parallel execution capabilities on current and upcoming high-performance-computing (HPC) architectures. Our flexible software framework enables integration of complex chemical mechanisms at heterogenous interfaces and time-split algorithms for circumventing highly disparate reaction and flow time-scales. Our current studies indicate a ten-fold performance gain by using graphics-processing-units (GPUs) compared to a single processor for representative problem sizes (2 million cell mesh). We will also present a brief introduction on how to build and use this software for application problems pertaining to catalytic upgrading and gas transport within porous catalyst particles.

adaptive meshing↗

Simulating Catalysis with Realistic Pellet Geometries Using Mesoflow: A Case Study of Catalytic Propane Dehydrogenation

We present a case study of catalytic propane dehydrogenation with our open-source multiphysics solver, Mesoflow. The solver was developed to simulate reactive flow coupled to heterogeneous catalytic reactions and deactivation in the context of complex, mesoscale geometry. The method leverages cartesian block-structured adaptive mesh refinement to capture realistic catalyst microstructural features acquired directly from X-ray computed tomography data. A kinetic model for propane dehydrogenation and catalyst deactivation was developed based on temporal analysis of products (TAP) reactor experiments. The TAP reactor experiments allow for precise characterization of intrinsic kinetic reaction steps which are implemented into Mesoflow simulations to model the spatial and temporal evolution of reactants, products, and catalyst active sites. The short-term and long-term deactivation behavior is studied by using XCT data collected from fresh and aged catalyst pellets, which exhibit different microstructural features. This study employs time-splitting algorithms to connect disparate reaction and flow timescales, enabling the simulations to achieve realistic deactivation timescales on the order of minutes while the flow time-scales for small particles (100 microns) are several milliseconds. We also introduce a flexible automated python script that writes the necessary files to construct a Mesoflow simulation from user-created chemical mechanisms. We will also introduce a few new features that are added to Mesoflow such as higher order schemes, implicit chemistry integrators and the ability to run on AMD and NVIDIA graphics-processing-units.

AMReX↗

Dynamic MRI of Grid-Tagged Hyperpolarized Helium-3 for the Assessment of Lung Motion During Breathing

Purpose: To develop a dynamic magnetic resonance imaging (MRI) tagging technique using hyperpolarized helium-3 (HP He-3) to track lung motion. Methods and Materials: An accelerated non-Cartesian k-space trajectory was used to gain acquisition speed, at the cost of introducing image artifacts, providing a viable strategy for obtaining whole-lung coverage with adequate temporal resolution. Multiple-slice two-dimensional dynamic images of the lung were obtained in three healthy subjects after inhaling He-3 gas polarized to 35%-40%. Displacement, strain, and ventilation maps were computed from the observed motion of the grid peaks. Results: Both temporal and spatial variations of pulmonary mechanics were observed in normal subjects, including shear motion between different lobes of the same lung. Conclusion: These initial results suggest that dynamic imaging of grid-tagged hyperpolarized magnetization may potentially be a powerful tool for observing and quantifying pulmonary biomechanics on a regional basis and for assessing, validating, and improving lung deformable image registration algorithms.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Hybrid parallel code acceleration methods in full-core reactor physics calculations

When dealing with nuclear reactor calculation schemes, the need for three dimensional (3D) transport-based reference solutions is essential for both validation and optimization purposes. Considering a benchmark problem, this work investigates the potential of discrete ordinates (Sn) transport methods applied to 3D pressurized water reactor (PWR) full-core calculations. First, the benchmark problem is described. It involves a pin-by-pin description of a 3D PWR first core, and uses a 8-group cross-section library prepared with the DRAGON cell code. Then, a convergence analysis is performed using the PENTRAN parallel Sn Cartesian code. It discusses the spatial refinement and the associated angular quadrature required to properly describe the problem physics. It also shows that initializing the Sn solution with the EDF SPN solver COCAGNE reduces the number of iterations required to converge by nearly a factor of 6. Using a best estimate model, PENTRAN results are then compared to multigroup Monte Carlo results obtained with the MCNP5 code. Good consistency is observed between the two methods (Sn and Monte Carlo), with discrepancies that are less than 25 pcm for the k{sub eff}, and less than 2.1% and 1.6% for the flux at the pin-cell level and for the pin-power distribution, respectively. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Fast mix table construction for material discretization

An effective hybrid Monte Carlo-deterministic implementation typically requires the approximation of a continuous geometry description with a discretized piecewise-constant material field. The inherent geometry discretization error can be reduced somewhat by using material mixing, where multiple materials inside a discrete mesh voxel are homogenized. Material mixing requires the construction of a 'mix table,' which stores the volume fractions in every mixture so that multiple voxels with similar compositions can reference the same mixture. Mix table construction is a potentially expensive serial operation for large problems with many materials and voxels. We formulate an efficient algorithm to construct a sparse mix table in O(number of voxels x log number of mixtures) time. The new algorithm is implemented in ADVANTG and used to discretize continuous geometries onto a structured Cartesian grid. When applied to an end-of-life MCNP model of the High Flux Isotope Reactor with 270 distinct materials, the new method improves the material mixing time by a factor of 100 compared to a naive mix table implementation. (authors)

97 MATHEMATICS AND COMPUTING↗

Temperature-extrapolation method for Implicit Monte Carlo - Radiation hydrodynamics calculations

We present a method for implementing temperature extrapolation in Implicit Monte Carlo solutions to radiation hydrodynamics problems. The method is based on a BDF-2 type integration to estimate a change in material temperature over a time step. We present results for radiation only problems in an infinite medium and for a 2-D Cartesian hohlraum problem. Additionally, radiation hydrodynamics simulations are presented for an RZ hohlraum problem and a related 3D problem. Our results indicate that improvements in noise and general behavior are possible. We present considerations for future investigations and implementations. (authors)

97 MATHEMATICS AND COMPUTING↗

Provably optimal parallel transport sweeps on regular grids

We have found provably optimal algorithms for full-domain discrete-ordinate transport sweeps on regular grids in 3D Cartesian geometry. We describe these algorithms and sketch a 'proof that they always execute the full eight-octant sweep in the minimum possible number of stages for a given P{sub x} x P{sub y} x P{sub z} partitioning. Computational results demonstrate that our optimal scheduling algorithms execute sweeps in the minimum possible stage count. Observed parallel efficiencies agree well with our performance model. An older version of our PDT transport code achieves almost 80% parallel efficiency on 131,072 cores, on a weak-scaling problem with only one energy group, 80 directions, and 4096 cells/core. A newer version is less efficient at present-we are still improving its implementation - but achieves almost 60% parallel efficiency on 393,216 cores. These results conclusively demonstrate that sweeps can perform with high efficiency on core counts approaching 10{sup 6}. (authors)

97 MATHEMATICS AND COMPUTING↗

Verification of the pin power reconstruction method in NESTLE

NESTLE is a 3D nodal core simulator that solves the few group neutron diffusion equation using the nodal expansion method (NEM) for the steady state (eigenvalue or fixed-source), adjoint (eigenvalue), and transient (eigenvalue or fixed-source) problems. NESTLE has been in use for over 25 years and has been continuously improved and developed. NESTLE can be used to model either Cartesian geometries (for use with typical PWR, BWR fuel assemblies) or hexagonal geometries (for use with VVER and other triangularly pitched fuel assemblies). As part of NESTLE's ongoing verification and validation process, several computational comparisons have been made to quantify the discrepancies in NESTLE's hexagonal pin power reconstruction method. In this paper, we present the results of these code-to-code comparisons and find that the root mean squared (RMS) error in pin power is comparable to other nodal codes.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

CASL COBRA-TF improvements for PWR DNB analysis

COBRA-TF (CTF) is a thermal hydraulic (T/H) subchannel code using either three-dimensional (3D) Cartesian or subchannel coordinate formulations for two-phase fluid flow and heat transfer solutions. CTF has been improved under the Consortium for Advanced Simulation of Light Water Reactors (CASL) program for Pressurized Water Reactor (PWR) applications, including software optimization, new closure models, pre- and post-processing and parallelization for modeling full reactor core T/H responses under normal operating and accident conditions. As a result of collaboration among CASL partners including the Westinghouse Electric Company, the Oak Ridge National Laboratory (ORNL), and the Sandia National Laboratories, additional modeling improvements were made to CTF specifically for PWR Departure from Nucleate Boiling (DNB) analysis, including a code option to evaluate fuel thermal margin in terms of DNB Ratio (DNBR) and an axial shape factor to account for effect of non-uniform axial power distribution on DNB. Multiple DNB correlations are now linked with CTF for different applications, including the Westinghouse proprietary WRB-1 correlation for fuel designs containing mixing vane grid spacers. The improved CTF code with the WRB-1 correlation (CTF/WRB-1) was validated using the DNB data from the PWR Subchannel Bundle Tests (PSBT). In addition to the comparison with the test data, the CTF/WRB-1 DNBR results and the associated local fluid conditions were compared to the results of the Westinghouse T/H design code, VIPRE-W, which is an enhanced version of the VIPRE-01 code originally developed by the Electric Power Research Institute (EPRI). The comparisons showed that CTF/WRB-1 DNBR predictions are in good agreement with the VIPRE-W results within the applicable range of the DNB correlation. A model sensitivity study was performed to confirm that the CTF void drift model had an insignificant effect on DNBR under the steam line break (SLB) low pressure condition. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting

MOOSE's radiation transport module Rattlesnake comprises a first order S N solver that can be accelerated with a flexible Nonlinear Diffusion Acceleration. At each NDA iteration, the streaming and collision operator of the S{sub N} equations are (approximately) inverted using a transport sweep. When executed on multiple processors parallel block Jacobi (PBJ) splitting is utilized lagging the processor sub-domain's incoming angular fluxes making the implemented method asynchronous, i.e. the convergence properties of NDA become dependent on the number of concurrent tasks and details of the partitioning. Within this work, we study the NDA convergence properties for the two-dimensional C5G7 benchmark problem PBJ with p = 1, 2, 4, 8, 12, 16, 24, 32, 48, 60, 72, 96 and 144 concurrent tasks. Rosa studied the convergence properties of PBJ splitting methods with and without transport synthetic acceleration (TSA) in slab geometry and two-dimensional Cartesian geometry, respectively. Rosa's iteration scheme lags both the incoming angular fluxes and the scattering source making it very similar to the method described here. Rosa found by means of Fourier analysis that convergence of unaccelerated PBJ can degrade for optically thin subdomains, i.e. for a large number of processors given a fixed domain size. Depending on the choice of parameters application of TSA can lead to an effective algorithm. In contrast to Rosa's work, this work focuses on PBJ splitting for NDA accelerated solution of the multigroup eigenvalue problem. Later, Zerr and Anistratov used their integral transport matrix method in conjunction with PBJ. This iteration scheme is different as it does not lag the scattering source. Nevertheless, Fourier analysis with Diamond Difference spatial discretization showed that the method degrades with increasing the overall size of the spatial domain while keeping the sub-domain size constant. In the case of an infinite medium, the observed spectral radius becomes unity. These references establish the iterative performance of PBJ for one-group fixed source problems discretized on rectangular cells, but for the Rattlesnake first order NDA method, an emphasis lies on multigroup eigenvalue problems. In this setting, the additional complication arises that the low order equations are not exactly inverted, but only to some iterative criterion. Further, as the low order problem is solved using Jacobian-Free Newton Krylov methods, a suitable preconditioner for the GMRES iterations is required. As the effectiveness of the preconditioners may decrease when more concurrent processes are used, we expect the low order solve to impact the overall effectiveness of the NDA method in parallel execution as well. Therefore, this work focuses on the question of how detrimental the asynchronicity of the high and low order iterative solutions is for the effectiveness of NDA solutions of realistic, unstructured grid, multigroup eigenvalue problems. The iterative convergence properties of Rattlesnake's NDA method for multigroup eigenvalue problems are studied for varying number of concurrent processes. Rattlesnake's NDA method is asynchronous because the high order transport sweep uses PBJ splitting and because the low order solve's preconditioners, algebraic multigrid and additive Schwarz, are asynchronous. We found that up to 144 processes the number of Picard iterations increases by a factor of 2-3 affecting but not destroying NDA's parallel performance for the C5G7 benchmark problem, a representative LWR (light water reactor) configuration. The solution of the NDA low order eigenvalue problem posed greater problems than expected for the solvers currently available in Rattlesnake mainly because of problems to effectively precondition the modified low-order problem. As a matter of fact, the low order problem becomes an advection-diffusion problem. Non-robustness was observed for the AMG preconditioned coarse mesh acceleration for more than 60 concurrent processes, which was fixed by increasing the number of permissible V-cycles per AMG call. For fine mesh acceleration AMG proved to be ineffective and we resorted to ASM. For both AMG and ASM, increasing number of linear iterations per nonlinear are observed when increasing the number of processes, but for ASM this problem appears to be worse. The results from this work also indicate that initial development efforts should be diverted from implementation of a high-order parallel sweeping algorithm to the effective and robust iterative solution of the low order NDA multigroup eigenvalue problem. (authors)

97 MATHEMATICS AND COMPUTING↗

Performance Assessment for Closure of the Calcined Solids Storage Facility at the INL Site - 19289

The Calcined Solids Storage Facility is composed of six discrete stainless steel 'bin sets' at the Idaho Nuclear Technology and Engineering Center at the INL Site. Approximately 4,440 m{sup 3} of the dry, granular calcine waste is stored in the facility. Closure of the facility will entail removal of the calcine waste followed by grouting. A 5-cm thick residual amount of calcine was assumed to remain at the bottom of the bins. Important radionuclides in the residual layer for the groundwater pathway were identified as the fission and activation products Tc-99, Se-79, I-129, Cs-135, H-3, and actinides Pu-239, and Pu-240. The stainless-steel bins prevent near-term release of grouted residual calcine waste to the environment. Future releases were conservatively based on the corrosion rate of the weld seams on the stainless-steel bins, which site-specific studies measured mean tunnel corrosion rates of 0.0132 mm/yr with a coefficient of variation of 0.333. Based on tunnel corrosion rates, mean bin hydrologic containment times were estimated to be between 238 years and 1,191 years, depending on the thickness of the bin. Any breach in the weld seam was assumed to result in water flow and radionuclide leaching through the bin. The structural integrity of the bin was assumed to be controlled by the general stainless-steel corrosion rate, which was much slower (3.5 x 10{sup -5} mm/yr), resulting in structural integrity times between 24,000 years to over 100,000 years. A mixing-cell model was used to compute water flow and transport through the hydrologically failed bins and the vadose zone. Credit was taken for the geochemical properties of the grout used to fill the bins at closure, which significantly slows the releases from the bins for key radionuclides like Tc-99. A semi-analytical model for three-dimensional dissolved-phase transport in an aquifer of constant unidirectional flow, infinite length and width, and finite thickness was used to compute concentrations in the aquifer across the model domain for a time varying source. Cumulative impacts from all bin sets were calculated by summation across the bin set sources that were superimposed on a uniform Cartesian grid. Effective doses were calculated for direct groundwater ingestion from wells located 100-m downgradient from each of the bin sets and ingestion of meat, milk, and vegetables irrigated with water derived from the well. Intruder doses were based on a well drilled through the grouted waste and cuttings spread around a home site after a 500-year institutional control period. Peak doses during the 1,000-year compliance period were less than 5% of the 250 μSv/yr (25 mrem/yr) performance objective and intruder doses were generally less 5% of the of the 5000 μSv/yr (500 mrem) and 1000 μSv/yr (100 mrem) performance objective for acute and chronic intruder exposure, respectively. Groundwater concentrations were all less than the maximum contaminant limits. In all cases, doses were highest for the oldest bin set because, compared to the other bin sets, it had the highest radionuclide concentrations in the calcine waste. The performance assessment results indicate that performance objectives can be met leaving considerably more than 5-cm of residual calcine waste in the bin sets. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Flexible Spatial Partitions in MPACT Through Module-Based Data Passing

As part of the Consortium for Advanced Simulation of Light Water Reactors (CASL), the Virtual Environment for Reactor Applications (VERA) is being developed to provide high-fidelity multiphysics simulations of nuclear reactor cores. The MPACT code being developed collaboratively by Oak Ridge National Laboratory and the University of Michigan is the primary deterministic neutron transport solver available within VERA. MPACT employs the 2D/1D method to solve 3D problems using 2D method of characteristics (MOC) radial transport solvers with 1D nodal expansion method-based P3 (NEM-P3) axial transport solvers, which are coupled using axial and radial transverse leakages. A 3D coarse mesh finite difference (CMFD) solver is used to provide accelerated convergence and stability. Quarter-core problems in MPACT are typically run on moderately sized clusters ({approx}500-10,000 cores). As such, it relies heavily on spatial decomposition, both radially and axially, using MPI data communication along spatial domain boundaries to pass angular flux boundary condition and neighboring data. The initial spatial decomposition strategy implemented into MPACT overlaid a Cartesian grid over the core to form the domain boundaries. With this approach, a single buffer spanning across the entire boundary between two spatial domains is passed to a domain's neighbor. Additionally, only one neighboring domain index was allowed in each direction. For example, the entire eastern boundary of a domain must be the entire western boundary of the corresponding neighbour's domain. This implementation helped to execute cases on several thousand cores, where substantial radial decomposition was used. The default for several years was to use assembly decomposition, which yielded 73 radial partitions in the Watts Bar Unit 1 (WBN1) models being analyzed. However, as CASL formed stronger connections with industry partners, there was a strong push to allow MPACT to run on fewer cores, preferably in the 500-1,000 core range. Such cases require much less radial decomposition, typically with 8-16 radial domains on each plane. Unfortunately, the previous decomposition strategy is very limited in its ability to yield well-balanced domains, and it does not permit partitions with an arbitrary number of domains, particularly with small numbers of radial domains (3, 5, 7, 11, 13, etc.). With these limitations, a more flexible approach that provided more even-load balancing was needed. The details of this new strategy are outlined here, along with insights to its advantages. The examples provided are for the WBN1 core, which has been the focus of several initial CASL analyses. It is worth noting that spatial decomposition strategies have been employed in many codes with focus on a number of different transport methodologies. The references cited are not exhaustive as this has been very important research topic across many areas.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Generalization of NESTLE into a Multi-Energy N-Group Formulation

The NESTLE code is a few-group, diffusion-based core simulation code that employs the Nodal Expansion Method (NEM). NESTLE has the capability to solve both steady-state and transient problems, using either Cartesian or hexagonal geometry, and to apply thermal-hydraulic feedback including single and two-phase flow. A modern version of the NESTLE nodal-diffusion simulator is currently maintained and developed at the University of Tennessee. The original version of the code was limited to only two or four neutron energy groups, therefore, this article describes recent work carried out to expand NESTLE into a general multi-group solver. Generalization of a fixed group finite-difference diffusion theory into arbitrary N groups is a well-known problem [3], however, this paper describes the intricacies associated with the generalization of the Nodal Expansion Method, and the methodical and computational challenges encountered and managed along the way.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Verification of AZTRAN v1.2 code with a PWR-MOX benchmark problem

The AZTLAN platform project is an effort focused on developing a modeling Mexican platform to design and analyze nuclear reactors. It is a national initiative lead by the National Institute of Nuclear Research (ININ), in collaboration with the main Mexico's public universities: the National Polytechnic Institute (IPN), the National Autonomous University of Mexico (UNAM) and the Autonomous Metropolitan University (UAM). The AZTRAN code is a module of AZTLAN that solves the 3D neutron transport equation using the discrete ordinates (SN) method and the nodal scheme RTN-0 on steady state and Cartesian geometry. AZTRAN works with cross sections generated externally by other code. It provides a solution to the eigenvalue problem and determine the neutron distribution for a specific medium at desired conditions. On the other hand, it is important to mention that the Working Group 4 (users group) of AZTLAN platform is responsible of verify and validate the codes development, in order to give feedback to the group of developers: neutronics and thermal-hydraulics. In this work, the AZTRAN v1.2 performance was studied for a PWR-MOX lattice, using as example the Yamamoto's benchmark for LWR fuels, comparing AZTRAN v1.2 results again those obtained with the well-known neutronic code SERPENT-2 (v1.27), and some results from an article presented at PHYSOR-2002. Results from AZTRAN for a BWR fuel lattice is presented in a companion paper in this meeting.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Adjoint-enabled multidimensional optimization of satellite electron/proton shields - 25452

The design of satellites usually includes the objective of minimizing mass due to high launch costs, which is complicated by the need to protect sensitive electronics from the space radiation environment. There is growing interest in automated design optimization techniques to help achieve that objective. Traditional optimization approaches that rely exclusively on response functions (e.g. dose calculations) can be quite expensive when applied to transport problems. Previously we showed how adjoint-based transport sensitivities used in conjunction with gradient-based optimization algorithms can be quite effective in designing mass-efficient electron/proton shields in one-dimensional slab geometries. In this paper we extend that work to two-dimensional Cartesian geometries. This consists primarily of deriving the sensitivities to geometric changes, given a particular prescription for parameterizing the shield geometry. We incorporate these sensitivities into our optimization process and demonstrate their effectiveness in such design calculations. (authors)

42 ENGINEERING↗

Flattening of fuel importance for heterogeneous system to estimate maximal multiplication factor - 14595

In order to quantify risks of re-criticality incidents associated with loss of coolant accidents (LOCA), the maximum reactivity insertion by relocation of damaged fuel should be quantified. As the first step for the quantification, an automated search scheme is studied for an optimal geometry of damaged fuel in the coolant channel where the neutron multiplication factor k{sub eff} takes a maximal value. The scheme is based on the flattening of the fuel importance. The importance can be recognized as the substitution reactivity from fuel to water in heterogeneous systems. The flattening is achieved by substitution of water and the fuel so as to raise the k{sub eff} referring the local substitution reactivities. To calculate the reactivities efficiently, the first order perturbation scheme is adopted. In the scheme, the adjoint flux is calculated with the PARTISN code. The multi group constants used for the calculation and the perturbed reaction rates are estimated with the continuous energy Monte Carlo code MCNP-5. The proposed methods are tested for a quarter pin cell model that is constructed using Cartesian mesh. From a random distribution of a given amount of fragmented fuel, an optimal geometry is found where the fragmented fuels are aggregated. The multiplication factor in the geometry is greater than that in the original random distribution by 1.4%Δk/k. That indicates the significance of this study. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Physics demonstration and verification of MOOSE framework reactor module meshing capabilities

The recently developed Reactor module in the open-source MOOSE framework includes finite element meshing capabilities for analysis of common reactor geometries. Capabilities in the Reactor module have been employed to generate meshes for physics applications including a sodium-cooled fast reactor core analysis using Griffin, a fast reactor assembly thermal deformation analysis using MOOSE Tensor Mechanics, and a heat-pipe cooled microreactor coupled analysis using Griffin, Bison, and Sockeye. The process to build these meshes using MOOSE's meshing capabilities is described. Physics simulation results using MOOSE-based meshes have been verified to match results which leverage external meshing software such as Cubit or Argonne's Mesh Tools. MOOSE's Reactor module provides significant advantages compared to the use of external meshing tools when analyzing Cartesian and hexagonal reactor lattices using MOOSE-based applications: accessibility to the end user, low barrier to entry for new users, speed of mesh generation, volume preservation of meshed fuel pins, and simplification of analysis workflow when using MOOSE applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗