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,585 records · Page 88

Using cylindrical implosions to investigate hydrodynamic instabilities in convergent geometry

Hydrodynamic instabilities such as the Rayleigh–Taylor (RT) and Richtmyer–Meshkov instabilities disrupt inertial confinement fusion (ICF) implosions through the growth of 3D perturbations. Growth of these 3D imperfections at the interfaces of an ICF capsule during implosion lead to mixing between materials that is detrimental to performance. These instabilities have been studied extensively in planar geometry, but such experiments lack the effects of convergence in spherical implosions. While several studies have been performed in spherical geometry, these often lack a direct means to measure perturbation growth. Experiments in cylindrical geometry include convergence effects while maintaining direct diagnostic access. Although cylinders have less compression than spheres, they do provide an excellent platform to validate modeling for convergent geometries. The problem with previous cylindrical implosion experiments was that the convergence ratios were limited to ~4. With the National Ignition Facility (NIF), larger cylindrical targets can be driven to convergences of 10–15 while maintaining a large enough final diameter to measure perturbation growth. This paper reviews the design process used to both benchmark radiation hydrodynamics codes and enable 1D post-processed simulations to explore design space to separate compression effects from acceleration/deceleration RT instability. Results from 1D simulations suggest that cylindrical implosions on the NIF can produce high-convergence experiments to validate RT instability growth for ICF implosions.

36 MATERIALS SCIENCE↗

A general hybrid radiation transport scheme for star formation simulations on an adaptive grid

Radiation feedback plays a crucial role in the process of star formation. In order to simulate the thermodynamic evolution of disks, filaments, and the molecular gas surrounding clusters of young stars, we require an efficient and accurate method for solving the radiation transfer problem. We describe the implementation of a hybrid radiation transport scheme in the adaptive grid-based FLASH general magnetohydrodyanmics code. The hybrid scheme splits the radiative transport problem into a raytracing step and a diffusion step. The raytracer captures the first absorption event, as stars irradiate their environments, while the evolution of the diffuse component of the radiation field is handled by a flux-limited diffusion solver. We demonstrate the accuracy of our method through a variety of benchmark tests including the irradiation of a static disk, subcritical and supercritical radiative shocks, and thermal energy equilibration. We also demonstrate the capability of our method for casting shadows and calculating gas and dust temperatures in the presence of multiple stellar sources. Our method enables radiation-hydrodynamic studies of young stellar objects, protostellar disks, and clustered star formation in magnetized, filamentary environments.

79 ASTRONOMY AND ASTROPHYSICS↗

Experimental error mitigation using linear rescaling for variational quantum eigensolving with up to 20 qubits

Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various methods have been proposed to mitigate the impact of noise on variational algorithms, including several that model the noise as damping expectation values of observables. In this work, we benchmark various methods, including a new method proposed here. Here, we compare their performance in estimating the ground-state energies of several instances of the 1D mixed-field Ising model using the variational-quantum-eigensolver algorithm with up to 20 qubits on two of IBM's quantum computers. We find that several error-mitigation techniques allow us to recover energies to within 10% of the true values for circuits containing up to about 25 ansatz layers, where each layer consists of CNOT gates between all neighboring qubits and Y-rotations on all qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real Time Simulation of Power Grid Disruptions

DOE-OE and DOE-SC workshops (Reference 1-3) identified the key power grid problem that requires insight addressable by the next generation of exascale computing is coupling of real-time data streams (1-2 TB per hour) as the streams are ingested to dynamic models. These models would then identify predicted disruptions in time (2-4 seconds) to trigger the smart grid s self healing functions. This project attempted to establish the feasibility of this approach and defined the scientific issues, and demonstrated example solutions to important smart grid simulation problems. These objectives were accomplished by 1) using the existing frequency recorders on the national grid to establish a representative and scalable real-time data stream; 2) invoking ORNL signature identification algorithms; 3) modeling dynamically a representative region of the Eastern interconnect using an institutional cluster, measuring the scalability and computational benchmarks for a national capability; and 4) constructing a prototype simulation for the system s concept of smart grid deployment. The delivered ORNL enduring capability included: 1) data processing and simulation metrics to design a national capability justifying exascale applications; 2) Software and intellectual property built around the example solutions; 3) demonstrated dynamic models to design few second self-healing.

Chinthavali, Supriya↗

Decrease time-to-solution through improved linear-system setup and solve

