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 1,639 records · Page 91

Fission Matrix Capability for MCNP Monte Carlo

In a Monte Carlo criticality calculation, before the tallying of quantities can begin, a converged fission source (the fundamental eigenvector of the fission kernel) is required. Tallies of interest may include powers, absorption rates, leakage rates, or the multiplication factor (the fundamental eigenvalue of the fission kernel, k eff ). Just as in the power iteration method of linear algebra, if the dominance ratio (the ratio of the first and zeroth eigenvalues) is high, many iterations of neutron history simulations are required to isolate the fundamental mode of the problem. Optically large systems have large dominance ratios, and systems containing poor neutron communication between regions are also slow to converge. The fission matrix method, implemented into MCNP, addresses these problems.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Reactor Pressure Vessel Fracture Analysis Capabilities in Grizzly

Efforts have been underway to develop fracture mechanics capabilities in the Grizzly code to enable it to be used to perform deterministic fracture assessments of degraded reactor pressure vessels (RPVs). Development in prior years has resulted a capability to calculate -integrals. For this application, these are used to calculate stress intensity factors for cracks to be used in deterministic linear elastic fracture mechanics (LEFM) assessments of fracture in degraded RPVs. The -integral can only be used to evaluate stress intensity factors for axis-aligned flaws because it can only be used to obtain the stress intensity factor for pure Mode I loading. Off-axis flaws will be subjected to mixed-mode loading. For this reason, work has continued to expand the set of fracture mechanics capabilities to permit it to evaluate off-axis flaws. This report documents the following work to enhance Grizzly’s engineering fracture mechanics capabilities for RPVs: • Interaction Integral and -stress: To obtain mixed-mode stress intensity factors, a capability to evaluate interaction integrals for 2D or 3D flaws has been developed. A -stress evaluation capability has been developed to evaluate the constraint at crack tips in 2D or 3D. Initial verification testing of these capabilities is documented here. • Benchmarking for axis-aligned flaws: Grizzly’s capabilities to evaluate stress intensity factors for axis-aligned flaws have been benchmarked against calculations for the same conditions in FAVOR. • Off-axis flaw demonstration: The newly-developed interaction integral capabilities are demon- strated in an application to calculate the mixed-mode stress intensity factors for off-axis flaws. • Other code enhancements: Other enhancements to the thermomechanics capabilities that relate to the solution of the engineering RPV fracture problem are documented here.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Solution of Ordinary Differential Equations in Gradient-Based Multidisciplinary Design Optimization

A gradient-based approach to multidisciplinary design optimization enables efficient scalability to large numbers of design variables. However, the need for derivatives causes difficulties when integrating ordinary differential equations (ODEs) in models. To simplify this, we propose the use of the general linear methods framework, which unifies all Runge-Kutta and linear multistep methods. This approach enables rapid implementation of integration methods without the need to differentiate each one, even in a gradient-based optimization context. We also develop a new parallel time integration algorithm that enables vectorization across time steps. We present a set of benchmarking results using a stiff ODE, a non-stiff nonlinear ODE, and an orbital dynamics ODE, and compare integration methods. In a modular gradient-based multidisciplinary design optimization context, we find that the new parallel time integration algorithm with high-order implicit methods, especially Gauss-Legendre collocation, is the best choice for a broad range of problems.

Hwang, John T.↗

Efficient Automated Driving Strategies Leveraging Anticipation and Optimal Control

Automated vehicles and advanced driver assistance systems bring computation, sensing, and communication technologies that exceed human abilities in some ways. For example, automated vehicles may sense a panorama all at once, do not suffer from human impairments and distractions, and could wirelessly communicate precise data with neighboring vehicles. Prototype and commercial deployments have demonstrated the capability to relieve human operators of some driving tasks up to and including fully autonomous taxi rides in some areas. The ultimate impact of this technology’s large-scale market penetration on energy efficiency remains unclear, with potential negative factors like road use by empty vehicles competing with positive ones like automatic eco-driving. Fundamentally enabled by historic and look-ahead data, this dissertation addresses the use of automated driving and driver assistance to optimize vehicle motion for energy efficiency. Facets of this problem include car following, co-optimized acceleration and lane change planning, and collaborative multi-agent guidance. Optimal control, especially model predictive control, is used extensively to improve energy efficiency while maintaining safe and timely driving via constraints. Techniques including chance constraints and mixed integer programming help overcome uncertainty and non-convexity challenges. Extensions of these techniques to tractor trailers on sloping roads are provided by making use of linear parameter-varying models. To approach the wheel-input energy eco-driving problem over generally shaped sloping roads with the computational potential for closed-loop implementation, a linear programming formulation is constructed. Distributed and collaborative techniques that enable connected and automated vehicles to accommodate their neighbors in traffic are also explored and compared to centralized control. Using simulations and vehicle-in-the-loop car following experiments, the proposed algorithms are benchmarked against others that do not make use of look-ahead information.

