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 865 records · Page 48

Albany/FELIX: A parallel, scalable and robust, finite element, first-order Stokes approximation ice sheet solver built for advanced analysis

This paper describes a new parallel, scalable and robust finite element based solver for the first-order Stokes momentum balance equations for ice flow. The solver, known as Albany/FELIX , is constructed using the component-based approach to building application codes, in which mature, modular libraries developed as a part of the Trilinos project are combined using abstract interfaces and template-based generic programming, resulting in a final code with access to dozens of algorithmic and advanced analysis capabilities. Following an overview of the relevant partial differential equations and boundary conditions, the numerical methods chosen to discretize the ice flow equations are described, along with their implementation. The results of several verification studies of the model accuracy are presented using (1) new test cases for simplified two-dimensional (2-D) versions of the governing equations derived using the method of manufactured solutions, and (2) canonical ice sheet modeling benchmarks. Model accuracy and convergence with respect to mesh resolution are then studied on problems involving a realistic Greenland ice sheet geometry discretized using hexahedral and tetrahedral meshes. Also explored as a part of this study is the effect of vertical mesh resolution on the solution accuracy and solver performance. The robustness and scalability of our solver on these problems is demonstrated. Lastly, we show that good scalability can be achieved by preconditioning the iterative linear solver using a new algebraic multilevel preconditioner, constructed based on the idea of semi-coarsening.

54 ENVIRONMENTAL SCIENCES↗

Adiabatic Quantum Programming: Minor Embedding With Hard Faults

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.

graph theory↗

Distributed Parallel Particle Advection using Work Requesting

Particle advection is an important vector field visualization technique that is difficult to apply to very large data sets in a distributed setting due to scalability limitations in existing algorithms. In this paper, we report on several experiments using work requesting dynamic scheduling which achieves balanced work distribution on arbitrary problems with minimal communication overhead. We present a corresponding prototype implementation, provide and analyze benchmark results, and compare our results to an existing algorithm.

97 MATHEMATICS AND COMPUTING↗

A Hybrid Monte Carlo-Deterministic Method for Global Binary Stochastic Medium Transport Problems

Global deep-penetration transport problems are difficult to solve using traditional Monte Carlo techniques. In these problems, the scalar flux distribution is desired at all points in the spatial domain (global nature), and the scalar flux typically drops by several orders of magnitude across the problem (deep-penetration nature). As a result, few particle histories may reach certain regions of the domain, producing a relatively large variance in tallies in those regions. Implicit capture (also known as survival biasing or absorption suppression) can be used to increase the efficiency of the Monte Carlo transport algorithm to some degree. A hybrid Monte Carlo-deterministic technique has previously been developed by Cooper and Larsen to reduce variance in global problems by distributing particles more evenly throughout the spatial domain. This hybrid method uses an approximate deterministic estimate of the forward scalar flux distribution to automatically generate weight windows for the Monte Carlo transport simulation, avoiding the necessity for the code user to specify the weight window parameters. In a binary stochastic medium, the material properties at a given spatial location are known only statistically. The most common approach to solving particle transport problems involving binary stochastic media is to use the atomic mix (AM) approximation in which the transport problem is solved using ensemble-averaged material properties. The most ubiquitous deterministic model developed specifically for solving binary stochastic media transport problems is the Levermore-Pomraning (L-P) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the Levermore-Pomraning equations and another Monte Carlo algorithm (Algorithm B) that is more accurate as a result of improved local material realization modeling. Recent benchmark studies have shown that Algorithm B is often significantly more accurate than Algorithm A (and therefore the L-P model) for deep penetration problems such as examined in this paper. In this research, we investigate the application of a variant of the hybrid Monte Carlo-deterministic method proposed by Cooper and Larsen to global deep penetration problems involving binary stochastic media. To our knowledge, hybrid Monte Carlo-deterministic methods have not previously been applied to problems involving a stochastic medium. We investigate two approaches for computing the approximate deterministic estimate of the forward scalar flux distribution used to automatically generate the weight windows. The first approach uses the atomic mix approximation to the binary stochastic medium transport problem and a low-order discrete ordinates angular approximation. The second approach uses the Levermore-Pomraning model for the binary stochastic medium transport problem and a low-order discrete ordinates angular approximation. In both cases, we use Monte Carlo Algorithm B with weight windows automatically generated from the approximate forward scalar flux distribution to obtain the solution of the transport problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement of Turbulent Flow Phenomena for the Lower Plenum of a Prismatic Gas-Cooled Reactor

