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 793 records · Page 44

Three-dimensional continuum point cloud method for large deformation and its verification

This study presents a strong form based meshfree collocation method, which is named Continuum Point Cloud Method, to solve nonlinear field equations derived from classical mechanics for deformed bodies in three-dimensional Euclidean space. The method and its implementation are benchmarked against a nonlinear vector field using manufactured solutions. The analysis of mechanical fields firstly focuses on the study of St. Venant Kirchhoff and compressible neo-Hookean materials. Results for various initial boundary value problems are presented, including benchmark cases involving unidirectional tension and simple shear. Subsequently, the study concludes with an analysis of a displacement-controlled simulation of a compressible neo-Hookean material, specifically a bar that is pulled to 50% of its original length and rotated 90°. The pure tension case yields a 1.5% error in displacement between computed and expected values and a combined tension and torsion loading case provides further insight into material behavior under complex loading conditions. The resulting normal axial and transverse stress-strain curves are also presented. Lastly, the consistency and robustness of the proposed nonlinear numerical schemes are successfully demonstrated through various numerical experiments.

Compressible neo-Hookean materials↗

Local strain redistribution corrections for a simplified inelastic analysis procedure based on an elastic finite-element analysis

Strain redistribution corrections were developed for a simplified inelastic analysis procedure to economically calculate material cyclic response at the critical location of a structure for life prediction proposes. The method was based on the assumption that the plastic region in the structure is local and the total strain history required for input can be defined from elastic finite-element analyses. Cyclic stress-strain behavior was represented by a bilinear kinematic hardening model. The simplified procedure predicts stress-strain response with reasonable accuracy for thermally cycled problems but needs improvement for mechanically load-cycled problems. Neuber-type corrections were derived and incorporated in the simplified procedure to account for local total strain redistribution under cyclic mechanical loading. The corrected simplified method was used on a mechanically load-cycled benchmark notched-plate problem. The predicted material response agrees well with the nonlinear finite-element solutions for the problem. The simplified analysis computer program was 0.3% of the central processor unit time required for a nonlinear finite-element analysis.

Kaufman, A.↗

Creating Benchmark Data for Artificial Intelligence and Machine Learning Space Biology Research

To identify an appropriate AI/ML approach for a specific problem, the best practice is to measure algorithm performance through the benchmarking process. A scientific benchmark consists of an AI-ready dataset and a reference implementation on a specific scientific question. The NASA Science Mission Directorate (SMD) has started the “Benchmark Initiative for AI/ML to create scientific benchmark datasets in three applications: 1) scientific benchmarking, which finds the best algorithm for a specific problem; 2) application benchmarking, which measures algorithm performance against a set of parameters; and 3) system benchmarking, which evaluates performance of hardware and software architecture. Currently, there are no standardized datasets available to benchmark AI/ML algorithms in the domain of space biology. In this work, we constructed two AI/ML-ready biological datasets from experiments in space-flown mice: cellular imaging and RNA-seq. First, radiation-exposed immune cells harbor DNA damage foci that can be fluorescently marked to visualize the amount of damage following exposure to ionizing radiation. However, such large datasets are difficult to analyze visually, due to imaging inconsistencies and human bias, and classical image processing approaches can fail on imaging artifacts. AI/ML are therefore exciting alternative, providing the speed of machines and the accuracy of humans. We have made this dataset available at https://registry.opendata.aws/bps_microscopy/. Second, high-throughput nucleic acid sequencing (DNA-seq, RNA-seq) has become widespread in biomedical research due to the growing availability and affordability of these assays. However, most sequencing datasets suffer from high dimensionality and low sample count. In this work, we used a generative adversarial network to synthesize a standardized, AI-ready, publicly available benchmark dataset for space biology RNA-seq data with sufficient space-flown and ground control mouse liver samples from NASA GeneLab. This dataset is available at https://registry.opendata.aws/bps_rnaseq/. These datasets are now fully open the Space Biology community to test their favorite AI/ML approaches.

James Casaletto↗

Modified Closures in Monte Carlo Algorithms for Diffusive Binary Stochastic Media Transport Problems