Dollar, Robert Austin↗

Distributed Quantum-Enhanced Optimization: A Topographical Preconditioning Approach for High-Dimensional Search

Optimization problems become fundamentally challenging as the number of variables increases. Because the volume of the search space grows exponentially, classical algorithms frequently fail to locate the global minimum of non-convex functions. While quantum optimization offers a potential alternative, mapping continuous problems onto near-term quantum hardware introduces severe scaling limits and barren plateaus. To bridge this gap, we propose the Distributed Quantum-Enhanced Optimization (D-QEO) framework. Instead of forcing the quantum processor to find the exact minimum, we use it simply as a topographical preconditioner. The QPU maps the landscape to locate the most promising basin of attraction, generating high-quality seed points for a classical GPU-accelerated solver to refine. To make this approach viable for utility-scale problems, we exploit the mathematical structure of separable functions. This allows us to cut a 50-qubit (i.e., $2^{50}$) global search space into independent and manageable sub-spaces using 5-qubit subcircuits. By executing these fragments concurrently with CUDA-Q, we completely bypass the overhead of cross-register entanglement and classical tensor knitting for separable functions. Benchmarks on the 10-dimensional Rastrigin and Ackley functions show that D-QEO prevents the exponential failure rates observed in purely classical algorithms. Furthermore, this quantum warm-start significantly reduces the number of classical BFGS iterations required to converge, providing a highly practical blueprint for utilizing near-term quantum resources in complex global search.

Soos, Dominik [Old Dominion U.]↗

Assessing the impact of human mobility to predict regional excess death in Ecuador

Abstract COVID-19 outbreaks have had high mortality in low- and middle-income countries such as Ecuador. Human mobility is an important factor influencing the spread of diseases possibly leading to a high burden of disease at the country level. Drastic control measures, such as complete lockdown, are effective epidemic controls, yet in practice one hopes that a partial shutdown would suffice. It is an open problem to determine how much mobility can be allowed while controlling an outbreak. In this paper, we use statistical models to relate human mobility to the excess death in Ecuador while controlling for demographic factors. The mobility index provided by GRANDATA, based on mobile phone users, represents the change of number of out-of-home events with respect to a benchmark date (March 2nd, 2020). The study confirms the global trend that more men are dying than expected compared to women, and that people under 30 show less deaths than expected, particularly individuals younger than 20 with a death rate reduction between 22 and 27%. The weekly median mobility time series shows a sharp decrease in human mobility immediately after a national lockdown was declared on March 17, 2020 and a progressive increase towards the pre-lockdown level within two months. Relating median mobility to excess deaths shows a lag in its effect: first, a decrease in mobility in the previous two to three weeks decreases excess death and, more novel, we found an increase of mobility variability four weeks prior increases the number of excess deaths.

59 BASIC BIOLOGICAL SCIENCES↗

Towards excitations and dynamical quantities in correlated lattices with density matrix embedding theory

Density matrix embedding theory (DMET) provides a framework to describe ground-state expectation values in strongly correlated systems, but its extension to dynamical quantities is still an open problem. We show one route to obtaining excitations and dynamical spectral functions by using the techniques of DMET to approximate the matrix elements that arise in a single-mode inspired excitation ansatz. We demonstrate this approach in the one-dimensional Hubbard model, comparing the neutral excitations, single-particle density of states, charge, and spin dynamical structure factors to benchmarks from the Bethe ansatz and density matrix renormalization group. Finally, our work highlights the potential of these ideas in building computationally efficient approaches for dynamical quantities.

1-dimensional systems↗

UMAMI: A Recipe for Generating Meaningful Metrics through Holistic I/O Performance Analysis

I/O efficiency is essential to productivity in scientific computing, especially as many scientific domains become more data-intensive. Many characterization tools have been used to elucidate specific aspects of parallel I/O performance, but analyzing components of complex I/O subsystems in isolation fails to provide insight into critical questions: how do the I/O components interact, what are reasonable expectations for application performance, and what are the underlying causes of I/O performance problems? To address these questions while capitalizing on existing component-level characterization tools, we propose an approach that combines on-demand, modular synthesis of I/O characterization data into a unified monitoring and metrics interface (UMAMI) to provide a normalized, holistic view of I/O behavior. We evaluate the feasibility of this approach by applying it to a month-long benchmarking study on two distinct largescale computing platforms. We present three case studies that highlight the importance of analyzing application I/O performance in context with both contemporaneous and historical component metrics, and we provide new insights into the factors affecting I/O performance. By demonstrating the generality of our approach, we lay the groundwork for a production-grade framework for holistic I/O analysis.

