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 901 records · Page 50

Manipulating Light with Transition Metal Clusters, Organic Dyes, and Metal Organic Frameworks

The primary goals of our research program is to develop and apply state-of-the-art first-principles methods to predict electronic and optical properties of three systems of significant scientific and technological interest: transition metal clusters, organic dyes, and metal-organic frameworks. These systems offer great opportunities to manipulate light for a wide ranging list of energy-related scientific problems and applications. During this grant period, we focused our investigations on the development, implementation, and benchmarking of many-body Green’s function methods (GW approximation and the Bethe-Salpeter equation) to examine excited-state properties of transition metal/transition-metal-oxide clusters and organic molecules that comprise the building blocks of dyes and metal-organic frameworks.

36 MATERIALS SCIENCE↗

PARFUME User's Guide

PARFUME, a fuel performance analysis and modeling code, is being developed at the Idaho National Laboratory for evaluating gas reactor coated particle fuel assemblies for prismatic, pebble bed, and plate type fuel geometries. The code is an integrated mechanistic analysis tool that evaluates the thermal, mechanical, and physico-chemical behavior of coated fuel particles (TRISO) and the probability for fuel failure given the particle-to-particle statistical variations in physical dimensions and material properties that arise during the fuel fabrication process. Using a robust finite difference numerical scheme, PARFUME is capable of performing steady state and transient heat transfer and fission product diffusion analyses for the fuel. Written in FORTRAN 90, PARFUME is easy to read, maintain, and modify. Currently, PARFUME is supported only on MS Windows platforms. This document represents the initial version of the PARFUME User Guide, a supplement to the PARFUME Theory and Model Basis Report which describes the theoretical aspects of the code. User information is provided including: 1) code development, 2) capabilities and limitations, 3) installation and execution, 4) user input and output, 5) sample problems, and 6) error messages. In the near future, the INL plans to release a fully benchmarked and validated beta version of PARFUME.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Teeport: Break the Wall Between the Optimization Algorithms and Problems

Optimization algorithms/techniques such as genetic algorithm, particle swarm optimization, and Gaussian process have been widely used in the accelerator field to tackle complex design/online optimization problems. However, connecting the algorithm with the optimization problem can be difficult, as the algorithms and the problems may be implemented in different languages, or they may require specific resources. We introduce an optimization platform named Teeport that is developed to address the above issues. This real-time communication-based platform is designed to minimize the effort of integrating the algorithms and problems. Once integrated, the users are granted a rich feature set, such as monitoring, controlling, and benchmarking. Some real-life applications of the platform are also discussed.

97 MATHEMATICS AND COMPUTING↗

Numerical Solution of the Steady-State Network Flow Equations for a Non-Ideal Gas

Herein we formulate a steady-state network flow problem for non-ideal gas that relates injection rates and nodal pressures in the network to flows in pipes. For this problem, we present and prove a theorem on uniqueness of generalized solution for a broad class of non-ideal pressure-density relations that satisfy a monotonicity property. Further, we develop a Newton-Raphson algorithm for numerical solution of the steady-state problem, which is made possible by a systematic non-dimensionalization of the equations. The developed algorithm has been extensively tested on benchmark instances and shown to converge robustly to a generalized solution. Previous results [1]-[4], indicate that the steady-state network flow equations for an ideal gas are difficult to solve by the Newton-Raphson method because of its extreme sensitivity to the initial guess. In contrast, we find that non-dimensionalization of the steady-state problem is key to robust convergence of the Newton-Raphson method. We identify criteria based on the uniqueness of solutions under which the existence of a non-physical generalized solution found by a non-linear solver implies non-existence of a physical solution, i.e., infeasibility of the problem. Finally, we compare pressure and flow solutions based on ideal and non-ideal equations of state to demonstrate the need to apply the latter in practice. The solver developed in this article is open-source and is made available for both the academic and research communities as well as the industry.

97 MATHEMATICS AND COMPUTING↗

Using Hybrid Model OpenSHMEM + CUDA to Implement the SHOC Benchmark Suite

