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 271 records · Page 15

New modelling capabilities in IDT

This work concerns the enhanced modelling capabilities of the discrete ordinates transport solver IDT. The novelties introduced allow for modelling unstructured geometries composed by a collection of X/Y segments and circles, and the use of reciprocity and conservation relations reduce the memory imprint as well as the computational cost of the method. IDT decomposes geometries in modular Cartesian patterns, which are the so-called Heterogeneous Cartesian Cells (HCCs), containing a chunk of the original unstructured geometries. Each HCC can be then discretized by superimposing a XY grid to refine locally the HCC. Unlike the most popular MOC, IDT performs the spatial sweeping by directional collision probabilities instead of trajectories. The sources and interface angular fluxes are expanded up to linear order. The accuracy of ray-tracing, the memory imprints together with the novel mesh refinement capabilities have been verified. A first set of preliminary results on PWR lattice problems will be presented in this paper.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

AZEuS: AN ADAPTIVE ZONE EULERIAN SCHEME FOR COMPUTATIONAL MAGNETOHYDRODYNAMICS

A new adaptive mesh refinement (AMR) version of the ZEUS-3D astrophysical magnetohydrodynamical fluid code, AZEuS, is described. The AMR module in AZEuS has been completely adapted to the staggered mesh that characterizes the ZEUS family of codes on which scalar quantities are zone-centered and vector components are face-centered. In addition, for applications using static grids, it is necessary to use higher-order interpolations for prolongation to minimize the errors caused by waves crossing from a grid of one resolution to another. Finally, solutions to test problems in one, two, and three dimensions in both Cartesian and spherical coordinates are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A User's Manual for ROTTILT Solver: Tiltrotor Fountain Flow Field Prediction

A CFD solver has been developed to provide the time averaged details of the fountain flow typical for tiltrotor aircraft in hover. This Navier-Stokes solver, designated as ROTTILT, assumes the 3-D fountain flowfield to be steady and incompressible. The theoretical background is described in this manual. In order to enable the rotor trim solution in the presence of tiltrotor aircraft components such as wing, nacelle, and fuselage, the solver is coupled with a set of trim routines which are highly efficient in CPU and suitable for CFD analysis. The Cartesian grid technique utilized provides the user with a unique capability for insertion or elimination of any components of the bodies considered for a given tiltrotor aircraft configuration. The flowfield associated with either a semi or full-span configuration can be computed through user options in the ROTTILT input file. Full details associated with the numerical solution implemented in ROTTILT and assumptions are presented. A description of input surface mesh topology is provided in the appendices along with a listing of all preprocessor programs. Input variable definitions and default values are provided for the V22 aircraft. Limited predicted results using the coupled ROTTILT/WOPWOP program for the V22 in hover are made and compared with measurement. To visualize the V22 aircraft and predictions, a preprocessor graphics program GNU-PLOT3D was used. This program is described and example graphic results presented.

Tadghighi, Hormoz↗

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↗

MAESTRO: AN ADAPTIVE LOW MACH NUMBER HYDRODYNAMICS ALGORITHM FOR STELLAR FLOWS

Many astrophysical phenomena are highly subsonic, requiring specialized numerical methods suitable for long-time integration. In a series of earlier papers we described the development of MAESTRO, a low Mach number stellar hydrodynamics code that can be used to simulate long-time, low-speed flows that would be prohibitively expensive to model using traditional compressible codes. MAESTRO is based on an equation set derived using low Mach number asymptotics; this equation set does not explicitly track acoustic waves and thus allows a significant increase in the time step. MAESTRO is suitable for two- and three-dimensional local atmospheric flows as well as three-dimensional full-star flows. Here, we continue the development of MAESTRO by incorporating adaptive mesh refinement (AMR). The primary difference between MAESTRO and other structured grid AMR approaches for incompressible and low Mach number flows is the presence of the time-dependent base state, whose evolution is coupled to the evolution of the full solution. We also describe how to incorporate the expansion of the base state for full-star flows, which involves a novel mapping technique between the one-dimensional base state and the Cartesian grid, as well as a number of overall improvements to the algorithm. We examine the efficiency and accuracy of our adaptive code, and demonstrate that it is suitable for further study of our initial scientific application, the convective phase of Type Ia supernovae.

79 ASTRONOMY AND ASTROPHYSICS↗

Verification of EvaluateFLux Utility Program

