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,153 records · Page 64

Numerical Solution of Incompressible Navier-Stokes Equations Using a Fractional-Step Approach

A fractional step method for the solution of steady and unsteady incompressible Navier-Stokes equations is outlined. The method is based on a finite volume formulation and uses the pressure in the cell center and the mass fluxes across the faces of each cell as dependent variables. Implicit treatment of convective and viscous terms in the momentum equations enables the numerical stability restrictions to be relaxed. The linearization error in the implicit solution of momentum equations is reduced by using three subiterations in order to achieve second order temporal accuracy for time-accurate calculations. In spatial discretizations of the momentum equations, a high-order (3rd and 5th) flux-difference splitting for the convective terms and a second-order central difference for the viscous terms are used. The resulting algebraic equations are solved with a line-relaxation scheme which allows the use of large time step. A four color ZEBRA scheme is employed after the line-relaxation procedure in the solution of the Poisson equation for pressure. This procedure is applied to a Couette flow problem using a distorted computational grid to show that the method minimizes grid effects. Additional benchmark cases include the unsteady laminar flow over a circular cylinder for Reynolds Numbers of 200, and a 3-D, steady, turbulent wingtip vortex wake propagation study. The solution algorithm does a very good job in resolving the vortex core when 5th-order upwind differencing and a modified production term in the Baldwin-Barth one-equation turbulence model are used with adequate grid resolution.

Kiris, Cetin↗

High-resolution Wave Propagation Method for Stratified Flows

The implementation of the multidimensional f-waves Riemann solver for the time-dependent, three-dimensional, nonhydrostatic, meso- and microscale atmospheric flows is described in detail. The Riemann solver employs flux-based wave decomposition (f-waves) for the calculation of Godunov fluxes in which the flux differences are written directly as the linear combination of the right eigenvectors of the hyperbolic system. The scheme incorporates the source term due to gravity without introducing discretization errors which is an important property in the context of atmospheric flows. The resulting flow solver is conservative, accurate, stable, and well-balanced. The implementation of the solver is evaluated using benchmark test cases for atmospheric dynamics.

Riemann problem↗

The inhibiting bisection problem.

Given a graph where each vertex is assigned a generation or consumption volume, we try to bisect the graph so that each part has a significant generation/consumption mismatch, and the cutsize of the bisection is small. Our motivation comes from the vulnerability analysis of distribution systems such as the electric power system. We show that the constrained version of the problem, where we place either the cutsize or the mismatch significance as a constraint and optimize the other, is NP-complete, and provide an integer programming formulation. We also propose an alternative relaxed formulation, which can trade-off between the two objectives and show that the alternative formulation of the problem can be solved in polynomial time by a maximum flow solver. Our experiments with benchmark electric power systems validate the effectiveness of our methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Roadmap for Molecular Benchmarks in Nonadiabatic Dynamics

Simulating the coupled electronic and nuclear response of a molecule to light excitation requires the application of nonadiabatic molecular dynamics. However, when faced with a specific photophysical or photochemical problem, selecting the most suitable theoretical approach from the wide array of available techniques is not a trivial task. The challenge is further complicated by the lack of systematic method comparisons and rigorous testing on realistic molecular systems. This absence of comprehensive molecular benchmarks remains a major obstacle to advances within the field of nonadiabatic molecular dynamics. A CECAM workshop, Standardizing Nonadiabatic Dynamics: Towards Common Benchmarks, was held in May 2024 to address this issue. This Perspective highlights the key challenges identified during the workshop in defining molecular benchmarks for nonadiabatic dynamics. Specifically, this work outlines some preliminary observations on essential components needed for simulations and proposes a roadmap aiming to establish, as an ultimate goal, a community-driven, standardized molecular benchmark set.

36 MATERIALS SCIENCE↗

Benchmark study of TRIPOLI-4 through experiment and MCNP codes

