Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cartesian mesh”

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 73 records · Page 4

TaskAMR

TaskAMR is a Cartesian Block Adaptive Mesh Refinement (AMR) code, written using the Regent/Legion parallel programming system, that solves Finite Volume calculations. We provide implementations for linear advection and gas dynamics.

Pietarila, Jonathan↗

An electrostatic Particle-In-Cell code on multi-block structured meshes

We present an electrostatic Particle-In-Cell (PIC) code on multi-block, locally structured, curvilinear meshes called Curvilinear PIC (CPIC). Multi-block meshes are essential to capture complex geometries accurately and with good mesh quality, something that would not be possible with single-block structured meshes that are often used in PIC and for which CPIC was initially developed. In spite of the structured nature of the individual blocks, multi-block meshes resemble unstructured meshes in a global sense and introduce several new challenges, such as the presence of discontinuities in the mesh properties and coordinate orientation changes across adjacent blocks, and polyjunction points where an arbitrary number of blocks meet. In CPIC, these challenges have been met by an approach that features: (1) a curvilinear formulation of the PIC method: each mesh block is mapped from the physical space, where the mesh is curvilinear and arbitrarily distorted, to the logical space, where the mesh is uniform and Cartesian on the unit cube; (2) a mimetic discretization of Poisson's equation suitable for multi-block meshes; and (3) a hybrid (logical-space position/physical-space velocity), asynchronous particle mover that mitigates the performance degradation created by the necessity to track particles as they move across blocks. The numerical accuracy of CPIC was verified using two standard plasma–material interaction tests, which demonstrate good agreement with the corresponding analytic solutions. And compared to PIC codes on unstructured meshes, which have also been used for their flexibility in handling complex geometries but whose performance suffers from issues associated with data locality and indirect data access patterns, PIC codes on multi-block structured meshes may offer the best compromise for capturing complex geometries while also maintaining solution accuracy and computational efficiency.

36 MATERIALS SCIENCE↗

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↗

A cell-local finite difference discretization of the low-order quasidiffusion equations for neutral particle transport on unstructured quadrilateral meshes

We present a quasidiffusion (QD) method for solving neutral particle transport problems in Cartesian XY geometry on unstructured quadrilateral meshes, including local refinement capability. Neutral particle transport problems are central to many applications including nuclear reactor design, radiation safety, astrophysics, medical imaging, radiotherapy, nuclear fuel transport/storage, shielding design, and oil well-logging. The primary development is a new discretization of the low-order QD (LOQD) equations based on cell-local finite differences. The accuracy of the LOQD equations depends on proper calculation of special non-linear QD (Eddington) factors from a transport solution. In order to completely define the new QD method, a proper discretization of the transport problem is also presented. The transport equation is discretized by a conservative method of short characteristics with a novel linear approximation of the scattering source term and monotonic, parabolic representation of the angular flux on incoming faces. Analytic and numerical tests are used to test the accuracy and spatial convergence of the non-linear method. All tests exhibit O(h{sup 2}) convergence of the scalar flux on orthogonal, random, and multi-level meshes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Handing off the outcome of binary neutron star mergers for accurate and long-term postmerger simulations

In this work, we perform binary neutron star (BNS) merger simulations in full dynamical general relativity with IllinoisGRMHD, on a Cartesian grid with adaptive-mesh refinement. After the remnant black hole has become nearly stationary, the evolution of the surrounding accretion disk on Cartesian grids over long timescales (~1s) is suboptimal, as Cartesian coordinates over-resolve the angular coordinates at large distances, and the accreting plasma flows obliquely across coordinate lines dissipating angular momentum artificially from the disk. To address this, we present the HandOff, a set of computational tools that enables the transfer of general relativistic magnetohydrodynamic (GRMHD) and spacetime data from IllinoisGRMHD to harm3d, a GRMHD code that specializes in modeling black hole accretion disks in static spacetimes over long timescales, making use of general coordinate systems with spherical topology. We demonstrate that the handoff allows for a smooth and reliable transition of GRMHD fields and spacetime data, enabling us to efficiently and reliably evolve BNS dynamics well beyond merger. We also discuss future plans, which involve incorporating advanced equations of state and neutrino physics into BNS simulations using the HandOff approach.

79 ASTRONOMY AND ASTROPHYSICS↗

Ameliorating the Courant-Friedrichs-Lewy condition in spherical coordinates: A double FFT filter method for general relativistic MHD in dynamical spacetimes