Mean velocity field and turbulence data are presented that measure turbulent flow phenomena in an approximately 1:7 scale model of a region of the lower plenum of a typical prismatic gas-cooled reactor (GCR) similar to a General Atomics design (Gas-Turbine-Modular Helium Reactor). The datawere obtained in the Matched-Index-of-Refraction (MIR) facility at Idaho National Laboratory (INL) and are offered as a benchmark for assessing computational fluid dynamics (CFD) software. This experiment has been selected as the first Standard Problem endorsed by the Generation IV International Forum. The primary objective of this paper is to document the experiment and present a sample of the data set that has been established for this standard problem. Present results concentrate on the region of the lower plenum near its far reflector wall (away from the outlet duct). The flowin the lower plenum consists of multiple jets injected into a confined crossflow—with obstructions. The model consists of a row of full circular posts along its centerline with half-posts on the two parallel walls to approximate flow scaled to that expected from the staggered parallel rows of posts in the reactor design. Posts, side walls and end walls are fabricated from clear, fused quartz to match the refractive index of the mineral oil working fluid so that optical techniques may be employed for the measurements. The benefit of the MIR technique is that it permits optical measurements to determine flow characteristics in complex passages and around objects to be obtained without locating intrusive transducers that will disturb the flow field and without distortion of the optical paths. An advantage of the INL system is its large size, leading to improved spatial and temporal resolution compared to similar facilities at smaller scales. A three-dimensional (3D) particle image velocimetry (PIV) system was used to collect the data. Inlet-jet Reynolds numbers (based on the hydraulic diameter of the jet and the timemean average flow rate) are approximately 4300 and 12,400. Uncertainty analysis and a discussion of the standard problem are included. The measurements reveal complicated flow patterns that include several large recirculation zones, reverse flow near the simulated reflector wall, recirculation zones in the upper portion of the plenum and complex flow patterns around the support posts. Data include three-dimensional PIV images of flow planes, data displays along the coordinate planes (slices) and presentations that describe the component flows at specific regions in the model.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers

The linear equations that arise in interior methods for constrained optimization are sparse symmetric indefinite, and they become extremely ill-conditioned as the interior method converges. These linear systems present a challenge for existing solver frameworks based on sparse LU or LDL T decompositions. Here, we benchmark five well known direct linear solver packages on CPU- and GPU-based hardware, using matrices extracted from power grid optimization problems. The achieved solution accuracy varies greatly among the packages. None of the tested packages delivers significant GPU acceleration for our test cases. For completeness of the comparison we include results for MA57, which is one of the most efficient and reliable CPU solvers for this class of problem.

97 MATHEMATICS AND COMPUTING↗

Inverse deep learning methods and benchmarks for artificial electromagnetic material design

