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 883 records · Page 49

VERA BWR progression problems

During the first phase of the Consortium for Advanced Simulation of Light Water Reactors (CASL) program, the Virtual Environment for Reactor Applications (VERA) was developed with a focus on capabilities for high-fidelity, multiphysics simulation of pressurized water reactors (PWRs). During this development effort, a set of progression problems was created ranging from smaller pin cell calculations to larger 3D full-core calculations. These progression problems helped to guide the development of the software and served as benchmarks against which to test VERA. Since 2019, efforts have been made to extend the capabilities of VERA to model boiling water reactors (BWRs). Because BWR simulations come with many unique challenges, a set of BWR progression problems was developed to aid in this new effort. The BWR progression problems range from 2D lattice calculations to 3D mini-core problems, and reference neutronic solutions were computed using continuous-energy Monte Carlo codes. MPACT, one of the neutronics code in VERA, was benchmarked using the BWR progression problems. The code is capable of computing solutions to all problems. The eigenvalues computed by MPACT agree well with the Monte Carlo reference solutions. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Benchmark of Advanced Burner Test Reactor Model Using MCNPX 2.6.0 and ERANOS 2.1

Significant research is currently being performed whereby fast reactor cores have been designed to burn transuranic materials reducing the volume and long-term radiotoxicity of spent nuclear fuel. These core and depletion models depend on various computer codes. This research used MCNPX 2.6.0 and ERANOS 2.1 to model a standard 250MWt Advanced Burner Test Reactor (ABTR) core. The intent was to benchmark criticality and burnup results from a stochastic Monte Carlo code and a deterministic depletion code using a standard ABTR model created by Argonne National Laboratory. Because each of these codes solve the transport and burnup problem differently, there is a need to benchmark the core models in order to verify results and identify root causes for significant differences in results between codes. Flux calculations in ERANOS were performed using diffusion theory, Legendre polynomial approximations (using the VARIANT module) and discrete ordinates methods. The k-effective for the higher-order transport models remained within 1000 pcm of the MCNPX model. The difference between the total heavy nuclide mass balance in ERANOS using the various flux calculations and the MCNPX depletion model was less than 0.4% out to a burnup of 1095 days (67.45 GWd/MTHM). For individual heavy nuclides, the depletion models closely matched (< 5.0 % difference) throughout the depletion for isotopes of Uranium, Neptunium and Plutonium and most of the higher transuranics. Notable exceptions were 242Am, 242Cm, 243Cm and 246Cm where differences ranged from 0.1 – 0.2% after 26 days and increased to 11 - 136% at 1095 days.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Unstructured Grid Development for the Space Launch System Liftoff and Transition Lineloads Computational Analysis

Production of aerodynamic lineloads databases for the Space Launch System (SLS) vehicle at Liftoff and Transition (LOT) conditions has required the development of a Computational Fluid Dynamics (CFD) workflow capable of producing high-quality solutions for this unique phase of flight. Aerodynamic considerations included a wide range of flow angles (from 0°up to 90°total angle of attack), resulting leeside separation, and interaction effects between the three bodies of the integrated SLS vehicle, as well as the nearby launch tower. Computational mesh development for similar problems at the NASA Langley Research Center (such as for the Constellation/Ares launch vehicles) has primarily relied on in-house tools such as VGRID/POSTGRID, with grids designed for NASA-developed and maintained flow solvers such as USM3D and FUN3D. The workflow for such problems has evolved over the development of the various SLS configurations to incorporate new tools such as the Heldenpatch/Heldenmesh grid generator (Helden Aerospace) and CREATE-AV Kestrel (US Department of Defense) flow solver. This paper describes efforts to benchmark a grid generation approach for LOT problems using Heldenpatch/Heldenmesh and Kestrel, verified against prior best practices from VGRID/POSTGRID. Parameters studied include surface grid density, first-layer viscous cell height, and volume grid growth rate parameters. Resulting solutions are compared based on total force and moment values, sectional line loads, and surface pressures, all validated against existing wind tunnel aerodynamic databases where available for the SLS Block 1B Cargo configuration.

Space launch systems↗

The Heuristic Static Load-Balancing Algorithm Applied to the Community Earth System Model

We propose to use the heuristic static loadbalancing (HSLB) algorithm for solving load-balancing problems in the Community Earth System Model (CESM), a climate model, using fitted benchmark data as an alternative to the current manual approach. The problem of allocating the optimal number of CPU cores to CESM components is formulated as a mixed-integer nonlinear optimization problem which is solved by using an optimization branch-and-bound solver implemented in the MINLP package MINOTAUR. The key feature of the branch-and- bound method is that it guarantees to provide an optimal solution or show that none exists. Our algorithm was tested for the 1 degrees and 1/8 degrees resolution simulations on 32,768 nodes (131,072 cores) of IBM Blue Gene/P where we consistently achieved well load-balanced results. This work is a part of a broader effort to eliminate the need for manual tuning of the code for each platform and simulation type, improve the performance and scalability of CESM, and develop automated tools to achieve these goals.