Numerical simulations of merging compact objects and their remnants form the theoretical foundation for gravitational wave and multimessenger astronomy. While Cartesian-coordinate-based adaptive mesh refinement is commonly used for simulations, spherical-like coordinates are more suitable for nearly spherical remnants and azimuthal flows due to lower numerical dissipation in the evolution of fluid angular momentum, as well as requiring fewer numbers of computational cells. However, the use of spherical coordinates to numerically solve hyperbolic partial differential equations can result in severe Courant-Friedrichs-Lewy (CFL) stability condition time step limitations, which can make simulations prohibitively expensive. This paper addresses this issue for the numerical solution of coupled spacetime and general relativistic magnetohydrodynamics evolutions by introducing a double fast Fourier transform (FFT) filter and implementing it within the fully message passing interface (mpi)-parallelized sphericalnr framework in the einstein toolkit. In conclusion, we demonstrate the effectiveness and robustness of the filtering algorithm by applying it to a number of challenging code tests, and show that it passes these tests effectively, demonstrating convergence while also increasing the time step significantly compared to unfiltered simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Large-eddy simulations of Richtmyer Meshkov instability in a converging geometry

The Richtmyer-Meshkov instability (RMI) refers to the baroclinic generation of vorticity at a perturbed density interface when impacted by a shock wave. It is often thought of as the impulsive limit of the Rayleigh-Taylor instability. While the RMI has been widely covered in planar geometries, the present simulations investigate the mixing of materials resulting from the interaction of an imploding cylindrical shock wave with a concentric interface, perturbed in both axial and azimuthal directions, which separates outside air from SF{sub 6} (initially 5 times denser) confined in a 90{sup o} wedge. Two incident shocks of Mach numbers M{sub i} = 1.3 and 2.0 at initial impact are tested. These canonical simulations support recent work on understanding the compressible turbulent mixing in converging geometries relevant to both inertial confinement fusion and core-collapse supernova dynamics. Initial irregularities in the density interface form the misalignment between density and pressure gradients required to initiate a first RMI. A second RMI occurs after the initial shock has converged down the wedge, reflected off the axis and reshocks the distorted interface. Reshock interactions of decreasing intensity follow successively. Due to the converging geometry, the accelerated or decelerated motion of the interface also generates Rayleigh-Taylor instabilities. Secondary Kelvin-Helmholtz instabilities develop along the sides of the interpenetrating fingering structures. The energetic reshock produces a large dynamical range of turbulent scales, requiring the utilization of large-eddy simulation (LES). We employed the stretched-vortex subgrid-scale model of turbulent and scalar transport based on an explicit structural modeling of small-scale dynamics. The imploding nature of the flow is particularly suitable for the use of adaptive mesh refinement (AMR) provided by the parallel block-structured AMR framework AMROC. The Favre-filtered Navier-Stokes equations are solved on each Cartesian uniform subgrid of the mesh hierarchy. A weighted, essentially nonoscillatory scheme is used to capture discontinuities but reverts to a low-numerical dissipation, explicit, tuned center-difference stencil in the smooth or turbulent flow regions, optimal for the functioning of our explicit LES. The computational domain is discretized with 95 x 95 x 64 cubic cells on the base grid (64 points in the periodic axial direction), with three additional levels of refinement based on the local density gradient, reducing the computational expenses compared to the equivalent finest unigrid 760 x 760 x 512 problem. The interpenetration of the two fluids after the reshock is clearly discernible in Fig. 1. The mixing is visualized by using isosurfaces of the heavy-fluid mass fraction {psi}. The mixture is colored red as {psi} = 0.90, yellow as {psi} = 0.5, and green as {psi} = 0.1. To illustrate the multiscale nature of the turbulent mixing, we observe that the initial perturbation wavelength is 100 times larger than the finest grid size, which is itself about 100 times larger than the estimated smallest physical scale in the flow - the Kolmogorov scale - where the viscous dissipation of energy occurs. Incident shocks of higher Mach number (e.g., M{sub i} = 2.0) focus the flow further towards the axis, leading to a stronger turbulent mixing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A high-order Lagrangian discontinuous Galerkin hydrodynamic method for quadratic cells using a subcell mesh stabilization scheme

