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,261 records · Page 70

The financial attractiveness assessment of large waste management projects registered as clean development mechanism

Highlights: • Projects are not financially attractive without registration as CDMs. • WM benchmarks and indicators are converging and reducing in variance. • A sensitivity analysis reveal that revenue has more of an effect on the financial results. • Results indicate that an extensive database would reduce WM project risk and capital costs. • Disclosure standards would make information more comparable worldwide. - Abstract: This study illustrates the financial analyses for demonstration and assessment of additionality presented in the project design (PDD) and enclosed documents of the 431 large Clean Development Mechanisms (CDM) classified as the ‘waste handling and disposal sector’ (13) over the past ten years (2004–2014). The expected certified emissions reductions (CER) of these projects total 63.54 million metric tons of CO{sub 2}eq, where eight countries account for 311 projects and 43.36 million metric tons. All of the projects declare themselves ‘not financially attractive’ without CER with an estimated sum of negative results of approximately a half billion US$. The results indicate that WM benchmarks and indicators are converging and reducing in variance, and the sensitivity analysis reveals that revenues have a greater effect on the financial results. This work concludes that an extensive financial database with simple standards for disclosure would greatly diminish statement problems and make information more comparable, reducing the risk and capital costs of WM projects.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Nuclear three-body problem in the complex energy plane: Complex-scaling Slater method

The physics of open quantum systems is an interdisciplinary area of research. The nuclear “openness” manifests itself through the presence of the many-body continuum representing various decay, scattering, and reaction channels. As the radioactive nuclear beam experimentation extends the known nuclear landscape toward the particle drip lines, the coupling to the continuum space becomes exceedingly more important. Of particular interest are weakly bound and unbound nuclear states appearing around particle thresholds. Theories of such nuclei must take into account their open quantum nature. To describe open quantum systems, we introduce a complex-scaling (CS) approach in the Slater basis. We benchmark it with the complex-energy Gamow shell model (GSM) by studying energies and wave functions of the bound and unbound states of the two-neutron halo nucleus 6 He viewed as an $α + n + n$ cluster system. Both CS and GSM approaches are applied to a translationally invariant Hamiltonian with the two-body interaction approximated by the finite-range central Minnesota force. In the CS approach, we use the Slater basis, which exhibits the correct asymptotic behavior at large distances. To extract particle densities from the back-rotated CS solutions, we apply the Tikhonov regularization procedure, which minimizes the ultraviolet numerical noise. In this paper, we show that the CS-Slater method is both accurate and efficient. Its equivalence to the GSM approach has been demonstrated numerically for both energies and wave functions of 6 He. One important technical aspect of our calculation was to fully retrieve the correct asymptotic behavior of a resonance state from the complex-scaled (square-integrable) wave function. While standard applications of the inverse complex transformation to the complex-rotated solution provide unstable results, the stabilization method fully reproduces the GSM benchmark. We also propose a method to determine the smoothing parameter of the Tikhonov regularization. The combined suite of CS-Slater and GSM techniques has many attractive features when applied to nuclear problems involving weakly bound and unbound states. While both methods can describe energies, total widths, and wave functions of nuclear states, the CS-Slater method—if it can be applied—can provide additional information about partial energy widths associated with individual thresholds.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Integrated High-performance Computing and Digital Real-time Simulation Testbed to Benchmark Closed-loop Load Shedding Algorithms in Power Systems

An integrated testbed using digital real-time simulator (DRTS) and a high-performance computing (HPC) cluster is presented here to compare speed and performance of computational schemes to mitigate time-critical issues in electric power systems. The first approach in this testbed validation is taken by running a set of closed-loop load shedding algorithms to compare and contrast two paradigms of arresting cascading failure propagation. Two algorithms involve solving DC and AC power flow model-based optimization problems to compute load shedding at different buses, while a model-based stochastic search using parallel computing provides a viable alternative. The algorithms are implemented in the DRTS-HPC testbed for the IEEE 14-bus benchmark transmission system. As a proof of the concept, simulation results are presented for implementation of closed-loop load-shedding algorithms for cascading failures in the DRTS-HPC testbed

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Plumbing of Land Surface Models: Is Poor Performance a Result of Methodology or Data Quality?