97 MATHEMATICS AND COMPUTING↗

Finite Volume Discretization of the Euler Equations in Pronghorn

Modeling flow and heat transfer in high temperature gas reactors (HTGR) requires the ability to model a wide range of flow speeds from slow (natural convection), to intermediate (forced-flow conditions), to supersonic regimes (depressurization) for a wide range of geometries including the pebble bed, upper and lower plenum, and risers. In previous work, Pronghorn has effectively modeled low-to-medium speed flows in scenarios such as the one described in the two-dimensional PBMR-400 benchmark, using its finite-element-based streamline-upwind Petrov-Galerkin (SUPG) stabilized implementation of the Euler equations. However, limitations of this method become apparent when dealing with more complicated geometries (e.g. imposing slip boundary conditions at nodes belonging to two different boundaries) and when gas speeds are fast enough for shocks and supersonic flow to occur. For these problems, the finite-element-based solver lacks robustness and is plagued by slow iterative convergence or even divergence. In order to address these challenges, the Pronghorn code at INL has been updated with new, modified versions of its original equations. The new Pronghorn models are built on the finite volume method with a Harten-Lax-van Leer-Contact (HLLC) Riemann solver based numerical flux method, which (1) allows imposing slip boundary conditions much more robustly and (2) performs well for a wide range of flow speeds. The finite-volume-based flow solver will form the basis for a robust coarse-mesh thermal-hydraulics capability in Pronghorn.

97 MATHEMATICS AND COMPUTING↗

Analysis of an RNG based turbulence model for separated flows

A two-equation turbulence model of the K-epsilon type was recently derived by using Renormalization Group (RNG) methods. It was later reported that this RNG based model yields substantially better predictions than the standard K-epsilon model for turbulent flow over a backward facing step - a standard test case used to benchmark the performance of turbulence models in separated flows. The improvements obtained from the RNG K-epsilon model were attributed to the better treatment of near wall turbulence effects. In contrast to these earlier claims, it is shown in this paper that the original version of the RNG K-epsilon model substantially underpredicts the reattachment point in the backstep problem. This is a deficiency that is traced to the modeling of the production of dissipation term. However, with the most recent improvements in the RNG K-epsilon model, excellent results for the backstep problem are now obtained.

Speziale, C. G.↗

Data Accountability and Uncertainty Analysis for the Mars Science Laboratory

This paper presents machine learning-based approaches to automate and optimize the detection of volume loss for the downlink process of telemetry data from the Mars Curiosity Rover. The Curiosity observes volume loss and data corruption, requiring re-transmits from the rover and Ground Data System Analysts (GDSA) to monitor the data flow. To resolve this issue, we created a data pipeline to accumulate data from various data sources in the downlink process and detect where the data is missed. In this paper, we benchmarked different methodologies based on the accuracy and excitability of them to identify whether a downlink data that is received to the ground system is complete or incomplete. Our results show that machine learning methods can improve the performance of the GDSA by 55% while the user can diagnose why data is missed and provide an explanation for the data accountability problem.

Chowdhury, Ameera↗

Simulated Ice Shapes on the High Lift Common Research Model Using LEWICE3D

Computational icing tools consist of predicting two distinct problems, the dry air aerodynamics around the iced or uniced vehicle and the accretion of ice due to inclement weather. A desire exists to advance these tools such that they can be reliably used earlier in the design process to limit the need for more costly flight and wind tunnel testing. To achieve these goals the computational tools need to be benchmarked and validated against high quality experimental data sets to raise the software’s Technology Readiness Level. An ongoing collaborative effort between NASA and Boeing Commercial Airplanes is focused on obtaining this required experimental data and subsequently benchmarking and/or validating the tools that predict the aerodynamics around the iced and uniced vehicle. Currently the scope of this effort is focused on the usage of simulated ice shapes to be representative of the iced vehicle. This presentation discusses the generation of those simulated ice shapes.

Icing↗

Strategic stockpiling of power system supplies for disaster recovery