We present here a Lagrangian discontinuous Galerkin (DG) hydrodynamic method that is up to third-order accurate using subcell mesh stabilization (SMS) for compressible flows on quadratic meshes in two-dimensional (2D) Cartesian coordinates. Similar to the second-order accurate Lagrangian DG method with linear meshes, the physical evolution equations for the specific volume, velocity, and specific total energy are discretized using a modal DG method with Taylor series polynomials. The Riemann velocity at the vertices of a curvilinear cell, and the corresponding surface forces, are calculated by solving a multidirectional approximate Riemann problem. Curvilinear cells (e.g., quadratic quadrilateral meshes in this work) have many deformational degrees of freedom, and with these cells, they can deform in unphysical ways. Likewise, the Riemann solution at an edge vertex differs from the one at the corner of a cell. With SMS, each quadratic quadrilateral cell is decomposed into four quadrilateral subcells, that move in a Lagrangian manner. The edge vertex is surrounded by four subcells so that it is similar to the vertex at the cell corner. SMS can detect inconsistent density fields between the cell and subcells. The difference between these two density fields is used to correct the stress (pressure) input to the Riemann solver. This SMS scheme enables stable mesh motion and accurate solutions in the context of a Lagrangian high-order DG method that is up to third-order with quadratic cells. We also present effective limiting strategies that ensure monotonicity of the primitive variables with the high-order DG method. This Lagrangian DG hydrodynamic method with SMS conserves mass, momentum, and total energy. A suite of test problems are calculated to demonstrate the designed order of accuracy (up to third-order accurate) of this method, and that the Lagrangian DG method using SMS preserves cylindrical symmetry on 1D radial flow problems with an equal-angle polar quadratic mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical homogenization of concrete microstructures without explicit meshes

Life management of electric hydro or nuclear power plants requires to estimate long-term concrete properties on facilities, for obvious safety and serviceability reasons. Decades-old structures are foreseen to be operational for several more decades. As a large number of different concrete formulations are found in EDF facilities, empirical models based on many experiments cannot be an option for a large fleet of power plant buildings. To build predictive models, homogenization techniques offer an appealing alternative. To properly upscale creep, especially at long term, a rather precise description of the microstructure is required. However, the complexity of the morphology of concrete poses several challenges. In particular, concrete is formulated to maximize the packing density of the granular skeleton, leading to aggregates spanning several length scales with small inter particle spacings. Thus, explicit meshing of realistic concrete microstructures is either out of reach of current meshing algorithms or would produce a number of degrees of freedom far higher than the current generic FEM codes capabilities. This paper proposes a method to deal with complex matrix-inclusions microstructures such as the ones encountered at the mortar or concrete scales, without explicitly meshing them. The microstructure is superimposed to an independent mesh, which is a regular Cartesian grid. This inevitably yields so called 'gray elements', spanning across multiple phases. As the reliability of the estimate of the effective properties highly depends on the behavior affected to these gray elements, special attention is paid to them. As far as the question of the solvers is concerned, generic FEM codes are found to lack efficiency: they cannot reach high enough levels of discretization with classical free meshes, and they do not take advantage of the regular structure of the mesh. Thus, a specific finite differences/finite volumes solver has been developed. At first, generic off-the-shelf linear system solvers were used. To further improve the efficiency in terms of memory requirements, specific variants of the preconditioned conjugate gradient were implemented. This allowed to homogenize the conductivity of a concrete-like microstructure using more than 10{sup 9} degrees of freedom on a rather common hardware for 2010 (a PC embedding 48 GB of RAM). Taking benefit of the properties of the regular Cartesian grid we have also investigated a multi-level method to improve the CPU efficiency of the code.

36 MATERIALS SCIENCE↗

l3d2vtk: An MCNPTools Utility to Enable LNK3DNT File Visualization & Post-Processing