This work describes the process of porting the Scalable HeterOgeneous Computing (SHOC) benchmark suite from the hybrid MPI + CUDA implementation to OpenSHMEM + CUDA. SHOC includes a wide variety of benchmark kernels used to measure accelerator performance in both single node and cluster configurations. The hybrid model implementation attempts to place all major computation on accelerator devices, and uses MPI to synchronize and aggregate results. In some cases, MPI Groups are used to gradually reduce the number of accelerators used for computation as the problem size drops. Porting this behavior to OpenSHMEM required implementing several synchronizing collective operations, and using SHMEM teams to replace MPI Group functionality. Benchmark results on a Cray XK7 system with one GPU per compute node show that SHMEM performance is equal to MPI performance in these hybrid tasks. These results and porting experience show that using OpenSHMEM for accelerator devices benefits from adding functionality for synchronization and teams, and would further benefit from adding support for communication within accelerator kernels.

97 MATHEMATICS AND COMPUTING↗

An improved physics-based approach for unfolding megavoltage bremsstrahlung spectra using transmission analysis

Purpose: To develop a physics-based approach to improve the accuracy and robustness of the ill-conditioned problem of unfolding megavoltage bremsstrahlung spectra from transmission data. Methods: Spectra are specified using a rigorously-benchmarked functional form. Since ion chambers are the typical detector used in transmission measurements, the energy response of a Farmer chamber is calculated using the EGSnrc Monte Carlo code, and the effect of approximating the energy response on the accuracy of the unfolded spectra is studied. A proposal is introduced to enhance spectral sensitivity by combining transmission data measured with multiple detectors of different energy response and by combining data from multiple attenuating materials. Monte Carlo methods are developed to correct for nonideal exponential attenuation (e.g., scatter effects and secondary attenuation). The performance of the proposed methods is evaluated for a diverse set of validated clinical spectra (3.5-25 MV) using analytical transmission data with simulated experimental noise. Results: The approximations commonly used in previous studies for the ion-chamber energy response lead to significant errors in the unfolded spectra. Of the configurations studied, the one with best spectral sensitivity is to measure four full transmission curves using separate low-Z and high-Z attenuators in conjunction with two detectors of different energy response (the authors propose a Farmer-type ion chamber, once with a low-Z, and once with a high-Z buildup cap material), then to feed the data simultaneously to the unfolding algorithm. Deviations from ideal exponential attenuation are as much as 1.5% for the smallest transmission signals, and the proposed methods properly correct for those deviations. The transmission data with enhanced spectral sensitivity, combined with the accurate and flexible spectral functional form, lead to robust unfolding without requiring a priori knowledge of the spectrum. Compared with the commonly-used methods, the accuracy is improved for the unfolded spectra and for the unfolded mean incident electron kinetic energy by at least factors of three and four, respectively. With simulated experimental noise and a lowest transmission of 1%, the unfolded energy fluence spectra agree with the original spectra with a normalized root-mean-square deviation, %{Delta}({psi}), of 2.3%. The unfolded mean incident electron kinetic energies agree, on average, with the original values within 1.4%. A lowest transmission of only 10% still allows unfolding with %{Delta}({psi}) of 3.3%. Conclusions: In the presence of realistic experimental noise, the proposed approach significantly improves the accuracy and robustness of the spectral unfolding problem for all therapy and MV imaging beams of clinical interest.

61 RADIATION PROTECTION AND DOSIMETRY↗

Solving complex eigenvalue problems on a quantum annealer with applications to quantum scattering resonances

Quantum computing is a new and rapidly evolving paradigm for solving chemistry problems. In previous work, we developed the Quantum Annealer Eigensolver (QAE) and applied it to the calculation of the vibrational spectrum of a molecule on the D-Wave quantum annealer. However, the original QAE methodology was applicable to real symmetric matrices only. For many physics and chemistry problems, the diagonalization of complex matrices is required. For example, the calculation of quantum scattering resonances can be formulated as a complex eigenvalue problem where the real part of the eigenvalue is the resonance energy and the imaginary part is proportional to the resonance width. In the present work, we generalize the QAE to treat complex matrices: first complex Hermitian matrices and then complex symmetric matrices. These generalizations are then used to compute a quantum scattering resonance state in a 1D model potential for O + O collisions. These calculations are performed using both a software (classical) annealer and hardware annealer (the D-Wave 2000Q). The results of the complex QAE are also benchmarked against a standard linear algebra library (LAPACK). Furthermore, this work presents the first numerical solution of a complex eigenvalue problem of any kind on a quantum annealer, and it is the first treatment of a quantum scattering resonance on any quantum device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approximate l-fold cross-validation with Least Squares SVM and Kernel Ridge Regression

