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,081 records · Page 60

Performance of biologically inspired algorithms tuned on TiO 2 nanoparticle benchmark system

Biologically inspired optimization algorithms (BIOA), such as particle swarm optimization (PSO) and differential evolution (DE), are often applied to a specific problem with the tacit assumptions that each algorithm will have a unique set of “ideal” tuning parameters that provide “best” performance, and that, once tuned, two different optimization algorithms ought to exhibit distinct performance. This work tests those assumptions by systematically comparing PSO and DE applied to identify stable and metastable configurations of a benchmark system, a titania dimer Ti 2 O 4 , whose energy is described by a modified Matsui-Akaogi pairwise potential. The hypotheses (H) are formally expressed as: (H1) for both PSO and DE there exists a unique, optimal set of tuning parameters that maximize its performance on a given problem; (H2) when running two different BIOAs, one algorithm must demonstrate superior performance over the other. By identifying and studying an approximate Pareto-optimal set of tuning parameters for DE and PSO, H1 is shown to be strictly false for DE, and tentatively false for PSO, while H2 is shown to be false with respect to certain statistics. Here, we further investigate the correlations between key tuning parameters and algorithm performance. Our conclusion may be implemented to further optimize and develop BIOAs applied to materials systems.

36 MATERIALS SCIENCE↗

Complete Assembly of Circular and Chloroplast Genomes Based on Global Optimization

This paper focuses on the last two stages of genome assembly, namely scaffolding and gap-filling, and shows that they can be solved as part of a single optimization problem. Our approach is based on modeling genome assembly as a problem of finding a simple path in a specific graph that satisfies as many as possible of the distance constraints encoding the insert-size information. We formulate it as a mixed-integer linear programming problem and apply an optimization solver to find the exact solutions on a benchmark of chloroplasts. We show that the presence of repetitions in the set of unitigs is the main reason for the existence of multiple equivalent solutions that are associated to alternative subpaths. We also describe two sufficient conditions and we design efficient algorithms for identifying these subpaths. Comparisons of the results achieved by our tool with the ones obtained with recent assemblers are presented.

59 BASIC BIOLOGICAL SCIENCES↗

Development of a RIA Experimental Benchmark for BISON

This milestone report documents FY-17 efforts for the Reactivity Initiated Accident (RIA) Challenge Problem to demonstrate PWR RIA Fuel Performance capability. The challenge problem implementation plan identified a series of experimental comparisons to validate RIA capability in BISON. The specific cases chosen for FY-17 are CABRI REP Na-2, 3, 5, and 10. Work was also performed on the Nuclear Safety Research Reactor (NSRR) FK-1, 2, 3, 4, 5, 6, 7, 8, and 9 cases.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

T-Junction Benchmark

Part 1: Two different volume renderings of fluid temperatures in a turbulent T-junction mixing problem at Reynolds number Re=40,000. Part 2: Volume rendering of fluid temperatures in a turbulent T-junction mixing problem at Reynolds number Re=40,000, simulated using Nek5000 at three different resolutions. Part 3: Temperature distribution for a turbulent T-junction mixing problem at Reynolds number Re=40,000, simulated using Nek5000 with 89056 spectral elements of order N=9 (65 million grid points). Credits: Science: Aleks Obabko and Paul Fisher, Argonne National Laboratory. Visualization: Hank Childs, Lawrence Berkeley National Laboratory

42 ENGINEERING↗

Analytic Sensitivity Coefficients for General Multigroup Infinite Medium k-Eigenvalue Problems

This work presents a general set of equations that can be used to rapidly generate new benchmarks to verify nuclear data sensitivity calculations. The general multigroup infinite medium k-eigenvalue neutron transport equation is used to derive analytic expressions for the infinite medium k-eigenvalue, the scalar neutron flux and adjoint flux, and the sensitivity of k∞ to perturbations in the multigroup nuclear data of a single species, isotropic and elastic scattering, material. The multigroup nuclear data for U-235 and U-238 is presented along with their corresponding k-eigenvalues, forward flux, adjoint flux, and sensitivity profiles, which include the sensitivity of k∞ to the total, fission, capture, and scattering macroscopic cross sections as well as to the group-to-group scattering cross section matrix, group-wise fission neutron production, and the unconstrained and constrained fission neutron energy distribution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Benchmarking blockchain-based gene-drug interaction data sharing methods: A case study from the iDASH 2019 secure genome analysis competition blockchain track

