Search NASA⌕ Search

SEARCH · Search NASA

Results for “benchmark problem”

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 613 records · Page 34

Modeling and simulation challenges for softgoods in space deployable structures

This paper examines modeling and simulation challenges for deployable spacecraft structures with softgood components. Previous studies highlighted the numerical challenges due to the mixture of high stiffness and low stiffness contact in this class of structures. This paper examines the use of the commercial LS-DYNA nonlinear finite element code on a set of relevant benchmark problems.

Mobrem, Mehran↗

Optimized Combined Compact Differencing Methods for Computational Aeroacoustics

The sixth order Combined Compact Differencing (CCD) scheme of Chu and Fan is optimized, resulting in exceptional performance. Results indicate that the best of these optimized schemes can accurately propagate linear simple harmonic waves with fewer than three points per wavelength, while using a three point differencing stencil. Stable and accurate boundary treatments for these schemes are given, and the performance of these schemes is assessed using a benchmark problem.

Computational Aeroacoustics↗

Looking to the Future: A Call to Action for Advanced GNC Algorithm Verification and Validation

Future space systems will rely on autonomous Guidance, Navigation, and Control (GNC) functions to efficiently manage safe and precise self-directed operations in uncertain complex environments. Fundamentally, the GNC system plays a key role in mission performance and safety because it computes the ideal trajectory (Guidance), determines the actual trajectory (Navigation), and executes the ideal trajectory (Control) of a vehicle’s position and attitude. Our current GNC systems are highly automated and already have a high degree of complexity. As missions become more ambitious, GNC systems for launch vehicles and space platforms (e.g., spacecraft, probes, and landers) will require higher levels of performance and autonomous operation than previously encountered, for example, this includes GNC for optimizing aerodynamic and/or propulsion performance during planetary entry. This GNC Verification and Validation (V&V) paper highlights concerns with what undoubtedly will be a trend towards increased complexity as fully autonomous GNC systems are developed for future space missions. Clearly, complex GNC systems pose challenges in the prelaunch V&V phase, which is a relatively expensive part of a mission’s life cycle. Essentially the V&V phase is focused on checking that the system effectively meets all the design and operational requirements for the mission. The authors of this paper (i.e., the Inter-Agency Working Group of GNC subject matter experts) focused on this fundamental question over the past few years: Will the GNC engineering community of practice be sufficiently prepared to perform the necessary V&V on evolving GNC architectures that are driven by very demanding requirements for autonomy, resiliency, reconfigurability, adaptability, and mission cost-benefit balance? It is the viewpoint of our Inter-Agency team that the GNC V&V approaches and processes needed to address the next generation of complex GNC systems, which likely will employ various forms of modern GNC technology, are not currently established to the level the community will need in the future. While researchers and practitioners have made some progress in developing new GNC V&V methods for modern GNC systems, a good deal of work remains to be done to codify such methods in a comprehensive and systematic manner. Thus, the Inter-Agency team’s partner organizations [the National Aeronautics and Space Administration (NASA), the European Space Agency (ESA), the National Centre for Space Studies (CNES), the German Aerospace Center (DLR), the French Aerospace Lab (ONERA), and ISAE-SUPAERO] have conducted preliminary investigations into advancing GNC V&V techniques, which resulted in the identification of the need for education, new V&V tools, and benchmark problems for the GNC community. The necessary proactive steps to be taken to meet the challenges and fill the gaps in GNC V&V are summarized in this paper. The first steps include identifying advanced analysis tools, developing a GNC V&V roadmap, and expanding education and training programs for GNC practitioners. This paper is a call to action and proposes a comprehensive set of recommended actions for all our stakeholders: space agencies, researchers, and industry.

Samir Bennani↗

Extended Forward Sensitivity Analysis for Uncertainty Quantification

This paper presents the extended forward sensitivity analysis as a method to help uncertainty qualification. By including time step and potentially spatial step as special sensitivity parameters, the forward sensitivity method is extended as one method to quantify numerical errors. Note that by integrating local truncation errors over the whole system through the forward sensitivity analysis process, the generated time step and spatial step sensitivity information reflect global numerical errors. The discretization errors can be systematically compared against uncertainties due to other physical parameters. This extension makes the forward sensitivity method a much more powerful tool to help uncertainty qualification. By knowing the relative sensitivity of time and space steps with other interested physical parameters, the simulation is allowed to run at optimized time and space steps without affecting the confidence of the physical parameter sensitivity results. The time and space steps forward sensitivity analysis method can also replace the traditional time step and grid convergence study with much less computational cost. Two well-defined benchmark problems with manufactured solutions are utilized to demonstrate the method.