Kernel methods have difficulties scaling to large modern data sets. The scalability issues are based on computational and memory requirements for working with a large matrix. These requirements have been addressed over the years by using low-rank kernel approximations or by improving the solvers scalability. However, Least Squares Support VectorMachines (LS-SVM), a popular SVM variant, and Kernel Ridge Regression still have several scalability issues. In particular, the O(n^3) computational complexity for solving a single model, and the overall computational complexity associated with tuning hyperparameters are still major problems. We address these problems by introducing an O(n log n) approximate l-fold cross-validation method that uses a multi-level circulant matrix to approximate the kernel. In addition, we prove our algorithm s computational complexity and present empirical runtimes on data sets with approximately 1 million data points. We also validate our approximate method s effectiveness at selecting hyperparameters on real world and standard benchmark data sets. Lastly, we provide experimental results on using a multi-level circulant kernel approximation to solve LS-SVM problems with hyperparameters selected using our method.

Edwards, Richard E↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

Crowdsourcing the Frontier: Advancing Hybrid Physics‐ML Climate Simulation via a $\$$50,000 Kaggle Competition

Subgrid machine-learning (machine learning [ML]) parameterizations have the potential to introduce a new generation of climate models that incorporate the effects of higher-resolution physics without incurring the prohibitive computational cost associated with more explicit physics-based simulations. However, important issues, ranging from online instability to inconsistent online performance, have limited their operational use for long-term climate projections. To more rapidly drive progress in solving these issues, domain scientists and ML researchers opened up the offline aspect of this problem to the broader ML and data science community with the release of ClimSim, a NeurIPS Data sets and Benchmarks publication, and an associated Kaggle competition. This paper reports on the downstream results of the Kaggle competition by coupling emulators inspired by the winning teams' architectures to an interactive climate model (including full cloud microphysics, a regime historically prone to online instability) and systematically evaluating their online performance. Our results demonstrate that online stability in the low-resolution real-geography setting is reproducible across multiple diverse architectures, which we consider a key milestone. All tested architectures exhibit strikingly similar offline and online biases, though their responses to architecture-agnostic design choices (e.g., expanding the list of input variables) can differ significantly. Multiple Kaggle-inspired architectures achieve state-of-the-art results on certain metrics such as zonal mean bias patterns and global Root Mean Squared Error, indicating that crowdsourcing the essence of the offline problem is one path to improving online performance in hybrid physics-AI climate simulation.

Environmental sciences↗

Revisiting numerical real-space renormalization group for quantum lattice systems

Highlights: •A regularized scheme of the NRG algorithm is proposed. •The method overcomes the boundary obstacle in applying the NRG to quantum lattices. •Extension of the scheme to 2D lattices is illustrated. •Benchmark test on the Heisenberg antiferromagnet demonstrates its numerical validity. -- Abstract: Although substantial progress has been achieved in solving quantum impurity problems, the numerical renormalization group (NRG) method generally performs poorly when applied to quantum lattice systems in a real-space blocking form. The approach was thought to be unpromising for most lattice systems owing to its flaw in dealing with the boundaries of the block. Here the discovery of intrinsic prescriptions to cure interblock interactions is proposed which is able to clear up the boundary obstacle in applying the NRG to quantum lattice systems. While the resulting RG transformation turns out to be strict in the thermodynamic limit, benchmark tests of the algorithm on a one-dimensional Heisenberg antiferromagnet and a two-dimensional tight-binding model demonstrate its numerical efficiency in resolving low-energy spectra for finite lattice systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementation of a Mesh refinement algorithm into the quasi-static PIC code QuickPIC