In this work we investigate the use of deep inverse models (DIMs) for designing artificial electromagnetic materials (AEMs) – such as metamaterials, photonic crystals, and plasmonics – to achieve some desired scattering properties (e.g., transmission or reflection spectrum). DIMs are deep neural networks (i.e., deep learning models) that are specially-designed to solve ill-posed inverse problems. There has recently been tremendous growth in the use of DIMs for solving AEM design problems however there has been little comparison of these approaches to examine their absolute and relative performance capabilities. In this work we compare eight state-of-the-art DIMs on three unique AEM design problems, including two models that are novel to the AEM community. Our results indicate that DIMs can rapidly produce accurate designs to achieve a custom desired scattering on all three problems. Although no single model always performs best, the Neural-Adjoint approach achieves the best overall performance across all problem settings. As a final contribution we show that not all AEM design problems are ill-posed, and in such cases a conventional deep neural network can perform better than DIMs. We recommend that a deep neural network is always employed as a simple baseline approach when addressing AEM design problems. Furthermore, we publish python code for our AEM simulators and our DIMs to enable easy replication of our results, and benchmarking of new DIMs by the AEM community.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the emerging potential of quantum annealing hardware for combinatorial optimization

Abstract Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not provide an irrefutable performance gain over state-of-the-art optimization methods. However, as this hardware continues to evolve, each new iteration brings improved performance and warrants further benchmarking. To that end, this work conducts an optimization performance assessment of D-Wave Systems’ Advantage Performance Update computer, which can natively solve sparse unconstrained quadratic optimization problems with over 5,000 binary decision variables and 40,000 quadratic terms. We demonstrate that classes of contrived problems exist where this quantum annealer can provide run time benefits over a collection of established classical solution methods that represent the current state-of-the-art for benchmarking quantum annealing hardware. Although this work does not present strong evidence of an irrefutable performance benefit for this emerging optimization technology, it does exhibit encouraging progress, signaling the potential impacts on practical optimization tasks in the future.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Verification and benchmarking relativistic electron beam transport through a background gas

It is necessary to establish confidence in high-consequence codes containing an extensive suite of physics algorithms in the regimes of interest. Verification problems allow code developers to assess numerical accuracy and increase confidence that specific sets of model physics were implemented correctly in the code. The two main verification techniques are code verification and solution verification. In this work, we present verification problems that can be used in other codes to increase confidence in simulations of relativistic beam transport. Specifically, we use the general plasma code EMPIRE to model and compare with the analytical solution to the evolution of the outer radial envelope of a relativistic charged particle beam. Additionally, we also outline a benchmark test of a relativistic beam propagating through a vacuum and pressurized gas cell, and present the results between EMPIRE and the hybrid code GAZEL. Further, we discuss the subtle errors that were caught with these problems and detail lessons learned.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗

A brief update of angle-resolved photoemission spectroscopy on a correlated electron system

In this paper, we briefly summarize the capabilities of state-of-the-art angle-resolved photoemission spectroscopy (ARPES) in the field of experimental condensed matter physics. Due to the advancement of the detector technology and the high flux light sources, ARPES has become a powerful tool to study the low energy excitations of solids, especially those novel quantum materials in which many-body physics are at play. To benchmark today's state-of-the-art ARPES technique, we demonstrate that the precision of today's ARPES has advanced to a regime comparable to the bulk-sensitive de Haas-van Alphen (dHvA) measurements. Finally, as an example of new discoveries driven by the advancement of the ARPES technique, we summarize some of our recent ARPES measurements on underdoped high-T{sub c} superconducting cuprates, which have provided further insight into the complex pseudogap problem.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Physics-Informed Generative Adversarial Networks for Stochastic Differential Equations