Blockchain distributed ledger technology is just starting to be adopted in genomics and healthcare applications. Despite its increased prevalence in biomedical research applications, skepticism regarding the practicality of blockchain technology for real-world problems is still strong and there are few implementations beyond proof-of-concept. We focus on benchmarking blockchain strategies applied to distributed methods for sharing records of gene-drug interactions. We expect this type of sharing will expedite personalized medicine. We generated gene-drug interaction test datasets using the Clinical Pharmacogenetics Implementation Consortium (CPIC) resource. We developed three blockchain-based methods to share patient records on gene-drug interactions: Query Index, Index Everything, and Dual-Scenario Indexing. We achieved a runtime of about 60 s for importing 4,000 gene-drug interaction records from four sites, and about 0.5 s for a data retrieval query. Our results demonstrated that it is feasible to leverage blockchain as a new platform to share data among institutions.

60 APPLIED LIFE SCIENCES↗

Groundwater flow and heat transport for systems undergoing freeze-thaw: Intercomparison of numerical simulators for 2D test cases

In high-elevation, boreal and arctic regions, hydrological processes and associated water bodies can be strongly influenced by the distribution of permafrost. Recent field and modeling studies indicate that a fully-coupled multidimensional thermo-hydraulic approach is required to accurately model the evolution of these permafrost-impacted landscapes and groundwater systems. However, the relatively new and complex numerical codes being developed for coupled non-linear freeze-thaw systems require verification. Here in this paper, this issue is addressed by means of an intercomparison of thirteen numerical codes for two-dimensional test cases with several performance metrics (PMs). These codes comprise a wide range of numerical approaches, spatial and temporal discretization strategies, and computational efficiencies. Results suggest that the codes provide robust results for the test cases considered and that minor discrepancies are explained by computational precision. However, larger discrepancies are observed for some PMs resulting from differences in the governing equations, discretization issues, or in the freezing curve used by some codes.

54 ENVIRONMENTAL SCIENCES↗

Applications of physics informed neural operators

Abstract We present a critical analysis of physics-informed neural operators (PINOs) to solve partial differential equations (PDEs) that are ubiquitous in the study and modeling of physics phenomena using carefully curated datasets. Further, we provide a benchmarking suite which can be used to evaluate PINOs in solving such problems. We first demonstrate that our methods reproduce the accuracy and performance of other neural operators published elsewhere in the literature to learn the 1D wave equation and the 1D Burgers equation. Thereafter, we apply our PINOs to learn new types of equations, including the 2D Burgers equation in the scalar, inviscid and vector types. Finally, we show that our approach is also applicable to learn the physics of the 2D linear and nonlinear shallow water equations, which involve three coupled PDEs. We release our artificial intelligence surrogates and scientific software to produce initial data and boundary conditions to study a broad range of physically motivated scenarios. We provide the source code , an interactive website to visualize the predictions of our PINOs, and a tutorial for their use at the Data and Learning Hub for Science .

97 MATHEMATICS AND COMPUTING↗

Non-linear Model Predictive Control of Wave Energy Converters with Realistic Power Take-off Configurations and Loss Model

Model Predictive Control (MPC) has been recognized as a well-developed control strategy for optimizing the performance of wave energy converters (WECs). The standard problem involves maximizing the absorbed power from oncoming waves while respecting motion constraints of the device and force constraints of the power take-off (PTO). The generated electrical power is then calculated by assuming an ideal PTO with no power conversion losses or limitations to power flow. In this article, we remove the assumption of an ideal PTO and present four different control options that reflect unique combinations of PTO control and power flow constraints. We also recast the MPC problem to maximize the generated power instead of the absorbed power by accounting for the losses in the power train. Using a WEC with a hydraulic PTO, we develop a loss model suitable for controls optimization. Lastly, we illustrate the process of setting up the non-linear MPC problem and compare the performance of competing control strategies using a common benchmark based on annual energy captured at a reference site.

16 TIDAL AND WAVE POWER↗

Distributionally Robust Decision Making Leveraging Conditional Distributions