Reliability on simulation results is essential in nuclear physics. Although MCNP5 and MCNPX are the world widely used 3D Monte Carlo radiation transport codes, alternative Monte Carlo simulation tools exist to simulate neutral and charged particles' interactions with matter. Therefore, benchmark are required in order to validate these simulation codes. For instance, TRIPOLI-4.7, developed at the French Alternative Energies and Atomic Energy Commission for neutron and photon transport, now also provides the user with a full feature electron-photon electromagnetic shower. Whereas the reliability of TRIPOLI-4.7 for neutron and photon transport has been validated yet, the new development regarding electron-photon matter interaction needs additional validation benchmarks. We will thus demonstrate how accurately TRIPOLI-4's 'deposited spectrum' tally can simulate gamma spectrometry problems, compared to MCNP's 'F8' tally. The experimental setup is based on an HPGe detector measuring the decay spectrum of an {sup 152}Eu source. These results are then compared with those given by MCNPX 2.6d and TRIPOLI-4 codes. This paper deals with both the experimental aspect and simulation. We will demonstrate that TRIPOLI-4 is a potential alternative to both MCNPX and MCNP5 for gamma-electron interaction simulation. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

Support CEED-enabled ECP applications in their preparation for Aurora/Frontier

The goal of this milestone was to help CEED-enabled ECP applications (particularly ExaSMR, MARBL, ExaAM, ExaWind and E3SM) in their preparations for the Aurora and Frontier architectures. This work included collaboration with ECP vendors and porting and optimization of CEED’s benchmarks and miniapps to early access hardware. As part of this milestone, we also made the best bake-off problems and bake-off kernel implementation from Nek, MFEM, libParanumal and the external community available in the latest libCEED release, libCEED-0.7. During the milestone period we also organized, in virtual form, the fourth CEED Annual meeting (CEED4AM) which included representatives from ECP applications, vendors and software technology projects. The specific tasks addressed in this milestone were to: (1) Work with vendors to port and run CEED benchmarks on early access systems for Aurora and Frontier; (2) Make the best BP/BK implementations from Nek, MFEM, libParanumal and external community available in libCEED; (3) Organize the next CEED Annual meeting (CEED4AM); and (4) Optimize CEED applications and miniapps for Aurora and Frontier architectures. The artifacts delivered include the next libCEED release, libCEED-0.7, and a number of developments integrated within applications to improve their GPU performance and capabilities. See the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed for more details.

97 MATHEMATICS AND COMPUTING↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

97 MATHEMATICS AND COMPUTING↗

(U) Differences in the Use of Isotopic $χ$ Vectors Demonstrated with an Analytic k ∞ Problem (And Verification of SENSMG and MCNP6’s KSEN)

Comparisons of responses and first-order sensitivities of responses to the neutron fission spectrum ( χ ) have been done using different transport methods. Kodeli and Slavič compared sensitivities from Monte Carlo, deterministic, and method of characteristics of k eff in the SNEAK-7 benchmark, and the agreement was reasonable. Yamamoto compared deterministic and Monte Carlo sensitivities of k - and α -eigenvalues to the fission χ , but only for material (i.e. single-isotope) values of the fission χ . Haeck et al. compared Monte Carlo and deterministic sensitivities of k eff to the fission χ of individual isotopes for several benchmarks, and the agreement was excellent (except, strangely, for U-236). Kiedrowski and Brown compared Monte Carlo and analytic sensitivities of k ∞ to the fission χ in analytic problems, but only for material values of the fission χ .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Integrated EM & Thermal Simulations with Upgraded VORPAL Software

Nuclear physics accelerators are powered by microwaves which must travel in waveguides between room-temperature sources and the cryogenic accelerator structures. The ohmic heat load from the microwaves is affected by the temperature-dependent surface resistance and in turn affects the cryogenic thermal conduction problem. Integrated EM & thermal analysis of this difficult non-linear problem is now possible with the VORPAL finite-difference time-domain simulation tool. We highlight thermal benchmarking work with a complex HOM feed-through geometry, done in collaboration with researchers at the Thomas Jefferson National Accelerator Laboratory, and discuss upcoming design studies with this emerging tool. This work is part of an effort to generalize the VORPAL framework to include generalized PDE capabilities, for wider multi-physics capabilities in the accelerator, vacuum electronics, plasma processing and fusion R&D fields, and we will also discuss user interface and algorithmic upgrades which facilitate this emerging multiphysics capability.