This paper describes recent work to develop and incorporate a utility program into the MCNPTools package that enables LNK3DNT file visualization & post-processing. A LNK3DNT file is a binary Cartesian, cylindrical, or spherical structured mesh file that describes material and material relative density distributions by mesh voxel. This mesh file format is principally used by the PARTISN discrete-ordinates radiation-transport code. However, the MCNP ® Monte Carlo radiation-transport code can use LNK3DNT files to specify geometry, and the MCNP code can produce LNK3DNT files representing a user-defined region of the MCNP constructive solid geometry (CSG). Because of the use of LNK3DNT files as MCNP input and output and with other computer codes, improving the ability to visualize and/or quantitatively post-process LNK3DNT files benefits end users. In particular, it is helpful to visually verify that the material and density distributions are as expected. Also, an analyst can orient viewers with respect to other in formation, e.g., by co-plotting a voxelized representation of MCNP CSG with mesh tally and/or particle track results. However, until now, the only capability to interactively interrogate LNK3DNT files is through a 2-D slice plotter provided by the Monte Carlo Application ToolKit (MCATK), which is not currently distributed outside of Los Alamos National Laboratory. The utility created as part of this work converts LNK3DNT binary files to an ASCII XML-based StructuredMesh VTK (.vts) file. The geometries supported are 1-D spherical and cylindrical ( r ), 1-D Cartesian ( x ), 2-D cylindrical ( r-z and r-θ ) and Cartesian ( x-y ), and 3-D cylindrical ( r-z-θ ) and Cartesian ( x-y-z ). This file format is chosen to minimize external dependencies (e.g., on an HDF5 library) and to provide a file that can be interrogated by the user in a text editor or standard visualization applications (e.g., ParaView or VisIt). However, other file formats may provide more utility such as XDMF, which can use HDF5 and is discussed further as something to explore as future work. This paper is organized as follows: a brief introduc tion to the MCNPTools library and utility programs is given, the LNK3DNT-to-VTK (l3d2vtk) utility functionality is de scribed, and then an example post-processing workflow using the ParaView application is given.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An advanced algorithm for construction of Integral Transport Matrix Method operators using accumulation of single cell coupling factors

The Integral Transport Matrix Method (ITMM) has been shown to be an effective method for solving the neutron transport equation in large domains on massively parallel architectures. In the limit of very large number of processors, the speed of the algorithm, and its suitability for unstructured meshes, i.e. other than an ordered Cartesian grid, is limited by the construction of four matrix operators required for obtaining the solution in each sub-domain. The existing algorithm used for construction of these matrix operators, termed the differential mesh sweep, is computationally expensive and was developed for a structured grid. This work proposes the use of a new algorithm for construction of these operators based on the construction of a single, fundamental matrix representing the transport of a particle along every possible path throughout the sub-domain mesh. Each of the operators is constructed by multiplying an element of this fundamental matrix by two factors dependent only upon the operator being constructed and on properties of the emitting and incident cells. The ITMM matrix operator construction time for the new algorithm is demonstrated to be shorter than the existing algorithm in all tested cases with both isotropic and anisotropic scattering considered. While also being a more efficient algorithm on a structured Cartesian grid, the new algorithm is promising in its geometric robustness and potential for being applied to an unstructured mesh, with the ultimate goal of application to an unstructured tetrahedral mesh on a massively parallel architecture. (authors)

97 MATHEMATICS AND COMPUTING↗

An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.

Most adaptive mesh generation algorithms employ a 3-refinement method. This method, although easy to employ, provides a mesh that is often too coarse in some areas and over refined in other areas. Because this method generates 27 new hexes in place of a single hex, there is little control on mesh density. This paper presents an adaptive all-hexahedral grid-based meshing algorithm that employs a 2-refinement method. 2-refinement is based on dividing the hex to be refined into eight new hexes. This method allows a greater control on mesh density when compared to a 3-refinement procedure. This adaptive all-hexahedral meshing algorithm provides a mesh that is efficient for analysis by providing a high element density in specific locations and a reduced mesh density in other areas. In addition, this tool can be effectively used for inside-out hexahedral grid based schemes, using Cartesian structured grids for the base mesh, which have shown great promise in accommodating automatic all-hexahedral algorithms. This adaptive all-hexahedral grid-based meshing algorithm employs a 2-refinement insertion method. This allows greater control on mesh density when compared to 3-refinement methods. This algorithm uses a two layer transition zone to increase element quality and keeps transitions from lower to higher mesh densities smooth. Templates were introduced to allow both convex and concave refinement.

99 GENERAL AND MISCELLANEOUS↗

Exact signed distance fields using parallel Fast Sweeping Method

Signed distance fields are often used in multiphysics simulations to track material interfaces. We present a simple methodology based on the fast sweeping method to generate the exact signed distance from triangular meshes and linear paths on Cartesian grids. The methodology propagates the closest primitive to the boundary to the rest of the domain following the characteristics. A local upwind criterion is used to decide between the new and existing closest primitive at each grid point while capturing the correct sign of the global function. The methodology has optimal computational complexity and runs efficiently in distributed-memory architectures. We include 2D and 3D test cases along with a resolution study up to 0.512 trillion zones and 1,000 computer cores. The solution strategy can also be applied to other types of meshes or collections of primitives.

97 MATHEMATICS AND COMPUTING↗