This paper studies the Power System Stochastic Storage Problem (PSSSP), a novel application in power restoration which consists of deciding how to store power system components throughout a populated area to maximize the amount of power served after disaster restoration. The paper proposes an exact mixed-integer formulation for the linearized DC power flow model and a general column-generation approach. Both formulations were evaluated experimentally on benchmarks using the electrical power infrastructure of the United States and disaster scenarios generated by state-of-the-art hurricane simulation tools similar to those used by the National Hurricane Center. The results show that the column-generation algorithm produces near-optimal solutions quickly and produces orders of magnitude speedups over the exact formulation for large benchmarks. Moreover, both the exact and the column-generation formulations produce significant improvements over greedy approach and hence should yield significant benefits in practice.

24 POWER TRANSMISSION AND DISTRIBUTION↗

MCNP 6.2.0 Delayed-Particle Production Improvements

Development began on a delayed-particle physics package for the Monte Carlo Radiation transport code MCNPX in 2004 incorporating the CINDER90 depletion code and delayed particle libraries. When MCNP5 was merged with MCNPX to form MCNP6 in 2010, this delayed-particle capability was passed on and has been continuously improved in subsequent versions of MCNP6. Today, the delayed-particle feature in MCNP6 allows for the production of delayed neutrons, gammas, betas, and alpha particles. Future development includes the addition of delayed-positron production in the next release of MCNP6. Delayed particles can be sampled with MCNP using the ACT card in conjunction with the FISSION and NONFISS keywords. The user can specify one or more of the four available delayed-particle types mentioned above on one or both of the FISSION and NONFISS keywords. If a delayed-particle type is selected on the FISSION keyword, then delayed production of that particle from fission products and their progeny will be produced. Likewise, if a delayed-particle type is selected on the NONFISS keyword then delayed production of that particle from non-fission interactions and spontaneous decay will be produced. In some cases, the sheer number of delayed particles that can be produced from nuclear reactions and spontaneous decay (i.e. hundreds of delayed gamma lines when spontaneous fission is possible) can make it difficult to achieve converged solutions in an efficient and timely manner. Truncation methods are the simplest form of variance reduction and can be used to decrease convergence times by limiting calculations to the phase space of interest. This paper introduces several such truncation methods that allow the user to restrict the number of possible delayed particles available for sampling to only those of interest in the problem. It is important to stress that the use of any truncation method should be verified by first assessing the impact of the truncated particles (i.e. by disabling the truncation) for one or more baseline cases. In addition to these new methods, a new delayed-gamma sampling algorithm implemented in MCNP 6.2.0 is introduced. Comparisons to ENDF data and analytical benchmarking with the new algorithm show a substantial improvement in accuracy over previous versions. New improvements to the delayed-particle capability have been added to MCNP 6.2.0. These improvements include an updated treatment of the THRESH keyword which omits delayed-particle lines below a set amplitude, and addition of the PECUT and HLCUT keywords which allow the user to truncate delayed-particles lines based on energy and half-life, respectively. The delayed-gamma sampling algorithm has also been improved to allow exact energy sampling. Comparisons of MCNP calculations directly to ENDF data and analytical benchmarks have verified the significant improvement in the new delayed gamma sampling algorithm. (authors)

97 MATHEMATICS AND COMPUTING↗

CATHARE calculations of Phenix ultimate natural convection test

The Phenix Sodium cooled Fast Reactor (SFR) started operation in 1973 and it was stopped in 2009. Before the reactor was definitively shutdown, in order to collect experimental data for code assessments in the frame of Generation IV an intensive program of ultimate tests was set up. Among these ultimate experiments, two thermal hydraulic tests were performed: an asymmetrical test consisting in a trip on one secondary pump and a natural convection test in the primary circuit. The natural convection test has been used for an international benchmark on system codes in the frame of the IAEA. The CATHARE code - initially developed for water cooled reactors and now extended for safety analyses for other kinds of reactors, including Sodium Fast Reactor - was used by CEA for this benchmark. The paper reminds briefly the Phenix reactor with the main physical parameters and the instrumentation used during the natural convection test. Main test results are also briefly reminded including the evolution of the core and the heat exchangers inlet and outlet temperatures, and some local temperature measurements. The main developments to perform CATHARE SFR computations and the strategy of system code assessment are presented. Then the CATHARE modelling of Phenix reactor is depicted and the various assumptions are pointed out. CATHARE encountered no problem to predict the initial nominal state. Afterwards, the whole transient scenario is calculated and CATHARE calculations are compared to the Phenix measurements. The global trend is rather well predicted by the CATHARE code. Nevertheless, due to complex flow phenomena occurring in large plena and components, the system code encountered physical limitations, leading to remaining discrepancies between code prediction and plant data. Various sensitivity calculations are presented and they bring partial answers. Additional analyses are in progress to understand more deeply the complex 3D phenomena involved during the different phases of the natural convection test. Additional work for coupling CATHARE system code and TRIO-U CFD code is in progress and will bring useful information to better understand the physical phenomena involved during the natural convection test and to improve system modeling for future SFR safety analysis. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Stabilizing the Interphase in Cobalt–Free, Ultrahigh–Nickel Cathodes for Lithium–Ion Batteries