The EvaluateFlux program is a post-processing utility program for DIF3D, specifically DIF3D-VARIANT which handles Cartesian and hexagonal geometries. The EvaluateFlux program was developed to allow users to obtain flux and power traverses through the geometry domain, and its initial purpose was to facilitate foil analysis by evaluating the flux solution from DIF3D-VARIANT and combining it with foil cross section data. The EvaluateFlux program can calculate the neutron flux, as well as the reaction rates, at any user provided evaluation point. It does this by identifying the spatial mesh associated with the evaluation point and then evaluates the polynomial based neutron flux moments stored in the NHFLUX file at that point. The output of EvaluateFlux varies depending on the input setup. The maximum output includes the neutron flux and microscopic and macroscopic reaction rates at each evaluation point. The purpose of this work is to verify the outputs of EvaluateFlux. Simple models that have hand calculatable results are first defined and used to verify the EvaluateFlux outputs. More complex cases are then added where a duplicate program of EvaluateFlux that uses PrintTables outputs of the binary files is used to verify the EvaluateFlux outputs. In those complex cases, hand calculations of selected evaluation points were also displayed to confirm the software verification. For all the tests done, the hand calculations agreed well with those calculated by EvaluateFlux. For the larger complex problems, the duplicate program that can process hundreds of evaluation points was able to identify that zero points within some meshes have large errors. This aspect was attributed to the truncation error on the input provided to the duplicate program and is not a concern for the accuracy of the EvaluateFlux software.

97 MATHEMATICS AND COMPUTING↗

Verification of the EvaluateFlux Utility Program

The EvaluateFlux program is a post-processing utility program for DIF3D, specifically DIF3D-VARIANT which handles Cartesian and hexagonal geometries. The EvaluateFlux program was developed to allow users to obtain flux and power traverses through the geometry domain, and its initial purpose was to facilitate foil analysis by evaluating the flux solution from DIF3D-VARIANT and combining it with foil cross section data. The EvaluateFlux program can calculate the neutron flux, as well as the reaction rates, at any user provided evaluation point. It does this by identifying the spatial mesh associated with the evaluation point and then evaluates the polynomial based neutron flux moments stored in the NHFLUX file at that point. The output of EvaluateFlux varies depending on the input setup. The maximum output includes the neutron flux and microscopic and macroscopic reaction rates at each evaluation point. The purpose of this work is to verify the outputs of EvaluateFlux. Simple models that have hand calculatable results are first defined and used to verify the EvaluateFlux outputs. More complex cases are then added where a duplicate program of EvaluateFlux that uses PrintTables outputs of the binary files is used to verify the EvaluateFlux outputs. In those complex cases, hand calculations of selected evaluation points were also displayed to confirm the software verification. For all the tests done, the hand calculations agreed well with those calculated by EvaluateFlux. For the larger complex problems, the duplicate program that can process hundreds of evaluation points was able to identify that zero points within some meshes have large errors. This aspect was attributed to the truncation error on the input provided to the duplicate program and is not a concern for the accuracy of the EvaluateFlux software.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Block-structured adaptive mesh refinement - theory, implementation and application

Structured adaptive mesh refinement (SAMR) techniques can enable cutting-edge simulations of problems governed by conservation laws. Focusing on the strictly hyperbolic case, these notes explain all algorithmic and mathematical details of a technically relevant implementation tailored for distributed memory computers. An overview of the background of commonly used finite volume discretizations for gas dynamics is included and typical benchmarks to quantify accuracy and performance of the dynamically adaptive code are discussed. Large-scale simulations of shock-induced realistic combustion in non-Cartesian geometry and shock-driven fluid-structure interaction with fully coupled dynamic boundary motion demonstrate the applicability of the discussed techniques for complex scenarios.

99 GENERAL AND MISCELLANEOUS↗

COMPARISON OF THE ACCURACY OF VARIOUS SPATIAL DISCRETIZATION SCHEMES OF THE DISCRETE ORDINATES EQUATIONS IN 2D CARTESIAN GEOMETRY

