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,189 records · Page 66

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↗

SatNet: A Benchmark for Satellite Scheduling Optimization

Satellites provide essential services such as networking and weather tracking, and the number of near-earth and deep space satellites are expected to grow rapidly in the coming years. Communications with terrestrial ground stations is one of the critical functionalities of any space mission. Satellite scheduling is a problem that has been scientifically investigated since the 1970s. A central aspect of this problem is the need to consider resource contention and satellite visibility constraints as they require line of sight. Due to the combinatorial nature of the problem, prior solutions such as linear programs and evolutionary algorithms require extensive compute capabilities to output a feasible schedule for each scenario. Machine learning based scheduling can provide an alternative solution by training a model with historical data and generating a schedule quickly with model inference. We present SatNet, a benchmark for satellite scheduling optimization based on historical data from the NASA Deep Space Network. We propose formulation of the satellite scheduling problem as a Markov Decision Process and use reinforcement learning (RL) policies to generate schedules. The nature of constraints imposed by SatNet differ from other combinatorial optimization problems such as vehicle routing studied in prior literature. Our initial results indicate that RL is an alternative optimization approach that can generate candidate solutions of comparable quality to existing state-of-the-practice results. However, we also find that RL policies overfit to the training dataset and do not generalize well to new data, thereby necessitating continued research on reusable and generalizable agents.

Wilson, Brian↗

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↗

Kolmogorov flow in two dimensional strongly coupled dusty plasma

Undriven, incompressible Kolmogorov flow in two dimensional doubly periodic strongly coupled dusty plasma is modelled using generalised hydrodynamics, both in linear and nonlinear regime. A complete stability diagram is obtained for low Reynolds numbers R and for a range of viscoelastic relaxation time τ{sub m} [0 < τ{sub m} < 10]. For the system size considered, using a linear stability analysis, similar to Navier Stokes fluid (τ{sub m} = 0), it is found that for Reynolds number beyond a critical R, say R{sub c}, the Kolmogorov flow becomes unstable. Importantly, it is found that R{sub c} is strongly reduced for increasing values of τ{sub m}. A critical τ{sub m}{sup c} is found above which Kolmogorov flow is unconditionally unstable and becomes independent of Reynolds number. For R < R{sub c}, the neutral stability regime found in Navier Stokes fluid (τ{sub m} = 0) is now found to be a damped regime in viscoelastic fluids, thus changing the fundamental nature of transition of Kolmogorov flow as function of Reynolds number R. A new parallelized nonlinear pseudo spectral code has been developed and is benchmarked against eigen values for Kolmogorov flow obtained from linear analysis. Nonlinear states obtained from the pseudo spectral code exhibit cyclicity and pattern formation in vorticity and viscoelastic oscillations in energy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NECP-Cypress: Development and Benchmarking of a 3D PWR Core-Analysis Code

As one of the key components of nuclear reactor design and safety analysis software for Pressurized Water Reactor (PWR), the advance of the core-analysis code indicates the nuclear power development of the corresponding country. Hence, Nuclear Engineering Computational Physics Lab. (NECP) developed a PWR core-analysis code NECP-Cypress. Currently, it contains several modules including a generalized cross section module, a diffusion module using the Variational Nodal Method (VNM), a depletion-calculation using the traditional macroscopic module, a thermal-hydraulics module solving the single channel heat transfer equation and 1D heat conduction equation. With the VNM employed, NECP-Cypress can eliminate the control rod cusping effect and provide a better pin power reconstruction. In this paper, we firstly introduce the modules of the code NECP-Cypress. Secondly, two large-scale PWR core benchmarks were employed to demonstrate the ability of the code by comparing with SIMULATE-3, including the BEAVRS problem and a pseudo CAP1400 reactor core problem. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Regularization by denoising diffusion models for solving inverse PDE problems with application to full waveform inversion

Partial differential equation (PDE)-governed inverse problems are fundamental across various scientific and engineering applications; yet they face significant challenges due to nonlinearity, ill-posedness, and sensitivity to noise. Here, we introduce a computational framework, regularization by denoising using diffusion models for partial differential equations (RED-DiffEq), by integrating physics-driven inversion and data-driven learning. RED-DiffEq leverages pretrained diffusion models as a regularization mechanism for PDE-governed inverse problems. We apply RED-DiffEq to solve the full waveform inversion problem in geophysics, a challenging seismic imaging technique that seeks to reconstruct high-resolution subsurface velocity models from seismic measurement data. Our method shows enhanced accuracy and robustness compared to benchmark methods. Additionally, it exhibits strong generalization and domain decomposition capacity, enabling the inversion of more complex velocity models with larger domains than those used in training the diffusion model. Our framework can also be directly applied to diverse PDE-governed inverse problems.