43 PARTICLE ACCELERATORS↗

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 Vector Machines (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 hyper parameters are still major problems. We address these problems by introducing an O(nlog 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 one million data points. We also validate our approximate method's effectiveness at selecting hyper parameters 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 hyper parameters selected using our method.

Computer Science↗

Assessment of Model-Based Schemes for Accelerating Optimization by RAVEN

Nuclear-Renewable Hybrid Energy Systems (N-R HES) combine different energy technologies in a synergistic way with the objective of achieving a more economical energy production. In this report the particular hybrid system dealt with includes a PWR nuclear reactor, the associated Rankine-based energy conversion cycle (Balance of Plant, BOP), an Industrial Process (IP) for hydrogen production, a gas turbine (Second Energy Source, SES), and a battery (Energy Storage, ES). The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the N-R HES. HYBRID solves the coupled capacity planning-economic and dispatch optimization problem with the objective of minimizing the Levelized Cost of Electricity (LCOE). In the optimization of the power dispatch strategy, the HYBRID framework takes into account the time-dependent dynamics of each subsystem by including a Dymola object-oriented model of the process dynamics. To ease the computational burden of the optimization process, an initial guess for the dispatch optimization problem is provided by a preconditioner. The solution guess is calculated by means of a least-marginal cost approach which applies the same criterion behind the screening curve method. Though this algorithm allows evaluating an economically adapted generation mix for a target load duration curve within a few seconds, it neglects the constraints due to the single component dynamics, and it is not able to adequately represent the ES. An improved treatment of the pre-conditioner problem was addressed by introducing a Monte Carlo based optimization algorithm. The new approach takes into account limits on power rates for the system subcomponents, which was not previously done. Additionally, this new Monte-Carlo based preconditioner addresses the problem with the ES component through improved modeling of that component. The new algorithm has been implemented in the HYBRID framework and tested to assess its performance. The results obtained with the new Monte Carlobased preconditioner were benchmarked against those obtained through the reference deterministic approach. The comparison shows that the Monte-Carlo based approach provides improved solution accuracy to the power dispatch optimization problem. Also in this report, the treatment of the penalty function on LCOE is discussed, and an improved penalty function for missed demand is suggested and tested.

Maronati, Giovanni↗

Nonlinear quasisteady state benchmark of global gyrokinetic codes

Two global gyrokinetic codes are benchmarked against each other by comparing simulation results in the case of ion temperature gradient driven turbulence, in the adiabatic electron response limit. The two codes are the Eulerian code GENE and the Lagrangian particle-in-cell code ORB5 which solve the gyrokinetic equations. Linear results are presented, including growth rates, real frequencies, and mode structure comparisons. Nonlinear simulations without sources are carried out with particular attention to considering the same initial conditions, showing identical linear phase and first nonlinear burst. Very good agreement is also achieved between simulations obtained using a Krook-type heat source, which enables to reach a quasisteady state and thus to compare the heat diffusivity traces over a statistically meaningful time interval. For these nonlinear results, the radial zonal flow structure and shearing rate profile are also discussed. The very detailed comparisons presented may serve as reference for benchmarking other gyrokinetic simulation codes, in particular those which consider global geometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multiscale modeling and characterization for performance and safety of lithium-ion batteries

Lithium-ion batteries are highly complex electrochemical systems whose performance and safety are governed by coupled nonlinear electrochemical-electrical-thermal-mechanical processes over a range of spatiotemporal scales. Gaining an understanding of the role of these processes as well as development of predictive capabilities for design of better performing batteries requires synergy between theory, modeling, and simulation, and fundamental experimental work to support the models. This paper presents the overview of the work performed by the authors aligned with both experimental and computational efforts. In this paper, we describe a new, open source computational environment for battery simulations with an initial focus on lithium-ion systems but designed to support a variety of model types and formulations. This system has been used to create a three-dimensional cell and battery pack models that explicitly simulate all the battery components (current collectors, electrodes, and separator). The models are used to predict battery performance under normal operations and to study thermal and mechanical safety aspects under adverse conditions. This paper also provides an overview of the experimental techniques to obtain crucial validation data to benchmark the simulations at various scales for performance as well as abuse. We detail some initial validation using characterization experiments such as infrared and neutron imaging and micro-Raman mapping. In addition, we identify opportunities for future integration of theory, modeling, and experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sequential spectral line analysis for accurate density and temperature diagnosis of laboratory opacity measurements

The accuracy of iron opacity calculated in stellar interiors has been questioned since the discovery of the “solar problem” and the discrepancies between the measured and modeled iron opacity reported in 2015. Experimental opacity benchmarks require accurate temperature and density measurements, which were inferred by analyzing tracer magnesium spectra in those experiments. Could the observed discrepancy be explained by insufficient accuracy in the inferred temperature, density, and their uncertainties? Previous analyses may have yielded biased results due to three limitations: (1) simultaneous multi-line fitting, (2) approximations in line-shape models, and (3) exclusion of certain spectral lines due to insufficient background characterization. Notably, the first issue is a common concern for many inversion methods, including Bayesian inferences. We present a refined analysis method that overcomes these limitations, applied to three categories of iron opacity experiments (Anchor 1, 2, and 3). In particular, the sequential fitting method yields unbiased results with more realistic uncertainties by accounting for line inconsistencies in the parameter uncertainties. The average electron temperature and density values are 162 ± 6 eV and (7.0 ± 1.9) × 10 21 cm −3 for six Anchor 1 experiments, 189 ± 7 eV and (3.4 ± 0.3) × 10 22 cm −3 for 21 Anchor 2 experiments, and 201 ± 6 eV and (4.8 ± 1.1) × 10 22 cm −3 for nine Anchor 3 experiments. These results show ∼4% temperature and ∼20% density reproducibility over a decade, which also aligns with the inferred parameter uncertainties. In conclusion, the resulting temperature and density uncertainties lead to a quasi-continuum iron opacity variation of ±4%–7% for wavelengths below 9.5 Å, which is insufficient to explain the significant model-data discrepancies reported in 2015.

Absorption spectroscopy↗

Disentangling direct from indirect relationships in association networks

Networks are vital tools for understanding and modeling interactions in complex systems in science and engineering, and direct and indirect interactions are pervasive in all types of networks. However, quantitatively disentangling direct and indirect relationships in networks remains a formidable task. Here, we present a framework, called iDIRECT (Inference of Direct and Indirect Relationships with Effective Copula-based Transitivity), for quantitatively inferring direct dependencies in association networks. Using copula-based transitivity, iDIRECT eliminates/ameliorates several challenging mathematical problems, including ill-conditioning, self-looping, and interaction strength overflow. With simulation data as benchmark examples, iDIRECT showed high prediction accuracies. Application of iDIRECT to reconstruct gene regulatory networks in Escherichia coli also revealed considerably higher prediction power than the best-performing approaches in the DREAM5 (Dialogue on Reverse Engineering Assessment and Methods project, #5) Network Inference Challenge. In addition, applying iDIRECT to highly diverse grassland soil microbial communities in response to climate warming showed that the iDIRECT-processed networks were significantly different from the original networks, with considerably fewer nodes, links, and connectivity, but higher relative modularity. Further analysis revealed that the iDIRECT-processed network was more complex under warming than the control and more robust to both random and target species removal ( P < 0.001). As a general approach, iDIRECT has great advantages for network inference, and it should be widely applicable to infer direct relationships in association networks across diverse disciplines in science and engineering.

59 BASIC BIOLOGICAL SCIENCES↗

Spin-informed universal graph neural networks for simulating magnetic ordering

The screening and discovery of magnetic materials are hindered by the computational cost of first-principles density-functional theory (DFT) calculations required to find the ground state magnetic ordering. Although universal machine-learning interatomic potentials (uMLIPs), also known as atomistic foundation models, offer high-fidelity models of many atomistic systems with significant speedup, they currently lack the inputs required for predicting magnetic ordering. In this work, we present a data-efficient, spin-informed graph neural network framework that incorporates spin degrees of freedom as inputs and preserves physical symmetries, extending the functionality of uMLIPs to simulate magnetic orderings. This framework speeds up DFT calculations through better initial guesses for magnetic moments, determines the ground-state ordering of bulk materials and even generalizes to magnetic ordering in surfaces. Furthermore, we implement a closed-loop anomaly detection approach that effectively addresses the classic "chicken-and-egg" problem of creating a high-quality dataset while developing a uMLIP, unearthing anomalies in large benchmark datasets and boosting model accuracy.

Xu, Wenbin↗