Distributionally robust optimization (DRO) is a powerful tool for decision making under uncertainty. It is particularly appealing because of its ability to leverage existing data. However, many practical problems call for decision-making with some auxiliary information, and DRO in the context of conditional distributions is not straightforward. We propose a conditional kernel distributionally robust optimization (CKDRO) method that enables robust decision making under conditional distributions through kernel DRO and the conditional mean operator in the reproducing kernel Hilbert space (RKHS). In particular, we consider problems where there is a correlation between the unknown variable y and an auxiliary observable variable x. Given past data of the two variables and a queried auxiliary variable, CKDRO represents the conditional distribution P(y|x) as the conditional mean operator in the RKHS space and quantifies the ambiguity set in the RKHS as well, which depends on the size of the dataset as well as the query point. To justify the use of RKHS, we demonstrate that the ambiguity set defined in RKHS can be viewed as a ball under a metric that is similar to the Wasserstein metric. The DRO is then dualized and solved via a finite dimensional convex program. The proposed CKDRO approach is applied to a generation scheduling problem and shows that the result of CKDRO is superior to common benchmarks in terms of quality and robustness.

Chen, Yuxiao↗

Canonical and Noncanonical Hamiltonian Operator Inference

SAND2024-08577O Canonical and Noncanonical Hamiltonian Operator Inference is research code that applies old and new model reduction algorithms to well-known and publicly available "toy" problems. It applies operator inference (OpInf) methods for model reduction to several benchmark hyperbolic partial differential equations: linear wave, Korteweg-de Vries, Benjamin-Bona-Mahoney, and linear elasticity. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗

Applying Physics-Informed Neural Networks to Solve Navier–Stokes Equations for Laminar Flow around a Particle

In recent years, Physics-Informed Neural Networks (PINNs) have drawn great interest among researchers as a tool to solve computational physics problems. Unlike conventional neural networks, which are black-box models that “blindly” establish a correlation between input and output variables using a large quantity of labeled data, PINNs directly embed physical laws (primarily partial differential equations) within the loss function of neural networks. By minimizing the loss function, this approach allows the output variables to automatically satisfy physical equations without the need for labeled data. The Navier–Stokes equation is one of the most classic governing equations in thermal fluid engineering. This study constructs a PINN to solve the Navier–Stokes equations for a 2D incompressible laminar flow problem. Flows passing around a 2D circular particle are chosen as the benchmark case, and an elliptical particle is also examined to enrich the research. The velocity and pressure fields are predicted by the PINNs, and the results are compared with those derived from Computational Fluid Dynamics (CFD). Additionally, the particle drag force coefficient is calculated to quantify the discrepancy in the results of the PINNs as compared to CFD outcomes. The drag coefficient maintained an error within 10% across all test scenarios.

Hu, Beichao (ORCID:0009000163215151)↗

Engine dynamic analysis with general nonlinear finite element codes. II - Bearing element implementation, overall numerical characteristics and benchmarking

Second-year efforts within a three-year study to develop and extend finite element (FE) methodology to efficiently handle the transient/steady state response of rotor-bearing-stator structure associated with gas turbine engines are outlined. The two main areas aim at (1) implanting the squeeze film damper element into a general purpose FE code for testing and evaluation; and (2) determining the numerical characteristics of the FE-generated rotor-bearing-stator simulation scheme. The governing FE field equations are set out and the solution methodology is presented. The choice of ADINA as the general-purpose FE code is explained, and the numerical operational characteristics of the direct integration approach of FE-generated rotor-bearing-stator simulations is determined, including benchmarking, comparison of explicit vs. implicit methodologies of direct integration, and demonstration problems.

Padovan, J.↗

Testing New Programming Paradigms with NAS Parallel Benchmarks

Over the past decade, high performance computing has evolved rapidly, not only in hardware architectures but also with increasing complexity of real applications. Technologies have been developing to aim at scaling up to thousands of processors on both distributed and shared memory systems. Development of parallel programs on these computers is always a challenging task. Today, writing parallel programs with message passing (e.g. MPI) is the most popular way of achieving scalability and high performance. However, writing message passing programs is difficult and error prone. Recent years new effort has been made in defining new parallel programming paradigms. The best examples are: HPF (based on data parallelism) and OpenMP (based on shared memory parallelism). Both provide simple and clear extensions to sequential programs, thus greatly simplify the tedious tasks encountered in writing message passing programs. HPF is independent of memory hierarchy, however, due to the immaturity of compiler technology its performance is still questionable. Although use of parallel compiler directives is not new, OpenMP offers a portable solution in the shared-memory domain. Another important development involves the tremendous progress in the internet and its associated technology. Although still in its infancy, Java promisses portability in a heterogeneous environment and offers possibility to "compile once and run anywhere." In light of testing these new technologies, we implemented new parallel versions of the NAS Parallel Benchmarks (NPBs) with HPF and OpenMP directives, and extended the work with Java and Java-threads. The purpose of this study is to examine the effectiveness of alternative programming paradigms. NPBs consist of five kernels and three simulated applications that mimic the computation and data movement of large scale computational fluid dynamics (CFD) applications. We started with the serial version included in NPB2.3. Optimization of memory and cache usage was applied to several benchmarks, noticeably BT and SP, resulting in better sequential performance. In order to overcome the lack of an HPF performance model and guide the development of the HPF codes, we employed an empirical performance model for several primitives found in the benchmarks. We encountered a few limitations of HPF, such as lack of supporting the "REDISTRIBUTION" directive and no easy way to handle irregular computation. The parallelization with OpenMP directives was done at the outer-most loop level to achieve the largest granularity. The performance of six HPF and OpenMP benchmarks is compared with their MPI counterparts for the Class-A problem size in the figure in next page. These results were obtained on an SGI Origin2000 (195MHz) with MIPSpro-f77 compiler 7.2.1 for OpenMP and MPI codes and PGI pghpf-2.4.3 compiler with MPI interface for HPF programs.