We present a comprehensive error estimation of four spatial discretization schemes of the two-dimensional Discrete Ordinates (SN) equations on Cartesian grids utilizing a Method of Manufactured Solution (MMS) benchmark suite based on variants of Larsen’s benchmark featuring different orders of smoothness of the underlying exact solution. The considered spatial discretization schemes include the arbitrarily high order transport methods of the nodal (AHOTN) and characteristic (AHOTC) types, the discontinuous Galerkin Finite Element method (DGFEM) and the recently proposed higher order diamond difference method (HODD) of spatial expansion orders 0 through 3. While AHOTN and AHOTC rely on approximate analytical solutions of the transport equation within a mesh cell, DGFEM and HODD utilize a polynomial expansion to mimick the angular flux profile across each mesh cell. Intuitively, due to the higher degree of analyticity, we expect AHOTN and AHOTC to feature superior accuracy compared with DGFEM and HODD, but at the price of potentially longer grind times and numerical instabilities. The latter disadvantages can result from the presence of exponential terms evaluated at the cell optical thickness that arise from the semianalytical solution process. This work quantifies the order of accuracy and the magnitude of the error of all four discretization methods for different optical thicknesses, scattering ratios and degrees of smoothness of the underlying exact solutions in order to verify or contradict the aforementioned intuitive expectation.

99 GENERAL AND MISCELLANEOUS↗

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↗

A Cartesian grid embedded boundary method for solving the Poisson and heat equations with discontinuous coefficients in three dimensions