We developed a new class of physics-informed generative adversarial networks (PI-GANs) to solve forward, inverse, and mixed stochastic problems in a unified manner based on a limited number of scattered measurements. Unlike standard GANs relying solely on data for training, here we encoded into the architecture of GANs the governing physical laws in the form of stochastic differential equations (SDEs) using automatic differentiation. In particular, we applied Wasserstein GANs with gradient penalty (WGAN-GP) for its enhanced stability compared to vanilla GANs. We first tested WGAN-GP in approximating Gaussian processes of different correlation lengths based on data realizations collected from simultaneous reads at sparsely placed sensors. We obtained good approximation of the generated stochastic processes to the target ones even if there is a mismatch between the input noise dimensionality and the effective dimensionality of the target stochastic processes. We also studied the overfitting issue for both the discriminator and the generator, and we found that overfitting occurs also in the generator in addition to the discriminator as previously reported. Subsequently, we considered the solution of elliptic SDEs requiring approximations of three stochastic processes, namely the solution, the forcing, and the diffusion coefficient. Here again, we assumed data collected from simultaneous reads at a limited number of sensors for the multiple stochastic processes. Furthermore, three generators were used for the PI-GANs: two of them were feed forward deep neural networks (DNNs), while the other one was the neural network induced by the SDE. For the case where we have one group of data, we employed one feed forward DNN as the discriminator, while for the case of multiple groups of data we employed multiple discriminators in PI-GANs. We solved forward, inverse, and mixed problems without changing the framework of PI-GANs, obtaining both the means and the standard deviations of the stochastic solution and the diffusion coefficient in good agreement with benchmarks. In this work, we have demonstrated the effectiveness of PI-GANs in solving SDEs for about 120 dimensions. In principle, PI-GANs could tackle very high dimensional problems given more sensor data with low-polynomial growth in computational cost.

97 MATHEMATICS AND COMPUTING↗

Emulation of radiation transport in 3D stochastic media using 1D planar Monte Carlo stochastic media radiation transport algorithms

A subset of stochastic media radiation transport problems involves those in which radiation is incident on a thin slab of stochastic material. Particle tracking in 3D for such problems is expensive, and 1D planar models lack accuracy because they only allow the material to change in one dimension. Therefore, we propose dimensional emulation, which through a slight modification allows existing 1D planar geometry stochastic media radiation transport models to reproduce results from the equivalent 3D models by allowing the material to change in all three dimensions, reproducing the fidelity of the 3D model for the low computational cost of the 1D planar model. In this work, we apply dimensional emulation to three Monte Carlo stochastic media radiation transport models: Chord Length Sampling (CLS), the Local Realization Preserving method (LRP), and a variant of Conditional Point Sampling (CoPS). For a common Markovian benchmark set, the 3D emulation variants of these algorithms are numerically verified to reproduce the results of the 3D variants within statistics while running 1.3 to 2 times faster in the implementation within Sandia National Laboratories open-source research code PlaybookMC. The 3D emulation variants are also shown to yield a 72%–92% reduction in error for the thin slab problems in comparison to the 1D benchmark. As a result, the 3D emulation variant of CLS and CoPS-1 are shown to reproduce 3D CLS results that were used to approximate results for a 3D spherical inclusion geometry benchmark set.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Entropy-based viscous regularization for the multi-dimensional Euler equations in low-Mach and transonic flows

We present a new version of the entropy viscosity method, a viscous regularization technique for hyperbolic conservation laws, that is well-suited for low-Mach flows. By means of a low-Mach asymptotic study, new expressions for the entropy viscosity coefficients are derived. These definitions are valid for a wide range of Mach numbers, from subsonic flows (with very low Mach numbers) to supersonic flows, and no longer depend on an analytical expression for the entropy function. In addition, the entropy viscosity method is extended to Euler equations with variable area for nozzle flow problems. The effectiveness of the method is demonstrated using various 1-D and 2-D benchmark tests: flow in a converging–diverging nozzle; Leblanc shock tube; slow moving shock; strong shock for liquid phase; low-Mach flows around a cylinder and over a circular hump; and supersonic flow in a compression corner. Convergence studies are performed for smooth solutions and solutions with shocks present.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

El Agente: An autonomous agent for quantum chemistry

Computational chemistry tools are widely used to study the behavior of chemical phenomena. Yet, the complexity of these tools can make them inaccessible to non-specialists and challenging even for experts. In this work, we introduce El Agente Q, an LLM-based multi-agent system that dynamically generates and executes quantum chemistry workflows from natural language user prompts. The system is built on a novel cognitive architecture featuring a hierarchical memory framework that enables flexible task decomposition, adaptive tool selection, post-analysis, and autonomous file handling and submission. El Agente Q is benchmarked on six university-level course exercises and two case studies, demonstrating robust problem-solving performance (averaging >87% task success) and adaptive error handling through in situ debugging. It also supports longer-term, multi-step task execution for more complex workflows, while maintaining transparency through detailed action trace logs. Together, these capabilities lay the foundation for increasingly autonomous and accessible quantum chemistry.