In a 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 (BSM) is to use the atomic mix approximation in which the transport problem is solved using homogenized (volume-averaged) material properties. A common deterministic model developed for solving BSM particle transport problems is the Levermore-Pomraning (LP) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the LP equations and another Monte Carlo algorithm (Algorithm B) that locally preserves the sampled material realization; we refer to these Monte Carlo algorithms as the LP and LPLRP (LP local realization preserving) algorithms, respectively. One-dimensional (1D) planar geometry benchmark studies have shown that the LPLRP algorithm is often significantly more accurate than the LP algorithm for problems with an incident angular flux as well as for problems with an interior source. The LPLRP algorithm implementation in these benchmark comparisons made explicit use of the one-dimensional nature of the problem. The LP model is derived by assuming an 'upwind' closure in the coupling term relating the two materials in a binary stochastic medium. Su and Pomraning developed a modified form of this closure by considering the small correlation length limit and requiring the modified closure to produce the correct exponential decay for a source-free half-line albedo problem in rod geometry. They concluded that the modified closure is generally not inferior to the LP closure and in some cases is significantly better. Brantley investigated the use of the Su-Pomraning (SP) closure in the Monte Carlo LP algorithm (LP-SP) for the suite of benchmark problems and concluded that 1) the LP-SP algorithm was somewhat more accurate overall than the LP algorithm and somewhat less accurate overall than the LPLRP algorithm for an incident angular flux benchmark suite, and 2) the LP-SP algorithm was generally the least accurate of the algorithms for an interior source benchmark suite. Larsen et al. performed an asymptotic analysis of the transport equation in 1D planar geometry for the situation in which the physical system is 1) a random binary stochastic medium with material macroscopic total cross sections and mean slab width values of O(1) or smaller and 2) optically thick with weak absorption and sources at each spatial point and therefore globally diffusive. The asymptotic analysis demonstrates that, under these assumptions, the transport equation limits to the conventional diffusion equation with atomically-mixed (volume-averaged) material properties. Larsen et al. also demonstrate that, under these same assumptions, the LP equations asymptotically limit to an atomically-mixed diffusion equation with a diffusion coefficient that is too large, leading to an unphysical flattening of the ensemble-averaged scalar flux distribution. Vasques and Yadav recently performed an asymptotic analysis of an adjusted Levermore-Pomraning closure in which the Markovian transition functions are rescaled such that the equations asymptotically limit to the correct atomically-mixed diffusion equation; we refer to this model as LP-VY. In this paper, we demonstrate that the adjusted LP closure proposed by Vasques and Yadav is a special case of the SP closure obtained by assuming that the absorption cross sections in the two materials are equal. We further demonstrate that the Su-Pomraning closure has the correct asymptotic limit for the diffusive physical system and is therefore an appropriate closure for these problems. We also describe how to incorporate these various closures into the Monte Carlo LP and LPLRP particle transport algorithms, and we present numerical results comparing the accuracy of the Monte Carlo LP, LP-VY, LP-SP, LPLRP, and LPLRP-SP algorithms for the set of diffusive benchmark problems. We demonstrated that the SP closure has the correct asymptotic limit for the diffusive physical system under investigation in this paper and that the VY closure is a special case of the SP closure obtained by assuming equal absorption in the two materials. Both of these closures are readily implemented in the Monte Carlo LP and LPLRP algorithms for particle transport in BSM. Through numerical comparisons to a diffusive benchmark suite, we confirmed that 1) the LP and LPLRP algorithms do not limit to the appropriate diffusion solution and 2) the LP-VY, LP-SP, and LPLRP-SP algorithms limit to the appropriate diffusion solution and are of comparable accuracy. The LPLRP algorithm has been shown to be generally more accurate than the LP algorithm for non-diffusive problems. However, the numerical results in this paper indicate that the LPLRP algorithm does not limit to the correct diffusion equation for the asymptotic limit under consideration. The work in this paper demonstrates that the SP algorithm does limit to the correct diffusion equation for the asymptotic limit considered. Future work will investigate the possibility of whether the LPLRP-SP algorithm is accurate for both diffusive and non-diffusive problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A cross-dimensional analysis of data-driven short-term load forecasting methods with large-scale smart meter data