Alekseev, Yury↗

Applications of perturbation techniques

Two perturbation techniques were applied to two singular perturbation problems in heat transfer to obtain uniformly valid solutions which can serve as benchmarks for finite difference and finite element techniques. In the first problem, the method of strained parameters coupled with the application of a solvability condition is used to obtain a uniform solution for the problem of unsteady heat conduction in a long nearly circular cylinder. In the second problem, the method of matched asymptotic expansion coupled with Van Dyke's matching principle is used to obtain a uniform solution for the problem of one dimensional conduction-convection heat transfer of a uniform fluid flow.

Kandil, O. A.↗

Machine Learning Moment Closure Models for the Radiative Transfer Equation III: Enforcing Hyperbolicity and Physical Characteristic Speeds

This is the third paper in a series in which we develop machine learning (ML) moment closure models for the radiative transfer equation. In our previous work (Huang et al. in J Comput Phys 453:110941, 2022), we proposed an approach to learn the gradient of the unclosed high order moment, which performs much better than learning the moment itself and the conventional $P_N$ closure. However, while the ML moment closure has better accuracy, it is not able to guarantee hyperbolicity and has issues with long time stability. In our second paper (Huang et al., in: Machine learning moment closure models for the radiative transfer equation II: enforcing global hyperbolicity in gradient based closures, 2021. arXiv:2105.14410), we identified a symmetrizer which leads to conditions that enforce that the gradient based ML closure is symmetrizable hyperbolic and stable over long time. The limitation of this approach is that in practice the highest moment can only be related to four, or fewer, lower moments. In this paper, we propose a new method to enforce the hyperbolicity of the ML closure model. Motivated by the observation that the coefficient matrix of the closure system is a lower Hessenberg matrix, we relate its eigenvalues to the roots of an associated polynomial. Here, we design two new neural network architectures based on this relation. The ML closure model resulting from the first neural network is weakly hyperbolic and guarantees the physical characteristic speeds, i.e., the eigenvalues are bounded by the speed of light. The second model is strictly hyperbolic and does not guarantee the boundedness of the eigenvalues. Several benchmark tests including the Gaussian source problem and the two-material problem show the good accuracy, stability and generalizability of our hyperbolic ML closure model.

97 MATHEMATICS AND COMPUTING↗

Surface tension models for a multi-material ALE code with AMR

A number of surface tension models have been implemented in a 3D multi-physics multi-material code, ALE–AMR, which combines Arbitrary Lagrangian Eulerian (ALE) hydrodynamics with Adaptive Mesh Refinement (AMR). ALE–AMR is unique in its ability to model hot radiating plasmas, cold fragmenting solids, and most recently, the deformation of molten material. The surface tension models implemented include a diffuse interface approach with special numerical techniques to remove parasitic flow and a height function approach in conjunction with a volume-fraction interface reconstruction package. These surface tension models are benchmarked with a variety of test problems. In conclusion, based on the results, the height function approach using volume fractions was chosen to simulate droplet dynamics associated with extreme ultraviolet (EUV) lithography.

42 ENGINEERING↗

Robust second-order approximation of the compressible Euler equations with an arbitrary equation of state

Here, this paper is concerned with the approximation of the compressible Euler equations supplemented with an arbitrary or tabulated equation of state. The proposed approximation technique is robust, formally second-order accurate in space, invariant-domain preserving, and works for every equation of state, tabulated or analytic, provided the pressure is nonnegative. An entropy surrogate functional that grows across shocks is proposed. The numerical method is verified with novel analytical solutions and then validated with several computational benchmarks seen in the literature including problems with composite waves.

97 MATHEMATICS AND COMPUTING↗

A two-layer approach to the coupled coherent states method

In this paper, a two-layer scheme is outlined for the coupled coherent states (CCS) method, dubbed two-layer CCS (2L-CCS). The theoretical framework is motivated by that of the multiconfigurational Ehrenfest method, where different dynamical descriptions are used for different subsystems of a quantum mechanical system. This leads to a flexible representation of the wavefunction, making the method particularly suited to the study of composite systems. It was tested on a 20-dimensional asymmetric system-bath tunnelling problem, with results compared to a benchmark calculation, as well as existing CCS, matching-pursuit/split-operator Fourier transform, and configuration interaction expansion methods. The two-layer method was found to lead to improved short and long term propagation over standard CCS, alongside improved numerical efficiency and parallel scalability. These promising results provide impetus for future development of the method for on-the-fly direct dynamics calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modified Newton-Raphson GRAPE methods for optimal control of spin systems