The PALS Land Surface Model Benchmarking Evaluation Project (PLUMBER) illustrated the value of prescribing a priori performance targets in model intercomparisons. It showed that the performance of turbulent energy flux predictions from different land surface models, at a broad range of flux tower sites using common evaluation metrics, was on average worse than relatively simple empirical models. For sensible heat fluxes, all land surface models were outperformed by a linear regression against downward shortwave radiation. For latent heat flux, all land surface models were outperformed by a regression against downward shortwave, surface air temperature and relative humidity. These results are explored here in greater detail and possible causes are investigated. We examine whether particular metrics or sites unduly influence the collated results, whether results change according to time-scale aggregation and whether a lack of energy conservation in flux tower data gives the empirical models an unfair advantage in the intercomparison. We demonstrate that energy conservation in the observational data is not responsible for these results. We also show that the partitioning between sensible and latent heat fluxes in LSMs, rather than the calculation of available energy, is the cause of the original findings. In conclusion, we present evidence suggesting that the nature of this partitioning problem is likely shared among all contributing LSMs. While we do not find a single candidate explanation for why land surface models perform poorly relative to empirical benchmarks in PLUMBER, we do exclude multiple possible explanations and provide guidance on where future research should focus.

54 ENVIRONMENTAL SCIENCES↗

Development of Transient MPACT-CTF Capability for RIA with DNB

The objective of this milestone was to continue the development, implementation, verification, and validation of the methods in VERA-CS necessary to solve the whole-core time-dependent neutron transport equations with pin-resolved detail for a practical PWR applications. This capability is necessary to provide the time dependent pin resolved neutron flux for analysis of the Reactivity Insertion Accident (RIA) as specified in the CASL RIA Challenge Problem Implementation Plan, CASL-I-2013-0060-000. The FY17 work reported here continued the FY16 work reported in CASL-U-2016-1188-000 which was primarily focused on MPACT and performed the methods, and Validation and Verification (V&V) efforts necessary to demonstrate the transient capability in VERA-CS in order to facilitate the L1 RIA milestone in FY18. This report describes the activities performed in FY17 in the three general areas of: User Support, Methods Improvements, and in V&V and Demonstration. In the area of User Support various user requested features were added to the code such as detailed reactivity edits and improvements to the VERA input. In the area of Methods Improvements, the features added included user controlled variable time stepping, a one-group CMFD Acceleration, and a Delayed Energy Deposition model; as well as improvements to the overall code robustness for the transient solution. In the area of V&V, the full suite of C5G7 Transient benchmarks was completed and significant progress was made on the solution of SPERT with VERA-CS. In the area of practical demonstration, a full core AP1000 demonstration problem was performed with VERA-CS. The work performed in FY17 enhanced the capability of performing VERACS transients for practical large-scale light water reactor problems with an acceptable computational burden and provided an important step in the completion of the CASL Reactivity Insertion Accident (RIA) Challenge Problem.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Balanced k -means clustering on an adiabatic quantum computer

Adiabatic quantum computers are a promising platform for efficiently solving challenging optimization problems. Therefore, many are interested in using these computers to train computationally expensive machine learning models. We present a quantum approach to solving the balanced k-means clustering training problem on the D-Wave 2000Q adiabatic quantum computer. In order to do this, we formulate the training problem as a quadratic unconstrained binary optimization (QUBO) problem. Unlike existing classical algorithms, our QUBO formulation targets the global solution to the balanced k-means model. We test our approach on a number of small problems and observe that despite the theoretical benefits of the QUBO formulation, the clustering solution obtained by a modern quantum computer is usually inferior to the solution obtained by the best classical clustering algorithms. Nevertheless, the solutions provided by the quantum computer do exhibit some promising characteristics. We also perform a scalability study to estimate the run time of our approach on large problems using future quantum hardware. Finally, as a final proof of concept, we used the quantum approach to cluster random subsets of the Iris benchmark data set.

97 MATHEMATICS AND COMPUTING↗

GPU-accelerated kinetic Hall thruster simulations in WarpX