Jin, H.↗

Assessment of PCMI Simulation Using the Multidimensional Multiphysics BISON Fuel Performance Code

Since 2008, the Idaho National Laboratory (INL) has been developing a next-generation nuclear fuel performance code called BISON. BISON is built using INL’s Multiphysics Object-Oriented Simulation Environment, or MOOSE. MOOSE is a massively parallel, finite element-based framework to solve systems of coupled non-linear partial differential equations using the Jacobian-FreeNewton Krylov (JFNK) method. MOOSE supports the use of complex two- and three-dimensional meshes and uses implicit time integration, which is important for the widely varied time scales in nuclear fuel simulation. MOOSE’s object-oriented architecture minimizes the programming required to add new physics models. BISON has been applied to various nuclear fuel problems to assess the accuracy of its 2D and 3D capabilities. The benchmark results used in this assessment range from simulation results from other fuel performance codes to measurements from well-known and documented reactor experiments. An example of a well-documented experiment used in this assessment is the Third Risø Fission Gas Project, referred to as “Bump Test GE7”, which was performed on rod ZX115. This experiment was chosen because it allows for an evaluation of several aspects of the code, including fully coupled thermo-mechanics, contact, and several nonlinear material models. Bump Test GE7 consists of a base-irradiation period of a full-length rod in the Quad-Cities-1 BWR for nearly 7 years to a burnup of 4.17% FIMA. The base irradiation test is followed by a “bump test” of a sub-section of the original rod. The bump test takes place in the test reactor DR3 at Risø in a water-cooled HP1 rig under BWR conditions where the power level is increased by about 50% over base irradiation levels in the span of several hours. During base irradiation, the axial power profile is flat. During the bump test, the axial power profile changes so that the bottom half of the rod is at approximately 50% higher power than at the base irradiation level, while the power at the top of the rod is at about 20% of the base irradiation power level. 2D BISON simulations of the Bump Test GE7 were run using both discrete and smeared pellet geometry. Comparisons between these calculations and experimental measurements are presented for clad diameter and elongation after the base irradiation and clad profile along the length of the test section after the bump test. Preliminary comparisons between calculations and measurements are favorable, supporting the use of BISON as an accurate multiphysics fuel simulation tool.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Developing And Scaling an OpenFOAM Model to Study Turbulent Flow in a HFIR Coolant Channel