99 GENERAL AND MISCELLANEOUS↗

SCORPIO: A Scalable Two-Phase Parallel I/O Library With Application To A Large Scale Subsurface Simulator

Inefficient parallel I/O is known to be a major bottleneck among scientific applications employed on supercomputers as the number of processor cores grows into the thousands. Our prior experience indicated that parallel I/O libraries such as HDF5 that rely on MPI-IO do not scale well beyond 10K processor cores, especially on parallel file systems (like Lustre) with single point of resource contention. Our previous optimization efforts for a massively parallel multi-phase and multi-component subsurface simulator (PFLOTRAN) led to a two-phase I/O approach at the application level where a set of designated processes participate in the I/O process by splitting the I/O operation into a communication phase and a disk I/O phase. The designated I/O processes are created by splitting the MPI global communicator into multiple sub-communicators. The root process in each sub-communicator is responsible for performing the I/O operations for the entire group and then distributing the data to rest of the group. This approach resulted in over 25X speedup in HDF I/O read performance and 3X speedup in write performance for PFLOTRAN at over 100K processor cores on the ORNL Jaguar supercomputer. This research describes the design and development of a general purpose parallel I/O library, SCORPIO (SCalable block-ORiented Parallel I/O) that incorporates our optimized two-phase I/O approach. The library provides a simplified higher level abstraction to the user, sitting atop existing parallel I/O libraries (such as HDF5) and implements optimized I/O access patterns that can scale on larger number of processors. Performance results with standard benchmark problems and PFLOTRAN indicate that our library is able to maintain the same speedups as before with the added flexibility of being applicable to a wider range of I/O intensive applications.

High Performance Computing↗

Temperature Effects of Resonance Scattering for Epithermal Neutrons in MCNP

Epithermal neutron elastic scattering can be significantly affected by the thermal motion of target nuclides. Since the 1950s continuous-energy Monte Carlo codes have generally accounted for the target motion using a free gas scattering model, with the assumption that the scattering cross section is constant in energy. Recent work has shown the importance of resonance scattering, and several methods for an improved free-gas treatment have been developed. We have implemented a rejection-based sampling scheme in the MCNP free-gas treatment to account for cross-section variation. The modified MCNP code was used to investigate a number of practical concerns: results for an LWR Doppler defect benchmark; computational costs; and energy limits for the free gas treatment. Additionally, the impact on a suite of ICSBEP criticality benchmark problems (at room temperature) was determined to be negligible, an important result since such problems are used extensively in testing and evaluating revisions to ENDFIB-VII nuclear data.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Coupled Neutronics Thermal-Hydraulic Solution of a Full-Core PWR Using VERA-CS

The Consortium for Advanced Simulation of Light Water Reactors (CASL) is developing a core simulator called VERA-CS to model operating PWR reactors with high resolution. This paper describes how the development of VERA-CS is being driven by a set of progression benchmark problems that specify the delivery of useful capability in discrete steps. As part of this development, this paper will describe the current capability of VERA-CS to perform a multiphysics simulation of an operating PWR at Hot Full Power (HFP) conditions using a set of existing computer codes coupled together in a novel method. Results for several single-assembly cases are shown that demonstrate coupling for different boron concentrations and power levels. Finally, high-resolution results are shown for a full-core PWR reactor modeled in quarter-symmetry.

Core Simulator↗

ACCELERATING FUSION REACTOR NEUTRONICS MODELING BY AUTOMATIC COUPLING OF HYBRID MONTE CARLO/DETERMINISTIC TRANSPORT ON CAD GEOMETRY

Detailed radiation transport calculations are necessary for many aspects of the design of fusion energy systems (FES) such as ensuring occupational safety, assessing the activation of system components for waste disposal, and maintaining cryogenic temperatures within superconducting magnets. Hybrid Monte Carlo (MC)/deterministic techniques are necessary for this analysis because FES are large, heavily shielded, and contain streaming paths that can only be resolved with MC. The tremendous complexity of FES necessitates the use of CAD geometry for design and analysis. Previous ITER analysis has required the translation of CAD geometry to MCNP5 form in order to use the AutomateD VAriaNce reducTion Generator (ADVANTG) for hybrid MC/deterministic transport. In this work, ADVANTG was modified to support CAD geometry, allowing hybrid (MC)/deterministic transport to be done automatically and eliminating the need for this translation step. This was done by adding a new ray tracing routine to ADVANTG for CAD geometries using the Direct Accelerated Geometry Monte Carlo (DAGMC) software library. This new capability is demonstrated with a prompt dose rate calculation for an ITER computational benchmark problem using both the Consistent Adjoint Driven Importance Sampling (CADIS) method an the Forward Weighted (FW)-CADIS method. The variance reduction parameters produced by ADVANTG are shown to be the same using CAD geometry and standard MCNP5 geometry. Significant speedups were observed for both neutrons (as high as a factor of 7.1) and photons (as high as a factor of 59.6).