We present a method for solving Poisson and heat equations with discon- tinuous coefficients in two- and three-dimensions. It uses a Cartesian cut-cell/embedded boundary method to represent the interface between materi- als, as described in Johansen& Colella (1998). Matching conditions across the interface are enforced using an approximation to fluxes at the boundary. Overall second order accuracy is achieved, as indicated by an array of tests using non-trivial interface geometries. Both the elliptic and heat solvers are shown to remain stable and efficient for material coefficient contrasts up to 106, thanks in part to the use of geometric multigrid. A test of accuracy when adaptive mesh refinement capabilities are utilized is also performed. An example problem relevant to nuclear reactor core simulation is presented, demonstrating the ability of the method to solve problems with realistic physical parameters.

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(\text{number of voxels}\times \log \text{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.

Johnson, Seth R↗

A Cartesian grid embedded boundary method for solving the Poisson and heat equations with discontinuous coefficients in three dimensions

We present a method for solving Poisson and heat equations with discontinuous coefficients in two- and three-dimensions. It uses a Cartesian cut-cell/embedded boundary method to represent the interface between materials, as described in Johansen and Colella (1998). Matching conditions across the interface are enforced using an approximation to fluxes at the boundary. Overall second order accuracy is achieved, as indicated by an array of tests using non-trivial interface geometries. Both the elliptic and heat solvers are shown to remain stable and efficient for material coefficient contrasts up to 10{sup 6}, thanks in part to the use of geometric multigrid. A test of accuracy when adaptive mesh refinement capabilities are utilized is also performed. An example problem relevant to nuclear reactor core simulation is presented, demonstrating the ability of the method to solve problems with realistic physical parameters.

97 MATHEMATICS AND COMPUTING↗

Kestrel Results at Liftoff Conditions for a Space Launch System Configuration in Proximity to the Launch Tower

Aerodynamic data books for Space Launch System vehicles require databases for the integrated forces and moments and section loads during liftoff and transition to the ascent phase of flight. While the force and moment database can be generated from wind tunnel results, computational analyses are necessary to provide the extensive surface information required to generate proper lineloads. Of the two flight regimes, the liftoff problem is the more costly and complex situation to simulate, as it requires modeling of the vehicle in proximity to the launch tower. The effects of massive separation on the leeward pressure fields of both the tower and vehicle are not well captured with RANS methods, necessitating the use of more advanced methods, such as Delayed Detached Eddy Simulation, in conjunction with computational grids sufficiently refined to resolve the wakes. Details on the computational setup for employing the Kestrel flow solver to address the liftoff problem are presented. The methodology involves the use of independent unstructured near-body grids for the vehicle and the tower, overset by a solution adaptive Cartesian off-body grid. Results from the simulations are compared to experimental results from a test in the NASA Langley Research Center 14- by 22-Foot Subsonic Tunnel.

Computational fluid dynamics↗

Consistent spatial expansion functions on hexagonal surfaces for use in radiation transport methods

Some of the radiation transport solvers that are based on expansion function methods in hexagonal geometry generally use projection techniques that transform the spatial dependence of the angular flux in hexagonal geometry to Cartesian geometry by mapping and then expanding in terms of expansion functions (e.g., Legendre polynomials). However, this approach usually requires a relatively higherorder expansion in space for accurate representation of the spatial distribution of the flux. To overcome this limitation, a set of consistent spatial expansion functions have been developed in hexagonal geometry in this paper. These functions satisfy the orthogonality condition on hexagonal surfaces and guarantee the conservation of currents after expansion regardless of the truncation order. The latter is an important property for preservation of neutron balance. The new spatial expansion method has been implemented into the coarse mesh radiation transport (COMET) code and tested in both the single assembly and the full core Advanced High Temperature Reactor (AHTR) benchmark problems. The eigenvalues and assembly-averaged and stripe-wise fission density distributions predicted by the new method with 2nd order spatial expansion functions were found to exhibit similar accuracy as those computed by the current mapping method with 4th order spatial expansion functions. This indicates that the angular fluxes in AHTRs can be predominantly represented by a low order expansion if the new spatial expansion functions are used. As a result, to maintain the same accuracy, the computational efficiency of COMET is improved significantly (2–5 times) by using the new spatial expansion method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Accurate Compression of Tabulated Chemistry Models with Partition of Unity Networks

Tabulated chemistry models are widely used to simulate large-scale turbulent fires in applications including energy generation and fire safety. Tabulation via piecewise Cartesian interpolation suffers from the curse-of-dimensionality, leading to a prohibitive exponential growth in parameters and memory usage as more dimensions are considered. Artificial neural networks (ANNs) have attracted attention for constructing surrogates for chemistry models due to their ability to perform high-dimensional approximation. However, due to well-known pathologies regarding the realization of suboptimal local minima during training, in practice they do not converge and provide unreliable accuracy. Partition of unity networks (POUnets) are a recently introduced family of ANNs which preserve notions of convergence while performing high-dimensional approximation, discovering a mesh-free partition of space which may be used to perform optimal polynomial approximation. In this work, we assess their performance with respect to accuracy and model complexity in reconstructing unstructured flamelet data representative of nonadiabatic pool fire models. Our results show that POUnets can provide the desirable accuracy of classical spline-based interpolants with the low memory footprint of traditional ANNs while converging faster to significantly lower errors than ANNs. For example, we observe POUnets obtaining target accuracies in two dimensions with 40 to 50 times less memory and roughly double the compression in three dimensions. We also address the practical matter of efficiently training accurate POUnets by studying convergence over key hyperparameters, the impact of partition/basis formulation, and the sensitivity to initialization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A framework for developing a mimetic tensor artificial viscosity for Lagrangian hydrocodes on arbitrary polygonal and polyhedral meshes (u)

We construct a new mimetic tensor artificial viscosity on general polygonal and polyhedral meshes. The tensor artificial viscosity is based on a mimetic discretization of coordinate invariant operators, divergence of a tensor and gradient of a vector. The focus of this paper is on the symmetric form, div ({mu},{var_epsilon}(u)), of the tensor artificial viscosity where {var_epsilon}(u) is the symmetrized gradient of u and {mu}, is a tensor. The mimetic discretizations of this operator is derived for the case of a full tensor coefficient {mu}, that may reflect a shock direction. We demonstrate performance of the new viscosity for the Noh implosion, Sedov explosion and Saltzman piston problems in both Cartesian and axisymmetric coordinate systems.

99 GENERAL AND MISCELLANEOUS↗

A curvilinear, fully implicit, conservative electromagnetic PIC algorithm in multiple dimensions

Here, we extend a recently proposed fully implicit PIC algorithm for the Vlasov–Darwin model in multiple dimensions (Chen and Chacón (2015) [1]) to curvilinear geometry. As in the Cartesian case, the approach is based on a potential formulation (Φ, A), and overcomes many difficulties of traditional semi-implicit Darwin PIC algorithms. Conservation theorems for local charge and global energy are derived in curvilinear representation, and then enforced discretely by a careful choice of the discretization of field and particle equations. Additionally, the algorithm conserves canonical-momentum in any ignorable direction, and preserves the Coulomb gauge ∇ • A = 0 exactly. An asymptotically well-posed fluid preconditioner allows efficient use of large cell sizes, which are determined by accuracy considerations, not stability, and can be orders of magnitude larger than required in a standard explicit electromagnetic PIC simulation. We demonstrate the accuracy and efficiency properties of the algorithm with numerical experiments in mapped meshes in 1D-3V and 2D-3V.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