Improving the understanding of how computational fluid dynamics (CFD) direct numerical simulations (DNS) of flows in the High Flux Isotope Reactor (HFIR) perform when run in parallel using the high performance computing (HPC) platform Summit at the Oak Ridge Leadership Computing Facility (OLCF) is of particular importance to boost the computational tools used to support HFIR conversion to low enriched fuel (LEU). Evaluation of scaling performance was driven by the increasing importance of graphics processing unit (GPU) usage in HPC, which is becoming the standard for modern supercomputers such as Summit. The desired results are to obtain a strong positive correlation between the computational resources dedicated to a problem and the relative speed-up of the simulation in comparison to a benchmark. This capability will allow substantially improvement in HFIR flow analytical capabilities, specifically when predicting turbulence properties at high Reynolds numbers. The study leverages previous simulation results performed with code PHASTA (finite element) on HPC platforms Cori (NERSC) and Theta (ALCF) [1] with computing options provided in the computing platform OpenFOAM (finite volume) at OLCF. Transitioning from PHASTA to OpenFOAM will (1) eliminate dependence on third-party software for mesh generation and manipulation, (2) reduce resource needs by employing modern architectures, and (3) build expertise for future modeling of HFIR-specific problems like heat transfer in involute geometry, entrance effects, flow structure in channel corners, and so on—all important issues when defining the available thermal margins in the transition to LEU. CPUs and GPUs differ significantly in their architecture and utilization, as discussed in the literature [2]. The most important differences are in the approach to computations and their memory. A single GPU contains a large quantity of cores, enabling it to perform with a much higher throughput than a CPU, but execution requires a different approach. GPU codes execute instructions using the Single-Instruction Multiple-Thread (SIMT) approach in which a single instruction is used for groups of threads called warps. A warp typically consists of 32 threads which must execute the same set of instructions, although on separate threads. Alternately, a CPU has far fewer cores that are much more flexible in their operation, excelling at quickly performing more complex serial computations. This is why GPUs have greater throughput when properly utilized. The second important difference is seen when comparing their memory spaces. Limited memory allocations and CPU–GPU communications cause a significant bottleneck in GPU-accelerated programs. Further study was required to properly take advantage of GPU resources. A comprehensive analysis of code performance and the model-specific features of turbulence constitutes the core of this work. In this study, a DNS simulation of HFIR channel turbulence was performed with the finite volume CFD code OpenFOAM v2112 and CUDA v11.0 on Red Hat Enterprise Linux v8.2. The OpenFOAM installation had AMGx integrated to enable GPU acceleration and utilizes the PETSc4FOAM library. The computational resources and the problem size were scaled on CPU and CPU + GPU architectures to gain a better understanding of the performance of a DNS problem on modern computing hardware. The study aimed to analyze the scaling of the code exclusively on CPUs and then to examine the scaling of the codes with GPU acceleration enabled. Scaling studies included CPU and GPU acceleration on a mesh of varying resolution to analyze the impact of problem size relative to computational resources. In the course of preparing the GPU configuration on Summit, mainly using the AMGX solvers, difficulties were encountered stemming from constant changes resulting from extensive ongoing development activities and the changing environment. This resulted in the inability to complete the GPU portion of the work. The code was compiled and tested, but production runs to assess acceleration were not performed because the used discretional compute time allocation expired as year-end approached. The Summit HPC platform is scheduled for decommissioning in 2024, making it unattractive for future use with Nvidia-based GPUs. Therefore, the work will be moved onto NERSC machines in FY24. An application was prepared and submitted, and sufficient node-hours were awarded to continue the research in the next calendar year. This report summarizes work performed thus far, which mostly focused on CPU OpenFOAM computing.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Fast Reactor Physics Model Verification Studies using ARC and PyARC Workflows

PyARC was recently developed at Argonne National Laboratory to automate many of the tasks required in the ARC (Argonne Reactor Computation) fast reactor simulation workflow, from input file generation, code execution, data transfer between ARC codes, and output postprocessing. PyARC will likely be the path forward to train new users of the ARC codes with the goal of wide adoption by the national laboratories, academia, and industry. In particular, for the ANL-JAEA collaboration under the Civil Nuclear Working Group (CNWG) project agreement NE-01, PyARC will be used to model the Joyo and EBR-II reactors for comparisons with measured data and calculated results from JAEA (Task 3: Fast Reactor Fuel and Core). As an additional avenue for verification and validation, this report investigates the use of PyARC towards a variety of existing ARC-based reactor models, in order to understand its efficacy in replicating the behavior of base ARC codes and better understand any limitations within modeling realistic fast reactor problems. To this end, PyARC was used to model the Joyo MKI, RBEC Benchmark-M, PRISM Mod-B, and EBR-II Run 138B cores, and its results were compared to those from existing ARC-based models. It was found that for hexagonal-based geometries PyARC was able to replicate the behavior of ARC codes to within 10 pcm for small reactor cores, and ~150pcm difference in eigenvalue for larger cores. These discrepancies are attributed primarily to differences in local mesh refinement options between ARC and PyARC, which currently cannot be resolved with PyARC’s latest version (1.6.0). In some of these cases, PyARC was used to model steady-state problems with initial core compositions originating from a prior REBUS depletion calculation. While PyARC was not designed to support such steady-state calculations, workarounds were applied to replicate the behavior of ARC-based calculations as closely as possible. Thus, these results demonstrate the wide extent to which they can be applied to fast reactor problems while still providing immense benefit to the user in terms of automating and standardizing common routines within the fast reactor analysis workflow. This study concluded that PyARC will be suitable for modeling the steady-state conditions of the EBR-II and Joyo fast reactors as part of the CNWG project agreement.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