The goal of the ExaWind project is to enable predictive simulations of wind farms composed of many MW-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines, and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary code in the ExaWind project is Nalu, which is an unstructured-grid solver for the acoustically-incompressible Navier-Stokes equations, and mass continuity is maintained through pressure projection. The model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as re-initialization of matrices and re-computation of preconditioners is required at every time step We describe in this report our efforts to decrease the setup and solution time for the mass-continuity Poisson system with respect to the benchmark timing results reported in FY18 Q1. In particular, we investigate improving and evaluating two types of algebraic multigrid (AMG) preconditioners: Classical Ruge-Stfiben AMG (C-AMG) and smoothed-aggregation AMG (SA-AMG), which are implemented in the Hypre and Trilinos/MueLu software stacks, respectively. Preconditioner performance was optimized through existing capabilities and settings.

17 WIND ENERGY↗

Testing and Application of Commercial Thermodynamics Software for Solid-Gas Equilibria in Planetary Science Applications

The ability to calculate chemical equilibria from thermochemical constants (e.g., H, S, Cp) or other experimental data is a tool widely employed by scientists. However, phase equilibria for planetary science problems is limited by easy access to libraries of thermochemical data, as well as the software to invert that data. Many academic software packages are focused on specific types of problems (e.g., aqueous solutions or melting and crystallization of magmas). This focus makes them excellent tools for specific uses, but poorer tools for other scenarios, especially those involving elements or chemical species that are less well-studied in that specific scientific field (e.g. NaCl vapor). Amongst the more general thermodynamic software tools, there are closed academic software packages, open-source options, as well as commercial software. We have explored the extent to which commercial chemistry/chemical engineering software may be able to satisfy the need for thermochemical modeling packages that can accommodate the diverse species and conditions of planetary science problems. Here we compare the output of software package HSC Chemistry™ (Metso Outotec) to published vapor-solid phase diagrams for a variety of major and minor elements. HSC Chemistry™ has been used in several recent geochemical studies of terrestrial volcanic systems [2- 4]. However, it has not to our knowledge been benchmarked against peer-reviewed model results for the conditions and compositions relevant to planetary science. We present one such comparison here, the low- pressure environment of the solar nebula, using literature data. In short, we find excellent agreement between HSC Chemistry™ and the well-regarded academic software package CONDOR. These preliminary results suggest that at least some commercial software packages are capable of robust thermochemical calculations for planetary science.

planetary science↗

High Performance GPU-Based FEM Code for Simulating Welding and Additive Manufacturing

An in-house HPC finite element code with novel computational schemes provides fast and high-fidelity simulation capability for welding processes and allied manufacturing processes such as metal additive manufacturing. Benchmark comparison confirmed that, for the testing cases studied, the newly developed in-house code resulted in increases in computational speed in the ranges of 100x to 1000x depending on the size and complexity of the testing cases, when compared to today's commercial welding process simulation tools. For a reference problem in nuclear reactor repair welding, ORNL's in-house high fidelity code was able to complete the simulation in 3.2 days, which would take estimated 10 to 20 years using today's commercial code. Similar order of magnitudes of reduction in computational times for metal additive manufacturing process were also achieved.

Feng, Zhili↗

Performance improvements of the windowed multipole formalism using a rational fraction approximation of the Faddeeva function

The windowed multipole (WMP) formalism was introduced as a way to calculate Doppler broadened cross sections on the fly during Monte Carlo simulations. While more arithmetic is needed compared to point-wise cross section look-ups, performance remained competitive from the large memory reductions and sequential data access. The single most expensive function call in a depleted fuel assembly problem using WMP comes from the evaluation of the Faddeeva function, which previously relied on a highly accurate, highly-branching algorithm. This paper explores the use of rational fraction approximations tailored to the domain interest of reactor physics applications and the development of lower accuracy approximations sufficient for our application. The rational approximations were implemented and tested in OpenMC on an infinite medium problem to stress the cross section calculation routine and a PWR assembly problem. In both cases, the rational approximation nearly eliminated the ∼ 20% penalty previously observed when comparing to point-wise libraries. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Field demonstration and implementation analysis of model predictive control in an office HVAC system