Abstract Two-dimensional (axial-azimuthal) simulations of a Hall thruster are performed using the open-source particle-in-cell code WarpX. The simulation conditions are chosen to match those of the axial-azimuthal benchmark first reported by Charoy et al. in 2019. A range of numerical and solver parameters is investigated in order to find those which yield the best performance. It is found that WarpX completes the benchmark case in 3.8 days on an Nvidia V100 GPU, and in as low as 1.5 days on a more recent Nvidia H100 GPU. Of the numerical parameters investigated, it is determined that the field-solve tolerance and particle resampling thresholds have the largest effect on the simulation wall time and that particle resampling may artificially widen electron velocity distribution functions, leading to unphysical heating. A semi-implicit scheme for the electrostatic field solve is tested and is found to produce results consistent to within 10% of the benchmark in less than twelve hours. The scaling properties of the electrostatic solver to multiple GPUs are also assessed on a uniform plasma test problem. The results of this work are discussed in the context of advancements in GPU hardware and the suitability of kinetic Hall thruster simulations for engineering applications.

Marks, Thomas A.↗

Stochastic finite volume method for uncertainty quantification of transient flow in gas pipeline networks

We develop a weakly intrusive framework to simulate the propagation of uncertainty in solutions of generic hyperbolic partial differential equation systems on graph-connected domains with nodal coupling and boundary conditions. The method is based on the Stochastic Finite Volume (SFV) approach and can be applied for uncertainty quantification (UQ) of the dynamical state of fluid flow over actuated transport networks. The numerical scheme has specific advantages for modeling intertemporal uncertainty in time-varying boundary parameters, which cannot be characterized by strict upper and lower (interval) bounds. We describe the scheme for a single pipe, and then formulate the controlled junction Riemann problem (JRP) that enables the extension to general network structures. In conclusion, we demonstrate the method's capabilities and performance characteristics using a standard benchmark test network.

97 MATHEMATICS AND COMPUTING↗

Higher-order massive neutrino perturbations in large-scale structure

We develop a higher-order perturbation theory for large-scale structure formation involving a free-streaming hot or warm dark matter species. We focus on the case of mixed cold dark matter and massive neutrinos, although our approach is applicable also to a single warm dark matter species. In order to capture the suppressed growth of neutrino density perturbations on small scales, we account for the full momentum dependence of the phase space distribution using the Vlasov equation, and derive from it a formal closed-form nonlinear equation for the neutrino density. Using a systematic perturbative expansion of this equation we compute high-order corrections to the neutrino density contrast without the explicit need to track the perturbed neutrino momentum distribution. We calculate the leading-order total matter bispectrum for several neutrino masses. Using our result as a benchmark, we test the accuracy of the fluid approximation and a linear approximation used in perturbative and N-body analyses, as well as a new hybrid approach that combines the exact linear evolution with the nonlinear structure of the fluid equations. Aiming at ∼< 1% accuracy, we find that the total matter bispectrum with a low neutrino mass m = 0.046 eV can be reproduced by all but the fluid approximation, while for larger neutrino masses m=0.46 → 0.93 eV only the hybrid approach has the desired accuracy on a large range of scales. This result serves as a cautionary note that approximate nonlinear models of neutrino clustering that reproduce the gross features of some observables may not suffice for precision calculations, nor are they guaranteed to apply to other observables. All of the approximation schemes fail to reproduce the bispectrum of the neutrino density perturbations at better than 20% accuracy across all scales, indicating that an exact treatment of nonlinear neutrino perturbations is necessary.

79 ASTRONOMY AND ASTROPHYSICS↗

ACStor: Optimizing Access Performance of Virtual Disk Images in Clouds