MESHMAKER (MM) V1.5

MeshMaker v1.5 is a code that describes the system geometry and discretizes the domain in problems of flow and transport through porous and fractured media that are simulated using the TOUGH+ [Moridis and Pruess, 2014] or TOUGH2 [Pruess et al., 1999; 2012] families of codes. It is a significantly modified and drastically enhanced version of an earlier simpler facility that was embedded in the TOUGH2 codes [Pruess et al., 1999; 2012], from which it could not be separated. The code (MeshMaker.f90) is a stand-alone product written in FORTRAN 95/2003, is written according to the tenets of Object-Oriented Programming, has a modular structure and can perform a number of mesh generation and processing operations. It can generate two-dimensional radially symmetric (r,z) meshes, and one-, two-, and three-dimensional rectilinear (Cartesian) grids in (x,y,z). The code generates the file MESH, which includes all the elements and connections that describe the discretized simulation domain and conforming to the requirements of the TOUGH+ and TOUGH2 codes. Multiple-porosity processing for simulation of flow in naturally fractured reservoirs can be invoked by means of a keyword MINC, which stands for Multiple INteracting Continua. The MINC process operates on the data of the primary (porous medium) mesh as provided on disk file MESH, and generates a secondary mesh containing fracture and matrix elements with identical data formats on file MINC.

MORIDIS, GEORGE↗

mesoflow [SWR-22-56]

Mesoflow is a continuum scale simulation tool developed specifically for modeling transport and chemistry at the mesoscale. Our solver utilizes Cartesian block-structured adaptive mesh refinement to resolve complex surface morphologies (of catalysts/biomass particles among others) directly obtained from X-ray tomography data. An immersed boundary based formulation enables rapid representation of complex geometries prevalent in most mesoporous 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 (GPU) compared to a single processor for representative problem sizes (2 million cell mesh).

Sitaraman, Hariswaran↗

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↗

MOOSE Reactor Module Meshing Enhancements to Support Reactor Physics Analysis

The U.S. Department of Energy Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) program develops an integrated suite of advanced reactor physics tools built upon the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework. Each code generally requires an input finite element mesh on which the physics solution is calculated, reported, and transferred to other physics codes. The meshing process is often burdensome for the complex geometries present in reactors due to lack of easy-to-use, open-source meshing tools. To address the bottleneck associated with meshing complex geometries found in nuclear reactors, NEAMS initiated the development of the MOOSE Reactor Module starting in FY21. The Reactor Module builds off the existing MOOSE Mesh System to include targeted meshing capabilities such as the ability to generate hexagonal pin cells, assemblies with ducts, rotating control drums, cores, peripheral zones around a core, as well as the automatic labeling (“reporting IDs”) of pin, assembly, and planar zones to simplify post-processing of results. As a Physics Module in MOOSE, the Reactor Module is open-source, available with any MOOSE installation, directly compatible with MOOSE-based tools, and can be invoked from MOOSEbased applications to generate meshes. Functionality from the Reactor Module has been applied to several advanced reactor concepts to demonstrate user workflow improvements and accuracy. The primary objective of the Reactor Module is to improve useability of MOOSEbased tools by streamlining mesh generation and output inspection processes. During FY22, the functionality of the Reactor Module (and accompanying Mesh System) has been expanded based on user needs. First, the Reactor Geometry Mesh Builder capability developed primarily in FY21 has been refactored and merged to the public MOOSE repository. This capability wraps underlying Reactor Module mesh generators into a “Pin – Assembly – Core” workflow appropriate for conventional Cartesian and hexagonal geometries, and notably assigns material IDs during mesh generation stage and generates only the minimal number of blocks needed in order to reduce computational burden. Biasing and boundary layer options have been added to the base mesh generators as required by thermal hydraulics solvers. The reporting ID functionality has been expanded to differentiate ring-wise and azimuthal sectors within a pin for use with depletion algorithms, and VectorPostProcessor and Reporter objects are now available to integrate solution variables across zones based on ID combinations. Functionality to trim hexagonal meshes along the center or periphery has been developed so users may leverage symmetry and reflective boundary conditions to reduce the mesh size. A flexible and powerful tool to fill the space between two sidesets has been introduced to the framework and can be used for transition layers such as stitching two assemblies together with different numbers of pins, or for complex geometries which do not follow conventional Cartesian/hexagonal patterns. Finally, additional verification problems were performed with NEAMS physics tools in complement with existing NEAMS work.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