Model Predictive Control (MPC) is a promising technique to address growing needs for heating, ventilation, and air-conditioning (HVAC) systems to operate more efficiently and with greater flexibility. However, due to a number of factors, including the required implementation expertise, lack of high quality data, and a risk-adverse industry, MPC has yet to gain widespread adoption. While many previous studies have shown the advantages of MPC, few analyzed the implementation effort and associated practical challenges. In addition, previous work has developed an open-source, Modelica-based tool-chain that automatically generates optimal control, parameter estimation, and state estimation problems aimed at facilitating MPC implementation. Therefore, this study demonstrates usage of this tool-chain to implement MPC in a real office building, discusses practical challenges of implementing MPC, and estimates the implementation effort associated with various tasks in order to inform the development of future workflows and serve as an initial benchmark for their impact on reducing implementation effort. This study finds that the implemented MPC saves approximately 40% of HVAC energy over the existing control during a two-month trial period and that tasks related to data collection and controller deployment activities can each require as much effort as model generation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Three-dimensional Skyrme Hartree-Fock-Bogoliubov solver in coordinate-space representation

The coordinate-space representation of the Hartree-Fock-Bogoliubov theory is the method of choice to study weakly bound nuclei whose properties are affected by the quasiparticle continuum space. To describe such systems, we developed a three-dimensional Skyrme-Hartree-Fock-Bogoliubov solver HFBFFT based on the existing, highly optimized and parallelized Skyrme-Hartree-Fock code Sky3D. The code does not impose any self-consistent spatial symmetries such as mirror inversions or parity. The underlying equations are solved in HFBFFT directly in the canonical basis using the fast Fourier transform. To remedy the problems with pairing collapse, we implemented the soft energy cutoff and pairing annealing. The convergence of HFB solutions was improved by a sub-iteration method. The Hermiticity violation of differential operators brought by Fourier-transform-based differentiation has also been solved. Furthermore, the accuracy and performance of HFBFFT were tested by benchmarking it against other HFB codes, both spherical and deformed, for a set of nuclei, both well-bound and weakly-bound.

3D coordinate-space representation↗

An enhanced artificial neural network with a shuffled complex evolutionary global optimization with principal component analysis

The classical Back-Propagation (BP) scheme with gradient-based optimization in training Artificial Neural Networks (ANNs) suffers from many drawbacks, such as the premature convergence, and the tendency of being trapped in local optimums. Therefore, as an alternative for the BP and gradient-based optimization schemes, various Evolutionary Algorithms (EAs), i.e., Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Simulated Annealing (SA), and Differential Evolution (DE), have gained popularity in the field of ANN weight training. This study applied a new efficient and effective Shuffled Complex Evolutionary Global Optimization Algorithm with Principal Component Analysis – University of California Irvine (SP-UCI) to the weight training process of a three-layer feed-forward ANN. A large-scale numerical comparison is conducted among the SP-UCI-, PSO-, GA-, SA-, and DE-based ANNs on 17 benchmark, complex, and real-world datasets. Here the results show that SP-UCI-based ANN outperforms other EA-based ANNs in the context of convergence and generalization. Results suggest that the SP-UCI algorithm possesses good potential in support of the weight training of ANN in real-word problems. In addition, the suitability of different kinds of EAs on training ANN is discussed. The large-scale comparison experiments conducted in this paper are fundamental references for selecting proper ANN weight training algorithms in practice.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

A high-order Shifted Interface Method for Lagrangian shock hydrodynamics

Here, we present a new method for two-material Lagrangian hydrodynamics, which combines the Shifted Interface Method (SIM) with a high-order Finite Element Method. Our approach relies on an exact (or sharp) material interface representation, that is, it uses the precise location of the material interface. The interface is represented by the zero level-set of a continuous high-order finite element function that moves with the material velocity. This strategy allows to evolve curved material interfaces inside curved elements. By reformulating the original interface problem over a surrogate (approximate) interface, located in proximity of the true interface, the SIM avoids cut cells and the associated problematic issues regarding implementation, numerical stability, and matrix conditioning. Accuracy is maintained by modifying the original interface conditions using Taylor expansions. We demonstrate the performance of the proposed algorithms on established numerical benchmarks in one, two and three dimensions.

97 MATHEMATICS AND COMPUTING↗

Maximal clique enumeration with data-parallel primitives

The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in several research areas. We consider maximal clique enumeration on shared-memory, multi-core architectures and introduce an approach consisting entirely of data-parallel operations, in an effort to achieve efficient and portable performance across different architectures. We study the performance of the algorithm via experiments varying over benchmark graphs and architectures. Overall, we observe that our algorithm achieves up to a 33-time speedup and 9-time speedup over state-of-the-art distributed and serial algorithms, respectively, for graphs with higher ratios of maximal cliques to total cliques. Further, we attain additional speedups on a GPU architecture, demonstrating the portable performance of our data-parallel design.