In virtualized data centers, virtual disk images (VDIs) serve as the containers in virtual environment, so their access performance is critical for the overall system performance. Some distributed VDI chunk storage systems have been proposed in order to alleviate the I/O bottleneck for VM management. As the system scales up to a large number of running VMs, however, the overall network traffic would become unbalanced with hot spots on some VMs inevitably, leading to I/O performance degradation when accessing the VMs. Here, we propose an adaptive and collaborative VDI storage system (ACStor) to resolve the above performance issue. In comparison with the existing research, our solution is able to dynamically balance the traffic workloads in accessing VDI chunks, based on the run-time network state. Specifically, compute nodes with lightly loaded traffic will be adaptively assigned more chunk access requests from remote VMs and vice versa, which can effectively eliminate the above problem and thus improves the I/O performance of VMs. We also implement a prototype based on our ACStor design, and evaluate it by various benchmarks on a real cluster with 32 nodes and a simulated platform with 256 nodes. Experiments show that under different network traffic patterns of data centers, our solution achieves up to 2-8 performance gain on VM booting time and VM’s I/O throughput, in comparison with the other state-of-the-art approaches.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

A Brief User's Guide for PARTISN. Revision 1

This document is intended as a very basic primer on the use of the PARTISN multigroup discrete-ordinates transport code for neutron criticality and time-independent neutron leakage problems. One-dimensional (r only) spherical and two-dimensional (r-z) cylindrical geometries and only the most basic options are discussed. It is assumed that the Nuclear Data Interface (NDI) is the source of nuclear data, that volume sources are isotropic, and that external boundaries are vacuums. The location and meaning of useful information in the PARTISN output is discussed. A sample input deck for a cylindrical problem that stacks a leakage calculation and a k eff calculation is listed. The method for inputting cross sections by hand (e.g., for analytic benchmark comparisons) is presented.

97 MATHEMATICS AND COMPUTING↗

MOOSE-Based Fast Reactor Core Bowing Capabilities: Coupled Structural Mechanics – Thermal Fluids Demonstration and Related Verification Efforts

Under the U.S. Department of Energy Office of Nuclear Energy’s Advanced Modeling and Simulation (NEAMS) Program, an integrated multiphysics approach is being developed to model the core bowing phenomena important to liquid metal-cooled fast reactors. Core bowing is an important passive safety mechanism in liquid metal-cooled fast reactors and involves multiphysics effects including radiation transport, fluid flow, heat transfer, and mechanical response to temperature and flux gradients. Verification and assessment efforts continued on the Multiphysics Object Oriented Simulation Environment (MOOSE) capabilities relevant for modeling thermo-mechanical core bowing behavior. IAEA Verification Problem 4, which was started in FY23, was further examined with MOOSE capabilities to rectify discrepancies observed in previous years when compared to IAEA benchmark participant data. Meshing and postprocessing capabilities in MOOSE were also advanced by other teams and utilized this year. A thermal fluids-structural mechanical coupling demonstration has performed on 7-assemblyand 19-assembly fast reactor assembly configurations using MOOSE. Subchannel capabilities are used to calculate coolant temperature, and heat conduction capabilities calculate duct wall temperature as well as heat transfer through the inter-assembly gap. Structural mechanical capabilities then deform the mesh, accounting for contact between assemblies, according to the temperature gradients calculated by the thermal solvers. Power distributions are imposed rather than calculated to demonstrate different deformations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Hardware-Efficient Quantum Optimization Layered Algorithms and Experiments

Quantum optimization algorithms, such as QAOA, that implement parametrized stochastic optimization solvers attempt to identify low-energy solutions of Ising systems by exploiting available quantum effects in noisy-intermediate scale machines. Engineering a well-performing parametrized quantum optimization circuit is indeed an exercise in balancing the trade-off between expressivity and implementation complexity. We show that, for MaxCut QAOA circuits defined on native hardware topology (Rigetti’s Aspen Quantum Processors), error-mitigation techniques recover simulated features of the noiseless theory. Moreover, we explore a design space for QAOA-like ansatze that perform well in theory as well as in hardware for fully-connected problems. We also discuss how efficient coherence and entanglement detection methods that could be coupled with quantum optimization experiments require only linear overhead in benchmarking time.

quantum computing↗

A Convexification-Based Outer-Approximation Method for Convex and Nonconvex MINLP

The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer-Approximation method. We propose a refined convexification-based Outer-Approximation method alongside a Branch-and-Bound method for both convex and nonconvex Mixed-Integer Nonlinear Programming problems. These methods have been developed and incorporated into the open-source Mixed-Integer Nonlinear Decomposition Toolbox for Pyomo-MindtPy. Comprehensive benchmark tests were conducted, validating the effectiveness and reliability of our proposed algorithms. These tests highlight the improvements achieved by incorporating convexification and domain reduction techniques into the Outer-Approximation and Branch-and-Bound methods.