agentic systems↗

Continual learning in the presence of repetition

Continual learning (CL) provides a framework for training models in ever-evolving environments. Although re-occurrence of previously seen objects or tasks is common in real-world problems, the concept of repetition in the data stream is not often considered in standard benchmarks for CL. Unlike with the rehearsal mechanism in buffer-based strategies, where sample repetition is controlled by the strategy, repetition in the data stream naturally stems from the environment. This report provides a summary of the CLVision challenge at CVPR 2023, which focused on the topic of repetition in class-incremental learning. The report initially outlines the challenge objective and then describes three solutions proposed by finalist teams that aim to effectively exploit the repetition in the stream to learn continually. The experimental results from the challenge highlight the effectiveness of ensemble-based solutions that employ multiple versions of similar modules, each trained on different but overlapping subsets of classes. This report underscores the transformative potential of taking a different perspective in CL by employing repetition in the data stream to foster innovative strategy design.

Class-incremental learning↗

Modernizing the active neutron collar poison rod correction using simulations to enhance PWR fresh fuel verification

The declared inventory of 235 U in fresh, low enriched uranium, nuclear fuel assemblies is routinely verified by nuclear safeguards inspectorates using the UNCL (Uranium Neutron Collar – Light Water Reactor Fuel) nondestructive assay instrument. The trend in modern fuels is towards higher initial enrichment, which in turn requires a larger number of burnable poison pins with higher Gadolinia concentration to hold down the initial reactivity. UNCL assay error for modern fuel assemblies typically exceeds 10%. The traditional algorithm used to correct the response for burnable poison content needs revision to achieve accuracy comparable to the $\sigma_\text{R}$ of 4.5% expected for poison-free assemblies. Here we review the problem and use a large set of 287 Monte Carlo simulations based on an experimentally benchmarked model corresponding to the 16×16 PWR array used in Brazilian Angra type II and III fuel. Simulated relative responses are used to evaluate the functional form of the poison correction and determine parameters optimal for 16×16 PWR assemblies. This update is conducted using between 4–24 Gadolinia pins ranging 2–11 wt% Gd 2 O 3 with assemblies having mean enrichments ranging 2.5%–5%. Experimental validation of the updated coefficients using seven measurements shows bias is reduced by an order of magnitude and $\sigma_\text{R}$R reduced from 10% to less than 2%. Two updated sets of coefficients are provided, the most accurate of which is directly useable in the existing analysis code (INCC) in use by inspectorate at fuel fabrication facilities.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Efficient simulation of moiré materials using the density matrix renormalization group

Here we present an infinite density-matrix renormalization group (DMRG) study of an interacting continuum model of twisted bilayer graphene (tBLG) near the magic angle. Because of the long-range Coulomb interaction and the large number of orbital degrees of freedom, tBLG is difficult to study with standard DMRG techniques - even constructing and storing the Hamiltonian already poses a major challenge. To overcome these difficulties, we use a recently developed compression procedure to obtain a matrix product operator representation of the interacting tBLG Hamiltonian which we show is both efficient and accurate even when including the spin, valley, and orbital degrees of freedom. To benchmark our approach, we focus mainly on the spinless, single-valley version of the problem where, at half filling, we find that the ground state is a nematic semimetal. Remarkably, we find that the ground state is essentially a k-space Slater determinant, so that Hartree-Fock and DMRG give virtually identical results for this problem. Our results show that the effects of long-range interactions in magic angle graphene can be efficiently simulated with DMRG and open up a new route for numerically studying strong correlation physics in spinful, two-valley tBLG, and other moiré materials in future work.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