Biondo, Elliott D↗

A FLEXIBLE NONLINEAR DIFFUSION ACCELERATION METHOD FOR THE FIRST ORDER EIGENVALUE SN EQUATIONS DISCRETIZED WITH DISCONTINUOUS FEM

This work describes a Nonlinear Diffusion Acceleration (NDA) method for the first order SN equations that discretizes both the transport equation and the associated diffusion system using discontinuous finite elements; the diffusion system is solved on a potentially coarser mesh and with a coarser energy group structure than the SN equations. The developed method differs from current methods by allowing the SN and diffusion system to be discretized with arbitrary FEM bases and by using an additive update of the SN system. The benefit of this capability is extension of the stability region to optically thicker mesh cells and stability without the necessity to underrelax the iterative algorithm. The presented method introduces the notion of consistency of the SN and diffusion solutions and derives suitable definitions of the cross sections, drift vectors, and element face closures. The NDA equations are solved using a Picard iteration scheme. Numerical results are presented for the C5G7 benchmark problem highlighting the effectiveness of the methods when deployed with the diffusion system discretized on the same mesh as the SN system. Additional results are presented for cases where the diffusion system features a coarser mesh, coarser energy group structure, or both, demonstrating its stability and effectiveness in these cases. It is observed that the effectiveness of the NDA method reduces when reducing the resolution of the associated diffusion system.

97 MATHEMATICS AND COMPUTING↗

Implementation of Depletion Architecture in the MAMMOTH Reactor Physics Application

Nuclear fuel experiments conducted at the Transient Reactor Test Facility (TREAT) will be analyzed with the MAMMOTH reactor physics application, currently under development at Idaho National Laboratory. MAMMOTH natively couples with the BISON, RELAP-7, and Rattlesnake applications within the MOOSE framework. The methods currently implemented allow for simulating the irradiation of fuel from the beginning of life in a nuclear reactor until it is placed in TREAT for fuel testing using the same finite element mesh throughout the analysis thereby 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. This work focuses on two significant improvements to the MAMMOTH micro-depletion capability. First, the depletion architecture within MAMMOTH is modified to improve the flexibility and speed of burnup calculations. The results of various benchmark tests demonstrate the accuracy of the modified implementation. The second improvement involves the expansion of the data functionality. MAMMOTH can now read the decay data files used by the Oak Ridge Isotope Generation (ORIGEN) code, thus enabling access to data of more than 1,600 isotopes. Comparison of ORIGEN and MAMMOTH for a selected benchmark problem was performed. Both codes yield very similar results, with differences of 0.03% that can be attributed to differences in precision between the two codes. Future work will focus on comparisons between MAMMOTH and ORIGEN for more complex problems.

07 ISOTOPE AND RADIATION SOURCES↗

A prediction interval method for uncertainty quantification of regression models

This paper considers calculation of prediction intervals (PIs) by neural networks (NNs) for quantifying uncertainty in regression tasks, so as to provide fast, accurate and robust emulators to accelerate scientific simulations. We propose a novel method to learn lower and upper bounds of the PI using independent NNs without defining an exclusive loss. Our method requires no distributional assumption, does not introduce extra hyper-parameters, and can effectively identify out-of-distribution samples and quantify their uncertainty. We demonstrate advantages of our method using a benchmark problem and two real-world scientific applications.

Zhang, Pei↗

Sensitivity/Uncertainty Comparison Study: Oak Ridge National Laboratory Results

Various methods and tools have been developed over the years to assist Nuclear Criticality Safety practitioners in determining a safe upper subcritical limit (USL) for an application of interest. The Nuclear Criticality Safety Program has funded a task to compare calculated USL methods developed at three laboratories—Oak Ridge National Laboratory (ORNL), Los Alamos National Laboratory (LANL), and the Institute for Radiological Protection and Nuclear Safety (IRSN)—on a small set of benchmark problems. The purpose of this paper is to present the ORNL results using the Tools for Sensitivity Uncertainty Analysis Methodology Implementation (TSUNAMI) from the SCALE 6.2.3 code suite.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Improved Verification and Validation Testing and Tools including Nuclear Criticality Safety Applications with the MCNP6.3® Code [Abstract]