Optimization↗

Assessment of the 2D MOC solver in MPACT: Michigan parallel characteristics transport code

MPACT (Michigan Parallel Characteristics Transport Code) is a new reactor analysis tool being developed by researchers at the University of Michigan as an advanced pin-resolved transport capability within VERA (Virtual Environment for Reactor Analysis). VERA is the end-user reactor simulation tool being developed by the Consortium for the Advanced Simulation of Light Water Reactors (CASL). The MPACT development project is itself unique for the way it is changing how students perform research to achieve the instructional and research goals of an academic institution, while providing immediate value to the industry. One of the major computational pieces in MPACT is the 2D MOC solver. It is critical that the 2D MOC solver provide an efficient, accurate, and robust solution over a broad range of reactor operating conditions. The C5G7 benchmark is first used to test the accuracy of the method with a fixed set of cross-sections. The VERA Core Physics Progression Problems are then used to compare the accuracy of both the 2D transport solver and also the cross-section treatments. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

The Half Monte Carlo Method: Combining Total Monte Carlo with Nuclear Data Sensitivity Profiles

Both Total Monte Carlo (TMC) and Generalized Linear Least Squares (GLLS) algorithms have been used extensively to perform nuclear uncertainty propagation. Both methods have strengths and weaknesses, for example, the time required to perform TMC limits its attractiveness, while GLLS cannot generate higher order moments of output distributions and also has trouble dealing with nonlinear distributions. This work uses a new method that overcomes many of the aforementioned limitations of TMC and GLLS, while at the same time reasonably reproduces the TMC result. The concept is a simple combination of the two methods i.e., generate the random nuclear data files using the TMC approach, and then propagate the effect on the integral parameters like k{sub eff} using sensitivity coefficients, as opposed to cumbersome neutron transport calculations. Agreement is demonstrated for the Jezebel sphere ICSBEP benchmark. Since the method is part TMC part GLLS, the term Half Monte Method (HMM) will be used.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scalable Gaussian Processes, GPyTorch Application Benchmarking, and Targeted Adaptive Design (TAD) on ThetaGPU

We aim at showcasing the scalability of Gaussian Process (GP). The naive GP implementation scales cubically with data size, which can be prohibitive, so GP has not heretofore been considered suitable for very large-scale problem settings. We take advantage of GPyTorch, a library for scalable GPs built on top of PyTorch that incorporates GPU acceleration. With GPyTorch, one can achieve nearly linear scaling with structured kernel interpolation (SKI) and constant-time predictive covariances computation with LanczOs Variance Estimates (LOVE) while preserving accuracy. We also take advantage of the computational power of ThetaGPU, a supercomputer of Argonne Leadership Computing Facility (ALCF). In addition, we implement a scalable, GPU-ready version of Targeted Adaptive Design (TAD), a GP-based data-driven algorithm that efficiently searches the control space of an advanced manufacturing experiment for settings capable of producing a required design within a specified tolerance, despite the poorly known mapping from control settings to design. We finally show our benchmarking for GPyTorch and TAD performance on CPU vs. ThetaGPU and discuss the results and implications.

97 MATHEMATICS AND COMPUTING↗

Auxiliary-Field Quantum Monte Carlo Simulations of Strongly-Correlated Molecules and Solids

We propose a method of implementing projected wave functions for second-quantized auxiliary-field quantum Monte Carlo (AFQMC) techniques. The method is based on expressing the two-body projector as one-body terms coupled to binary Ising fields. To benchmark the method, we choose to study the two-dimensional (2D) one-band Hubbard model with repulsive interactions using the constrained-path MC (CPMC). The CPMC uses a trial wave function to guide the random walks so that the so-called fermion sign problem can be eliminated. The trial wave function also serves as the importance function in Monte Carlo sampling. As such, the quality of the trial wave function has a direct impact to the efficiency and accuracy of the simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