Plasma-based acceleration (PBA) has emerged as a promising candidate for the accelerator technology used to build a future linear collider and/or an advanced light source. In PBA, a trailing or witness particle beam is accelerated in the plasma wave wakefield (WF) created by a laser or particle beam driver. The WF is often nonlinear and involves the crossing of plasma particle trajectories in real space and thus particle-in-cell methods are used. The distance over which the drive beam evolves is several orders of magnitude larger than the wake wavelength. This large disparity in length scales is amenable to the quasi-static approach. Three-dimensional (3D), quasi-static (QS), particle-in-cell (PIC) codes, e.g., QuickPIC, have been shown to provide high fidelity simulation capability with 2-4 orders of magnitude speedup over 3D fully explicit PIC codes. In PBA, the witness beam needs to be matched to the focusing forces of the WF to reduce the emittance growth. In some linear collider designs, the matched spot size of the witness beam can be 2 to 3 orders of magnitude smaller than the spot size (and wavelength) of the wakefield. Such an additional disparity in length scales is ideal for mesh refinement where the WF within the witness beam is described on a finer mesh than the rest of the WF. A mesh refinement scheme is described that has been implemented into the 3D QS PIC code, QuickPIC. Very fine (high) resolution is used in a small spatial region that includes the witness beam and progressively coarser resolutions in the rest of the simulation domain. A fast multigrid Poisson solver has been implemented for the field solve on the refined meshes and a Fast Fourier Transform (FFT) based Poisson solver is used for the coarse mesh. The code has been parallelized with both MPI and OpenMP, and the parallel scalability has also been improved by using pipelining. A preliminary adaptive mesh refinement technique is described to optimize the computational time for simulations with an evolving witness beam size. Several test problems are used to verify that the mesh refinement algorithm provides accurate results. Additionally, the results are benchmarked against highly resolved simulations exhibiting near-azimuthal symmetry, performed using QPAD—a novel hybrid QS PIC code that uses a PIC description in the coordinates (r, ct – z) and a gridless description in the azimuthal angle, Φ.

Linear collider↗

Electromagnetic full-$f$ gyrokinetics in the tokamak edge with discontinuous Galerkin methods