Electricity load forecasting is essential to utility operation and power grid stability. A wide spectrum of data-driven methods, ranging from linear regression models to more recent deep learning models have been adopted to forecast electric load over the years. However, there still lacks a holistic evaluation of the applicability of conventional statistical and machine learning based algorithms with respect to different temporal and spatial scopes, computational requirements, and sensitivity of model-tuning. Enabled by a large-scale electricity load profile dataset of over 40,000 residential customers in a utility region, we conducted a cross-dimensional analysis of data-driven load forecasting methods. Three regression-based and seven deep learning algorithms with different model configurations were evaluated in terms of their overall and peak load prediction accuracy, and training burdens, across spatial aggregation levels ranging from the transformer, feeder, substation, to neighborhood. We found, first, the load forecasting accuracy is constrained by a predictability boundary, influenced by the forecasting horizon and spatial aggregation level. Specifically, RandomForest, XGBoost, TFT, TSMixer, and TiDE models achieved less than 10 % prediction error for up to 96-h ahead forecasting for district, substation, and feeder levels, while other models struggle at long-horizon predictions; Second, for winter and summer peak load dates, most models were able to predict the peak demand timing within ± 1 h, but the prediction percentage error varied by models, with TFT and TiDE models being the top performers; Third, models with similar prediction accuracy can differ in training burden by an order of magnitude. Therefore, choosing model configurations that balance prediction performance and computational resource is an important practical consideration for large-scale deployment of the machine learning based load forecasting. The outcome of this study can guide researchers and practitioners to choose the proper load forecasting algorithms based on their problem scope, required accuracy, and available resources. The predictability boundary can serve as a benchmark for electricity load forecasting problems with new algorithms and datasets.

Li, Han↗

Student Progress Report: Summer 2012 [Slides]

The Los Alamos SOURCES 4C code has been benchmarked for alpha particle beam problems and common neutron source materials (e.g. those containing plutonium or beryllium), but little benchmarking has been performed for more exotic isotopic neutron sources or uranium mixtures. This work extends SOURCES 4C benchmarking effort. Experimental data was found in the literature for several isotopic neutron sources, namely Am/Be, Am/F, Am/B, Cm/Be, 238 Pu/ 13 C, 252 Cf, and Am/Li.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

AMG2023

The AMG2023 benchmark solves two diffusion problems with a linear solver preconditioned with algebraic multigrid. The code only contains a driver, a Makefile, and a documentation file. It requires an installation of the open source software library hypre that needs to be downloaded elsewhere and is not included here. Its purpose is to benchmark linear solver performance on high performance computers.

Li, Ruipeng↗

Incompressible flow computations based on the vorticity-stream function and velocity-pressure formulations

Finite element procedures and computations based on the velocity-pressure and vorticity-stream function formulations of incompressible flows are presented. Two new multistep velocity-pressure formulations are proposed and compared with the vorticity-stream function and one-step formulations. The example problems chosen are the standing vortex problem and flow past a circular cylinder. Benchmark quality computations are performed for the cylinder problem. The numerical results indicate that the vorticity-stream function formulation and one of the two new multistep formulations involve much less numerical dissipation than the one-step formulation.

Tezduyar, T. E.↗

THE PLUTO CODE FOR ADAPTIVE MESH COMPUTATIONS IN ASTROPHYSICAL FLUID DYNAMICS

We present a description of the adaptive mesh refinement (AMR) implementation of the PLUTO code for solving the equations of classical and special relativistic magnetohydrodynamics (MHD and RMHD). The current release exploits, in addition to the static grid version of the code, the distributed infrastructure of the CHOMBO library for multidimensional parallel computations over block-structured, adaptively refined grids. We employ a conservative finite-volume approach where primary flow quantities are discretized at the cell center in a dimensionally unsplit fashion using the Corner Transport Upwind method. Time stepping relies on a characteristic tracing step where piecewise parabolic method, weighted essentially non-oscillatory, or slope-limited linear interpolation schemes can be handily adopted. A characteristic decomposition-free version of the scheme is also illustrated. The solenoidal condition of the magnetic field is enforced by augmenting the equations with a generalized Lagrange multiplier providing propagation and damping of divergence errors through a mixed hyperbolic/parabolic explicit cleaning step. Among the novel features, we describe an extension of the scheme to include non-ideal dissipative processes, such as viscosity, resistivity, and anisotropic thermal conduction without operator splitting. Finally, we illustrate an efficient treatment of point-local, potentially stiff source terms over hierarchical nested grids by taking advantage of the adaptivity in time. Several multidimensional benchmarks and applications to problems of astrophysical relevance assess the potentiality of the AMR version of PLUTO in resolving flow features separated by large spatial and temporal disparities.

79 ASTRONOMY AND ASTROPHYSICS↗

Benchmarking Solid-State Batteries Containing Sulfide Separators: Effects of Electrode Composition and Stack Pressure