High-nickel layered oxide cathodes, such as LiNi 1-x-y Mn x Co y O 2 (NMC) and LiNi 1-x-y Co x Al y O 2 (NCA), are at the forefront for implementation in high-energy-density lithium-ion batteries. The presence of cobalt in both cathode chemistries, however, largely deters their application due to fiscal and humanitarian issues affiliated with cobalt sourcing. Increasing the Ni content drives down the Co content, but introduces additional structural and electrochemical problems attributed to high-Ni cathodes. Herein a dually modified cobalt-free ultrahigh-nickel cathode 0.02B-LiNi 0.99 Mg 0.01 O 2 (NBM) is presented with 1 mol% Mg and 2 mol% B that exhibits a high initial 1C discharge capacity of 210 mA h g –1 with a 20% capacity retention improvement over 500 cycles when benchmarked against LiNiO 2 (LNO) in pouch full cell configurations with graphite anode. Postmortem analyses reveal the enhanced performance stems from reduced active lithium inventory loss and localized surface reactivity in the NBM cathode. Here, the stabilized cathode-electrolyte interphase subsequently reduces transition-metal dissolution and ensuing chemical crossover to the graphite anode, which prevents further catalyzed parasitic reactions that harmfully passivate the anode surface. Altogether, this study aims to highlight the importance of electrode characterization and analysis from an interphasial viewpoint and to push the ongoing research to stabilize cobalt-free ultrahigh-Ni cathodes for industrial feasibility.

25 ENERGY STORAGE↗

On the role of Battery Energy Storage Systems in the day-ahead Contingency-Constrained Unit Commitment problem under renewable penetration

The integration of variable Renewable Energy Sources (vRES) to alleviate greenhouse gas emissions has introduced significant challenges for power systems operations. These challenges include high levels of uncertainty due to the intermittence associated with vRES and therefore impose the need to devise a reliable and cost-effective day-ahead unit commitment and power and reserves scheduling for real-time operations. Also, this increasing penetration of vRES requires higher ramping capabilities from units originally designed for other purposes (e.g., base-load generation), which might be exacerbated during contingency states. Hence, in this work, we propose a methodology to address the day-ahead Contingency-Constrained Unit Commitment (CCUC) problem that leverages the participation of Battery Energy Storage Systems (BESSs) to address load-following and post-contingency management, therefore alleviating the ramping burden on conventional thermal generators. To do so, we formulate a three-level optimization problem that represents the decision-making process of obtaining the least-cost commitment, generation and reserves scheduling, while restricting the Conditional Value-at-Risk (CVaR) of the system imbalance at real-time operations to user-defined tolerance levels. In addition, we devise a computationally efficient solution approach for the proposed problem based on the Column-and Constraint Generation (CCG) algorithmic framework. Two numerical experiments are conducted to empirically illustrate the benefits of the proposed methodology. Key results indicate a reduction in real-time ramping needs and a better usage of the system resources, with a reduction in the overall system commitment levels and reserve scheduling costs when compared to a benchmark case in which storage is not available.

Moreira, Alexandre↗

Multithreaded Algorithms for Graph Coloring

Graph algorithms are challenging to parallelize when high performance and scalability are primary goals. Low concurrency, poor data locality, irregular access pattern, and high data access to computation ratio are among the chief reasons for the challenge. The performance implication of these features is exasperated on distributed memory machines. More success is being achieved on shared-memory, multi-core architectures supporting multithreading. We consider a prototypical graph problem, coloring, and show how a greedy algorithm for solving it can be e*ectively parallelized on multithreaded architectures. We present in particular two di*erent parallel algorithms. The first relies on speculation and iteration, and is suitable for any shared-memory, multithreaded system. The second uses data ow principles and is targeted at the massively multithreaded Cray XMT system. We benchmark the algorithms on three di*erent platforms and demonstrate scalable runtime performance. In terms of quality of solution, both algorithms use nearly the same number of colors as the serial algorithm.

Catalyurek, Umit V↗