Quadratic convergence throughout the active space is achieved for the gradient ascent pulse engineering (GRAPE) family of quantum optimal control algorithms. We demonstrate in this communication that the Hessian of the GRAPE fidelity functional is unusually cheap, having the same asymptotic complexity scaling as the functional itself. This leads to the possibility of using very efficient numerical optimization techniques. In particular, the Newton-Raphson method with a rational function optimization (RFO) regularized Hessian is shown in this work to require fewer system trajectory evaluations than any other algorithm in the GRAPE family. This communication describes algebraic and numerical implementation aspects (matrix exponential recycling, Hessian regularization, etc.) for the RFO Newton-Raphson version of GRAPE and reports benchmarks for common spin state control problems in magnetic resonance spectroscopy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Identifying strengths and weaknesses of methods for computational network inference from single-cell RNA-seq data

Single-cell RNA-sequencing (scRNA-seq) offers unparalleled insight into the transcriptional programs of different cellular states by measuring the transcriptome of thousands of individual cells. An emerging problem in the analysis of scRNA-seq is the inference of transcriptional gene regulatory networks and a number of methods with different learning frameworks have been developed to address this problem. Here, we present an expanded benchmarking study of eleven recent network inference methods on seven published scRNA-seq datasets in human, mouse, and yeast considering different types of gold standard networks and evaluation metrics. We evaluate methods based on their computing requirements as well as on their ability to recover the network structure. We find that, while most methods have a modest recovery of experimentally derived interactions based on global metrics such as Area Under the Precision Recall curve, methods are able to capture targets of regulators that are relevant to the system under study. Among the top performing methods that use only expression were SCENIC, PIDC, MERLIN or Correlation. Addition of prior biological knowledge and the estimation of transcription factor activities resulted in the best overall performance with the Inferelator and MERLIN methods that use prior knowledge outperforming methods that use expression alone. We found that imputation for network inference did not improve network inference accuracy and could be detrimental. Comparisons of inferred networks for comparable bulk conditions showed that the networks inferred from scRNA-seq datasets are often better or at par with the networks inferred from bulk datasets. Our analysis should be beneficial in selecting methods for network inference. At the same time, this highlights the need for improved methods and better gold standards for regulatory network inference from scRNAseq datasets.

59 BASIC BIOLOGICAL SCIENCES↗

Security-Constrained Unit Commitment for Electricity Market: Modeling, Solution Methods, and Future Challenges

This paper summarizes the technical activities of the IEEE Task Force on Solving Large Scale Optimization Problems in Electricity Market and Power System Applications. This Task Force was established by the IEEE Technology and Innovation Subcommittee to first review the state-of-the-art of the security-constrained unit commitment (SCUC) business model, its mathematical formulation, and solution techniques in solving electricity market clearing problems. The Task Force then investigated the emerging challenges of future market clearing problems and presented efforts in building benchmark mathematical and business models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Monte Carlo estimation of an effect of uncertainties in initial data on solving the transport equation by means of the MCU code

A new version of the tally module of the MCU software package is developed in which the approach for taking directly into account the uncertainty in initial data is implemented that is recommended by the international standard on estimating the uncertainty in results of measuring (ISO 13005). The new module makes it possible to evaluate the effect of uncertainty in initial data (caused by technological tolerances in fabrication of structural members of the core) on neutronic characteristics of the reactor. The developed software is adapted to parallel computing with the use of multiprocessor computers, which significantly reduces the computation time: the parallelization coefficient is almost equal to 1. Testing is performed by examples of solving the problem on criticality for the Godiva benchmark experiment and also for the infinite lattice of fuel assemblies of the VVER-440, VVER-1000, and VVER-1200. The results of calculations of the uncertainty in neutronic characteristics (effective multiplication factor, fission reaction rate), which is caused by uncertainties in initial data due to technological tolerances, are compared (in the first case) to the published results obtained using the precision MCNP5 code and (in the second case) to those obtained by means of the RADAR engineering program. A good agreement of results is achieved for all cases.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Scaling laws in jet classification

We demonstrate the emergence of scaling laws in the benchmark top versus QCD jet classification problem in collider physics. Six distinct physically-motivated classifiers exhibit power-law scaling of the binary cross-entropy test loss as a function of training set size, with distinct power law indices. This result highlights the importance of comparing classifiers as a function of dataset size rather than for a fixed training set, as the optimal classifier may change considerably as the dataset is scaled up. We speculate on the interpretation of our results in terms of previous models of scaling laws observed in natural language and image datasets.

Batson, Joshua↗