Shan, Siming [Yale University, New Haven, CT (Unit↗

Thickness-based adaptive mesh refinement methods for multi-phase flow simulations with thin regions

In numerical simulations of multi-scale, multi-phase flows, grid refinement is required to resolve regions with small scales. A notable example is liquid-jet atomization and subsequent droplet dynamics. It is essential to characterize the detailed flow physics with variable length scales with high fidelity, in order to elucidate the underlying mechanisms. In this paper, two thickness-based mesh refinement schemes are developed based on distance- and topology-oriented criteria for thin regions with confining wall/plane of symmetry and in any situation, respectively. Both techniques are implemented in a general framework with a volume-of-fluid formulation and an adaptive-mesh-refinement capability. The distance-oriented technique compares against a critical value, the ratio of an interfacial cell size to the distance between the mass center of the cell and a reference plane. The topology-oriented technique is developed from digital topology theories to handle more general conditions. The requirement for interfacial mesh refinement can be detected swiftly, without the need of thickness information, equation solving, variable averaging or mesh repairing. The mesh refinement level increases smoothly on demand in thin regions. The schemes have been verified and validated against several benchmark cases to demonstrate their effectiveness and robustness. These include the dynamics of colliding droplets, droplet motions in a microchannel, and atomization of liquid impinging jets. Overall, the thickness-based refinement technique provides highly adaptive meshes for problems with thin regions in an efficient and fully automatic manner.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On Distribution Grid Optimal Power Flow Development and Integration

Due to changes in electric distribution grid operation, new operation regimes have been recommended. Distribution grid optimal power flow (DOPF) has received tremendous attention in the research community, yet it has not been fully adopted across the utility industry. Our paper recognizes this problem and suggests a development and integration procedure for DOPF. We propose development of DOPF as a three step procedure of 1) processing the grid, 2) obtaining a tractable solution, and 3) implementing multiple solution algorithms and benchmarking them to improve application reliability. For the integration of DOPF, we demonstrate how a DOPF federate may be developed that can be integrated in a co-simulation environment to mimic the real-world conditions and hence improve its practicality to be deployed in the field. To demonstrate the efficacy of the proposed methods, tests on IEEE 123 bus system are performed where the usage of tractable formulation in DOPF algorithm development and its comparison to the benchmark solution are demonstrated.

Hanif, Sarmad↗

Low frequency eddy current finite element model validation and benchmark studies

A finite element method (FEM) model was created to calculate the change in impedance of a coil due to the presence of a notch in a plate. The rectangular notches were created via electrical discharge machining (EDM) in a thick aluminum plate and were positioned at normal and oblique angles (10, 20, and 30 degrees) with respect to the vertical axis of the coil. The FEM method was chosen for this model due to its ability to solve problems in complicated geometries with the use of irregular mesh elements to discretize the solution domain. The change in impedance was calculated from the field variables in the simulation for each probe position along the parallel axis of the plate. The error between the model and the experimental data was approximately 5% for the majority of cases. The validated model was used to investigate more complex problems.

42 ENGINEERING↗

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗

Collected notes from the Benchmarks and Metrics Workshop

In recent years there has been a proliferation of proposals in the artificial intelligence (AI) literature for integrated agent architectures. Each architecture offers an approach to the general problem of constructing an integrated agent. Unfortunately, the ways in which one architecture might be considered better than another are not always clear. There has been a growing realization that many of the positive and negative aspects of an architecture become apparent only when experimental evaluation is performed and that to progress as a discipline, we must develop rigorous experimental methods. In addition to the intrinsic intellectual interest of experimentation, rigorous performance evaluation of systems is also a crucial practical concern to our research sponsors. DARPA, NASA, and AFOSR (among others) are actively searching for better ways of experimentally evaluating alternative approaches to building intelligent agents. One tool for experimental evaluation involves testing systems on benchmark tasks in order to assess their relative performance. As part of a joint DARPA and NASA funded project, NASA-Ames and Teleos Research are carrying out a research effort to establish a set of benchmark tasks and evaluation metrics by which the performance of agent architectures may be determined. As part of this project, we held a workshop on Benchmarks and Metrics at the NASA Ames Research Center on June 25, 1990. The objective of the workshop was to foster early discussion on this important topic. We did not achieve a consensus, nor did we expect to. Collected here is some of the information that was exchanged at the workshop. Given here is an outline of the workshop, a list of the participants, notes taken on the white-board during open discussions, position papers/notes from some participants, and copies of slides used in the presentations.

Drummond, Mark E.↗

Code Benchmark of Depressurized Conduction Cooldown Transient in the High Temperature Test Facility

This paper presents results from modeling of a depressurized conduction cooldown (DCC) transient at the High Temperature Test Facility (HTTF) as part of the OECD-NEA Thermal Hydraulics Code Validation Benchmark for High-Temperature Gas-Cooled Reactors using HTTF Data . This paper briefly describes the benchmark and the models being used. It then presents a comparison of steady state and transient results based on the Problem 2 Exercise 1A and 1B definitions. We compare block and helium temperature distributions, mass flow distribution, and energy balance in steady state. All models show comparable mass flow distributions and energy balances. The temperatures within the core and outer regions are comparable in all models too, but inner reflector temperatures can vary significantly. Despite that, we find that the models are in good agreement for the full-power steady state. In the DCC, we look at block temperature at the core midplane and RCCS water exit temperature. The INL and ANL models are found to be in excellent agreement with one another on block temperature over time, while the agreement when the KAERI and NRG models are added into consideration is good. Differences in the transient heat removal from the RCCS cause the differences in block temperature over time in these models. The CNL models show similar trends to the INL, ANL, KAERI, and NRG models, but the temperatures are high because the volumes used in calculating the average temperature include the heater rods in the CNL models only. The HUN-REN model shows results that suggest significantly lower heat removal in the RCCS which merit further investigation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Benchmarking Quantum Processor Performance through Quantum Distance Metrics Over An Algorithm Suite

Quantum computing is poised to solve computational paradigms that classical computing could never feasibly reach. Tasks such as prime factorization to Quantum Chemistry are examples of classically difficult problems that have analogous algorithms that are sped up on quantum computers. To attain this computational advantage, we must first traverse the noisy intermediate scale quantum (NISQ) era, in which quantum processors suffer from compounding noise factors that can lead to unreliable algorithm induction producing noisy results. We describe QASMBench, a suite of QASM-level (Quantum assembly language) benchmarks that challenge all realisable angles of quantum processor noise. We evaluate a large portion of these algorithms by performing density matrix tomography on 14 IBMQ Quantum devices.

Stein, Samuel A.↗