Integrating sulfide separators into solid-state batteries (SSBs) containing high energy cathodes typically requires one or more materials and engineering solutions including: (i) applying interfacial coatings to mitigate electrolyte decomposition, (ii) applying high stack pressures to form robust solid-solid contacts, and (iii) using alloying anodes to avoid Li dendrite formation. Despite the promise of these approaches, a lack of standardized testing protocols makes it difficult to directly compare results among different studies. To address this problem, the present work benchmarks the performance of SSBs containing β-Li 3 PS 4 (LPS) separators and composite cathodes. By systematically varying the anode/cathode composition and stack pressure, this work demonstrates that cathode design is a major bottleneck for solid-state cells cycled at low rates (<100 µA cm -2 ). Operando stack pressure measurements show that, while mechanical confinement generally promotes higher active material utilization and cycling stability, this strategy alone does not address interfacial reactivity between LPS and high voltage cathodes. Here, these results also demonstrate that stress evolution during cycling is dominated by volume changes at the Li metal anode. Finally, we show that FeS 2 cathodes with moderate operating voltages (<3 V vs Li/Li + ) exhibit superior cycling performance compared to high voltage cathodes by facilitating formation of stable cathode/electrolyte interfaces.

25 ENERGY STORAGE↗

A time-dependent neutron transport method of characteristics formulation with time derivative propagation

A new time-dependent Method of Characteristics (MOC) formulation for nuclear reactor kinetics was developed utilizing angular flux time-derivative propagation. This method avoids the requirement of storing the angular flux at previous points in time to represent a discretized time derivative; instead, an equation for the angular flux time derivative along 1D spatial characteristics is derived and solved concurrently with the 1D transport characteristic equation. This approach allows the angular flux time derivative to be recast principally in terms of the neutron source time derivatives, which are approximated to high-order accuracy using the backward differentiation formula (BDF). This approach, called Source Derivative Propagation (SDP), drastically reduces the memory requirements of time-dependent MOC relative to methods that require storing the angular flux. An SDP method was developed for 2D and 3D applications and implemented in the computer code DeCART in 2D. DeCART was used to model two reactor transient benchmarks: a modified TWIGL problem and a C5G7 transient. The SDP method accurately and efficiently replicated the solution of the conventional time-dependent MOC method using two orders of magnitude less memory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Casting Process Modeling and Validation

Computational simulations of gravity casting for metallic U-Pu-Zr nuclear fuel rods were performed with the free surface flow solver Flow3d. Two different casting apparatus designs were explored for studying the effects on the final cast rod profiles. Experimental data for the casting problem obtained from Idaho National Laboratory (INL) was validated with numerical simulations on one of the designs considered. The volume of the rods cast, length of the rods, and temperature profiles were predicted through the transient casting process and were found to match closely with experimental data. A sensitivity analysis with vent locations, pressure, mesh refinement, and effects of surface tension at the interface were explored. This work serves as a validation benchmark for the casting problem and provides guidelines when performing simulation exercises for modeling casting. This paper also provides the mathematical framework to enabling modeling of the casting process.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Using wesBench to Study the Rendering Performance of Graphics Processing Units

Graphics operations consist of two broad operations. The first, which we refer to here as vertex operations, consists of transformation, lighting, primitive assembly, and so forth. The second, which we refer to as pixel or fragment operations, consist of rasterization, texturing, scissoring, blending, and fill. Overall GPU rendering performance is a function of throughput of both these interdependent stages: if one stage is slower than the other, the faster stage will be forced to run more slowly and overall rendering performance will be adversely affected. This relationship is commutative: if the later stage has a greater workload than the earlier stage, the earlier stage will be forced to 'slow down.' For example, a large triangle that covers many screen pixels will incur a very small amount of work in the vertex stage while at the same time incurring a relatively large amount of work in the fragment stage. Rendering performance of a scene consisting of many large-area triangles will be limited by throughput of the fragment stage, which will have relatively more work than the vertex stage. There are two main objectives for this document. First, we introduce a new graphics benchmark, wesBench, which is useful for measuring performance of both stages of the rendering pipeline under varying conditions. Second, we present its methodology for measuring performance and show results of several performance measurement studies aimed at producing better understanding of GPU rendering performance characteristics and limits under varying configurations. First, in Section 2, we explore the 'crossover' point between geometry and rasterization. Second, in Section 3, we explore additional performance characteristics, some of which are ill- or un-documented. Lastly, several appendices provide additional material concerning problems with the gfxbench benchmark, and details about the new wesBench graphics benchmark.

97 MATHEMATICS AND COMPUTING↗

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗

Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders

Nearly all model-reduction techniques project the governing equations onto a linear subspace of the original state space. Such subspaces are typically computed using methods such as balanced truncation, rational interpolation, the reduced-basis method, and (balanced) proper orthogonal decomposition (POD). Unfortunately, restricting the state to evolve in a linear subspace imposes a fundamental limitation to the accuracy of the resulting reduced-order model (ROM). In particular, linear-subspace ROMs can be expected to produce low-dimensional models with high accuracy only if the problem admits a fast decaying Kolmogorov n -width (e.g., diffusion-dominated problems). Unfortunately, many problems of interest exhibit a slowly decaying Kolmogorov n-width (e.g., advection-dominated problems). To address this, we propose a novel framework for projecting dynamical systems onto nonlinear manifolds using minimum-residual formulations at the time-continuous and time-discrete levels; the former leads to manifold Galerkin projection, while the latter leads to manifold least-squares Petrov–Galerkin (LSPG) projection. We perform analyses that provide insight into the relationship between these proposed approaches and classical linear-subspace reduced-order models; we also derive a posteriori discrete-time error bounds for the proposed approaches. In addition, we propose a computationally practical approach for computing the nonlinear manifold, which is based on convolutional autoencoders from deep learning. Lastly, we demonstrate the ability of the method to significantly outperform even the optimal linear-subspace ROM on benchmark advection-dominated problems, thereby demonstrating the method's ability to overcome the intrinsic n -width limitations of linear subspaces.

97 MATHEMATICS AND COMPUTING↗

Converged accelerated finite difference scheme for the multigroup neutron diffusion equation

Computer codes involving neutron transport theory for nuclear engineering applications always require verification to assess improvement. Generally, analytical and semi-analytical benchmarks are desirable, since they are capable of high precision solutions to provide accurate standards of comparison. However, these benchmarks often involve relatively simple problems, usually assuming a certain degree of abstract modeling. In the present work, we show how semi-analytical equivalent benchmarks can be numerically generated using convergence acceleration. Specifically, we investigate the error behavior of a 1D spatial finite difference scheme for the multigroup (MG) steady-state neutron diffusion equation in plane geometry. Since solutions depending on subsequent discretization can be envisioned as terms of an infinite sequence converging to the true solution, extrapolation methods can accelerate an iterative process to obtain the limit before numerical instability sets in. The obtained results have been compared to the analytical solution to the 1D multigroup diffusion equation when available, using FORTRAN as the computational language. Finally, a slowing down problem has been solved using a cascading source update, showing how a finite difference scheme performs for ultra-fine groups (104 groups) in a reasonable computational time using convergence acceleration. (authors)

97 MATHEMATICS AND COMPUTING↗

Communication: Hole localization in Al-doped quartz SiO{sub 2} within ab initio hybrid-functional DFT

We investigate the long-standing problem of hole localization at the Al impurity in quartz SiO{sub 2}, using a relatively recent DFT hybrid-functional method in which the exchange fraction is obtained ab initio, based on an analogy with the static many-body COHSEX approximation to the electron self-energy. As the amount of the admixed exact exchange in hybrid functionals has been shown to be determinant for properly capturing the hole localization, this problem constitutes a prototypical benchmark for the accuracy of the method, allowing one to assess to what extent self-interaction effects are avoided. We obtain good results in terms of description of the charge localization and structural distortion around the Al center, improving with respect to the more popular B3LYP hybrid-functional approach. We also discuss the accuracy of computed hyperfine parameters, by comparison with previous calculations based on other self-interaction-free methods, as well as experimental values. We discuss and rationalize the limitations of our approach in computing defect-related excitation energies in low-dielectric-constant insulators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Deterministically estimated fission source distributions for Monte Carlo k-eigenvalue problems

The standard Monte Carlo (MC) k-eigenvalue algorithm involves iteratively converging the fission source distribution using a series of potentially time-consuming inactive cycles before quantities of interest can be tallied. One strategy for reducing the computational time requirements of these inactive cycles is the Sourcerer method, in which a deterministic eigenvalue calculation is performed to obtain an improved initial guess for the fission source distribution. This method has been implemented in the Exnihilo software suite within SCALE using the SPNSPN or SNSN solvers in Denovo and the Shift MC code. The efficacy of this method is assessed with different Denovo solution parameters for a series of typical k-eigenvalue problems including small criticality benchmarks, full-core reactors, and a fuel cask. Here it is found that, in most cases, when a large number of histories per cycle are required to obtain a detailed flux distribution, the Sourcerer method can be used to reduce the computational time requirements of the inactive cycles.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