A new Python-based framework has been developed to enable a more consistent layout with automatable setup, execution, and documentation of all verification and validation (V&V) test suites previously established for use with the MCNP code. In this paper, the new general framework for the V&V test suites is discussed, including information on all of the current capabilities and plans for future capabilities. For nuclear criticality safety applications, the existing V&V benchmark problems within the criticality, extended criticality, and analytic k-effective test suites have been ported into this new framework. In addition, the status and updates to the Rossi-alpha and subcritical multiplicationtest suites will be discussed. Some V&V results exercising new MCNP6.3 capabilities will be demonstrated.

97 MATHEMATICS AND COMPUTING↗

A broad-group cross-section library based on ENDF/B-VII.0 for fast neutron dosimetry Applications

A new ENDF/B-VII.0-based coupled 44-neutron, 20-gamma-ray-group cross-section library was developed to investigate the latest evaluated nuclear data file (ENDF) ,in comparison to ENDF/B-VI.3 used in BUGLE-96, as well as to generate an objective-specific library. The objectives selected for this work consisted of dosimetry calculations for in-vessel and ex-vessel reactor locations, iron atom displacement calculations for reactor internals and pressure vessel, and {sup 58}Ni(n,{gamma}) calculation that is important for gas generation in the baffle plate. The new library was generated based on the contribution and point-wise cross-section-driven (CPXSD) methodology and was applied to one of the most widely used benchmarks, the Oak Ridge National Laboratory Pool Critical Assembly benchmark problem. In addition to the new library, BUGLE-96 and an ENDF/B-VII.0-based coupled 47-neutron, 20-gamma-ray-group cross-section library was generated and used with both SNLRML and IRDF dosimetry cross sections to compute reaction rates. All reaction rates computed by the multigroup libraries are within {+-} 20 % of measurement data and meet the U. S. Nuclear Regulatory Commission acceptance criterion for reactor vessel neutron exposure evaluations specified in Regulatory Guide 1.190. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

GPU-accelerated 3D neutron diffusion code based on finite difference method

Finite difference method, as a traditional numerical solution to neutron diffusion equation, although considered simpler and more precise than the coarse mesh nodal methods, has a bottle neck to be widely applied caused by the huge memory and unendurable computation time it requires. In recent years, the concept of General-Purpose computation on GPUs has provided us with a powerful computational engine for scientific research. In this study, a GPU-Accelerated multi-group 3D neutron diffusion code based on finite difference method was developed. First, a clean-sheet neutron diffusion code (3DFD-CPU) was written in C++ on the CPU architecture, and later ported to GPUs under NVIDIA's CUDA platform (3DFD-GPU). The IAEA 3D PWR benchmark problem was calculated in the numerical test, where three different codes, including the original CPU-based sequential code, the HYPRE (High Performance Pre-conditioners)-based diffusion code and CITATION, were used as counterpoints to test the efficiency and accuracy of the GPU-based program. The results demonstrate both high efficiency and adequate accuracy of the GPU implementation for neutron diffusion equation. A speedup factor of about 46 times was obtained, using NVIDIA's Geforce GTX470 GPU card against a 2.50 GHz Intel Quad Q9300 CPU processor. Compared with the HYPRE-based code performing in parallel on an 8-core tower server, the speedup of about 2 still could be observed. More encouragingly, without any mathematical acceleration technology, the GPU implementation ran about 5 times faster than CITATION which was speeded up by using the SOR method and Chebyshev extrapolation technique. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The method of modular characteristic direction probabilities in MPACT

The method of characteristic direction probabilities (CDP) is based on a modular ray tracing technique which combines the benefits of the collision probability method (CPM) and the method of characteristics (MOC). This past year CDP was implemented in the transport code MPACT for 2-D and 3-D transport calculations. By only coupling the fine mesh regions passed by the characteristic rays in the particular direction, the scale of the probabilities matrix is much smaller compared to the CPM. At the same time, the CDP has the same capacity of dealing with the complicated geometries with the MOC, because the same modular ray tracing techniques are used. Results from the C5G7 benchmark problems are given for different cases to show the accuracy and efficiency of the CDP compared to MOC. For the cases examined, the CDP and MOC methods were seen to differ in k{sub eff} by about 1-20 pcm, and the computational efficiency of the CDP appears to be better than the MOC for some problems. However, in other problems, particularly when the CDP matrices have to be recomputed from changing cross sections, the CDP does not perform as well. This indicates an area of future work. (authors)

97 MATHEMATICS AND COMPUTING↗