Here, we present an energy-conserving discontinuous Galerkin scheme for the full-f electromagnetic gyrokinetic system in the long-wavelength limit. We use the symplectic formulation and solve directly for ∂A II /∂t, the inductive component of the parallel electric field, using a generalized Ohm’s law derived directly from the gyrokinetic equation. Linear benchmarks are performed to verify the implementation and show that the scheme avoids the Amp`ere cancellation problem. We perform a nonlinear electromagnetic simulation in a helical open-field-line system as a rough model of the tokamak scrape-off layer using parameters from the National Spherical Torus Experiment (NSTX). This is the first published nonlinear electromagnetic gyrokinetic simulation on open field lines. Comparisons are made to a corresponding electrostatic simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Numerical simulation of a relativistic magnetron using a fluid electron model

An approach to numerically modeling relativistic magnetrons, in which the electrons are represented with a relativistic fluid, is described. A principal effect in the operation of a magnetron is space-charge-limited (SCL) emission of electrons from the cathode. We have developed an approximate SCL emission boundary condition for the fluid electron model. This boundary condition prescribes the flux of electrons as a function of the normal component of the electric field on the boundary. Here we show the results of a benchmarking activity that applies the fluid SCL boundary condition to the one-dimensional Child–Langmuir diode problem and a canonical two-dimensional diode problem. Simulation results for a two-dimensional A6 magnetron are then presented. Computed bunching of the electron cloud occurs and coincides with significant microwave power generation. Numerical convergence of the solution is considered. Sharp gradients in the solution quantities at the diocotron resonance, spanning an interval of three to four grid cells in the most well-resolved case, are present and likely affect convergence.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Machine learning to alleviate Hubbard-model sign problems

Lattice Monte Carlo calculations of interacting systems on nonbipartite lattices exhibit an oscillatory imaginary phase known as the phase or sign problem, even at zero chemical potential. One method to alleviate the sign problem is to analytically continue the integration region of the state variables into the complex plane via holomorphic flow equations. For asymptotically large flow times, the state variables approach manifolds of constant imaginary phase known as Lefschetz thimbles. Furthermore, flowing such variables and calculating the ensuing Jacobian is a computationally demanding procedure. In this paper, we demonstrate that neural networks can be trained to parametrize suitable manifolds for this class of sign problem and drastically reduce the computational cost for different severely afflicted small volume systems. In particular, we apply our method to the Hubbard model on the triangle and tetrahedron, both of which are nonbipartite. At strong interaction strengths and modest temperatures, the tetrahedron suffers from a severe sign problem that cannot be overcome with standard reweighting techniques, while it quickly yields to our method. We benchmark our results with exact calculations and comment on future directions of this work.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Automated Variance Reduction Applied to Nuclear Well-Logging Problems

The Monte Carlo method enables detailed, explicit geometric, energy and angular representations, and hence is considered to be the most accurate method available for solving complex radiation transport problems. Because of its associated accuracy, the Monte Carlo method is widely used in the petroleum exploration industry to design, benchmark, and simulate nuclear well-logging tools. Nuclear well-logging tools, which contain neutron and/or gamma sources and two or more detectors, are placed in boreholes that contain water (and possibly other fluids) and that are typically surrounded by a formation (e.g., limestone, sandstone, calcites, or a combination). The response of the detectors to radiation returning from the surrounding formation is used to infer information about the material porosity, density, composition, and associated characteristics. Accurate computer simulation is a key aspect of this exploratory technique. However, because this technique involves calculating highly precise responses (at two or more detectors) based on radiation that has interacted with the surrounding formation, the transport simulations are computationally intensive, requiring significant use of variance reduction techniques, parallel computing, or both. Because of the challenging nature of these problems, nuclear well-logging problems have frequently been used to evaluate the effectiveness of variance reduction techniques (e.g., Refs. 1-4). The primary focus of these works has been on improving the computational efficiency associated with calculating the response at the most challenging detector location, which is typically the detector furthest from the source. Although the objective of nuclear well-logging simulations is to calculate the response at multiple detector locations, until recently none of the numerous variance reduction methods/techniques has been well-suited to simultaneous optimization of multiple detector (tally) regions. Therefore, a separate calculation is typically performed for each desired detector response. This paper summarizes recent work to apply and evaluate the effectiveness of deterministic-adjoint-based variance reduction methods, including a recently developed method for simultaneous optimization of multiple detectors, for two simple nuclear well-logging tool problems that have been widely used in the variance reduction literature. The computational effectiveness of the method for simultaneous optimization is also compared to the use of multiple, individually optimized simulations for these simple well-logging problems.

02 PETROLEUM↗

Increasing the hardness of posiform planting using random QUBOs for programmable quantum annealer benchmarking

Posiform planting is a method for constructing QUBO instances with a unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investigate making posiform planted QUBOs computationally harder by fusing many smaller random Ising models, whose global minimum is computed classically, with posiform planted QUBOs. The unique ground state of the resulting QUBO is the concatenation of (exactly one of) the ground states of each smaller problem. Our method generates QUBO instances that have a unique solution, are native to the hardware graph, and have tunable computational hardness. We use our QUBOs to benchmark three D-Wave quantum annealing processors (with 563–5627 qubits), and compare them against simulated annealing and Gurobi. Surprisingly, we find that the D-Wave ground state sampling success rate is not dependent on the glued random QUBO size, and that some QUBO classes are solved at high success rates at short annealing times on the Zephyr processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ORNL Neutron Cross-Section Measurements in the Resolved Resonance Range for the NCSP

Nuclear criticality simulations test the quality and the consistency of the existing nuclear evaluated data libraries such as ENDF/B, JEFF, or JENDL. In some cases, the cross-section evaluations of those libraries are found insufficient to describe accurately criticality benchmarks. The US Nuclear Criticality Safety Program (NCSP) collaborates with the Joint Research Center (JRC) in Geel, Belgium, to perform high-resolution neutron-induced cross section measurements at the Geel Linear Accelerator (GELINA) to resolve deficiencies in nuclear data that have been emerging in criticality calculations. Problems with nuclear data include insufficient neutron energy range, missing covariances, and problems with previous experiments. For example, the use of the ENDF/B-VII.1 neutron cross section data for vanadium, cerium and zirconium in nuclear criticality safety calculations shows discrepancies between benchmark calculations measurements and demonstrates the need for reliable covariance data. For new covariances of existing data, a reevaluation of the old cross section data is needed. However, these data are in many cases no longer available. This deficit can be overcome only by obtaining new experimental data to serve as the basis of a new evaluation. Recent measurements were made of the neutron total and capture cross sections of natural vanadium and natural zirconium in the neutron energy range from 100 eV to several hundred keV. These measured data will be used to improve representation of the cross sections since most of the available evaluated data rely on old measurements.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