97 MATHEMATICS AND COMPUTING↗

Adapting CLUTCH methodology to multigroup TSUNAMI-3D for eigenvalue sensitivity calculations

The sensitivity of the eigenvalue to uncertainties in nuclear data and its evaluation are important for nuclear criticality safety. TSUNAMI-3D sequences within the SCALE code system offer several options to the user community for calculating eigenvalue sensitivity coefficients with multigroup (MG) and continuous energy (CE) 3D transport capabilities. TSUNAMI-3D sequences implement the adjoint-based perturbation theory with MG KENO code, the Contributon Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method with CE KENO code, and the Iterated Fission Probability (IFP) method with CE KENO and Shift codes. Each method has benefits and limitations depending on the problem that is run. The work presented here aims to adapt the CLUTCH method, which enables the Contributon method's mesh-free, memory-efficient approach for calculating adjoint-weighted tallies for sensitivity calculations, to the MG TSUNAMI-3D sequence. This application would eliminate the explicit adjoint KENO calculation, as well as the memory-consuming mesh flux moment tallies required by the conventional MG TSUNAMI-3D. Smaller memory footprints in the CLUTCH methodology and relatively shorter runtimes in MG KENO transport can make MG TSUNAMI-3D a viable method for some complex problems. Moreover, this adaptation allows MG sensitivity calculations with Shift, ORNL's next-generation high-performance Monte Carlo transport code, which currently does not offer any sensitivity capabilities with MG particle transport simulations. Initial implementation of the new MG TSUNAMI-3D sequence and its preliminary results with a selected critical benchmark experiment in the Verified, Archived Library of Inputs and Data (VALID) are presented in this study.

KENO↗

NAS Grid Benchmarks: A Tool for Grid Space Exploration

We present an approach for benchmarking services provided by computational Grids. It is based on the NAS Parallel Benchmarks (NPB) and is called NAS Grid Benchmark (NGB) in this paper. We present NGB as a data flow graph encapsulating an instance of an NPB code in each graph node, which communicates with other nodes by sending/receiving initialization data. These nodes may be mapped to the same or different Grid machines. Like NPB, NGB will specify several different classes (problem sizes). NGB also specifies the generic Grid services sufficient for running the bench-mark. The implementor has the freedom to choose any specific Grid environment. However, we describe a reference implementation in Java, and present some scenarios for using NGB.

Frumkin, Michael↗

Formal Verification of a Solution to the n-Queens Problem

This report describes a formal verification of a concise algorithm that computes a solution to the n-Queens problem for all natural numbers n, such that n > 3. The formal proof of the algorithm is completed in the Prototype Verification System (PVS) theorem prover. This verification effort serves two purposes. First, it is presented as a pedagogical example for learning a theorem prover, such as PVS, and second, as a candidate benchmark for comparing other formal methods tools to PVS.

Mahyar R Malekpour↗

A Two-Dimensional Fem Code for Impedance Calculation in High Frequency Domain

A new method, using the parabolic equation (PE), for the calculation of both high-frequency impedances of small-angle taper (or collimator) is developed in [1]. One of the most important advantages of the PE approach is that it eliminates the spatial scale of the small wavelength from the problem. As a result, only coarser spatial meshes are needed in calculating the numerical solution of the PE. We developed a new code based on Finite Element Method (FEM) which can handle arbitrary profile of a transition and speed up the calculation by orders of magnitude. As a first step, we completed and benchmarked a two-dimensional code. It can be upgraded to three-dimensional geometry.

43 PARTICLE ACCELERATORS↗

Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive decomposition scheme which iteratively decouples a routing problem based on the current solution. Earlier work considered vehicle-based decompositions that partitions the vehicles across the subproblems. The subproblems can then be optimized independently and merged easily. This paper argues that vehicle-based decompositions, although very effective on various problem classes also have limitations. In particular, they do not accommodate temporal decompositions and may produce spatial decompositions that are not focused enough. This paper then proposes customer-based decompositions which generalize vehicle-based decouplings and allows for focused spatial and temporal decompositions. Experimental results on class R2 of the extended Solomon benchmarks demonstrates the benefits of the customer-based adaptive decomposition scheme and its spatial, temporal, and hybrid instantiations. In particular, they show that customer-based decompositions bring significant benefits over large neighborhood search in contrast to vehicle-based decompositions.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