Enabling the Broader Use of MOOSE for Nuclear Energy and Other Simulation

This Final Scientific and Technical Report summarizes work performed under the Phase IIA SBIR project “Enabling the Broader Use of MOOSE for Nuclear Energy and Other Simulation” (DE-SC0020906) from August 2023 through August 2025. The objective of the Phase IIA effort was to mature and harden capabilities developed during Phase II, with the goal of enabling practical interoperability between Coreform’s isogeometric analysis (IGA) technologies and the Multiphysics Object-Oriented Simulation Environment (MOOSE), while improving robustness, performance, and scalability for complex, nuclear-relevant geometries. Over the course of Phase IIA, the project established and validated an extraction-based interoperability pathway between Coreform tools and MOOSE. A combined mesh and matrix format was defined collaboratively with MOOSE developers and integrated into the solver, enabling standard MOOSE workflows to operate on data exported from Coreform’s IGA and Flex Representation Method (FRM) pipelines. Early demonstrations validated architectural compatibility using linear solid mechanics problems, while later efforts focused on benchmark testing and external use. By the end of the project period, engineers at BWXT were able to independently set up and execute a simulation using the Coreform–MOOSE workflow and provide direct feedback that informed further refinement. In parallel, substantial effort was devoted to improving the robustness of trimmed U-spline construction for complex CAD geometries. A growing test suite of nuclear-relevant models was compiled through collaboration with multiple stakeholders and used to drive extensive bug fixing and reliability improvements. These efforts resulted in improved robustness and performance, including the addition of fallback capabilities that enhance reliability when the underlying commercial CAD kernel fails. Performance-oriented work progressed later in the project, with the development and demonstration of methods to decompose complex geometries into structured subregions and updated data representations to support more efficient solver processing. Additionally, extensive enhancements to threadsafe parallel data structures and trimming operations established a foundation for scalable processing of large assemblies. Collaboration with Sandia National Laboratories on the SGM geometric modeling kernel advanced to a functioning interface test case, positioning the workflow for future kernel integration. Overall, the Phase IIA effort successfully transitioned the project from architectural proof-of-concept to externally exercised, solver-integrated capability, while clarifying remaining technical challenges related to standardization, performance optimization, and kernel integration.

42 ENGINEERING↗

Development of a New 47-Group Library for the CASL Neutronics Simulators

The CASL core simulator MPACT is under development for the neutronics and thermal-hydraulics coupled simulation for the pressurized light water reactors. The key characteristics of the MPACT code include a subgroup method for resonance self-shielding, and a whole core solver with a 1D/2D synthesis method. The ORNL AMPX/SCALE code packages have been significantly improved to support various intermediate resonance self-shielding approximations such as the subgroup and embedded self-shielding methods. New 47-group AMPX and MPACT libraries based on ENDF/B-VII.0 have been generated for the CASL core simulator MPACT of which group structure comes from the HELIOS library. The new 47-group MPACT library includes all nuclear data required for static and transient core simulations. This study discusses a detailed procedure to generate the 47-group AMPX and MPACT libraries and benchmark results for the VERA progression problems.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Krylov subspace iteration for eigenvalue response matrix calculations

Recent work has revisited the eigenvalue response matrix method as an approach for reactor core analyses. In its most straightforward form, the method consists of a two-level Eigen problem. An outer Picard iteration updates the k-eigenvalue, while the inner Eigen problem imposes current continuity between coarse meshes. In this paper, several Eigen solvers are evaluated for this inner problem, using several 2-D diffusion benchmarks as test cases. The results indicate both the explicitly-restarted Arnoldi and the Krylov-Schur methods are up to an order of magnitude more efficient than power iteration. This increased efficiency makes the nested eigenvalue formulation more effective than the ILU-preconditioned Newton-Krylov formulation previously studied. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Toward a Benchmark for Multi-Threaded Testing Tools

Looking for intermittent bugs is a problem that has been getting prominence in testing. Multi-threaded code is becoming very common, mostly on the server side. As there is no silver bullet solution, research focuses on a variety of partial solutions. We outline a road map for combining the research on the different disciplines of testing multi-threaded programs and on evaluating its quality. The project goals are to create a benchmark that can be used to evaluate different solutions, to create a framework with open API's that enables combining techniques in the multithreading domain, and to create a focus for the research in this area around which a community of people who try to solve similar problems with different techniques, could congregate. The benchmark, apart from containing programs with documented bugs, includes other artifacts, such as traces, that are used for evaluating some of the technologies. We have started creating such a bench mrk and detail the lesson learned in the process. The framework will enable technology developers, for example, race detectors, to concentrate on their components and use other ready made components, (e.g., instrumentor) to create a testing solution.

Eytani, Yaniv↗