Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical benchmark”

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 775 records · Page 43

Numerical flux formulas for the Euler and Navier-Stokes equations. 2: Progress in flux-vector splitting

The accuracy of various numerical flux functions for the inviscid fluxes when used for Navier-Stokes computations is studied. The flux functions are benchmarked for solutions of the viscous, hypersonic flow past a 10 degree cone at zero angle of attack using first order, upwind spatial differencing. The Harten-Lax/Roe flux is found to give a good boundary layer representation, although its robustness is an issue. Some hybrid flux formulas, where the concepts of flux-vector and flux-difference splitting are combined, are shown to give unsatisfactory pressure distributions; there is still room for improvement. Investigations of low diffusion, pure flux-vector splittings indicate that a pure flux-vector splitting can be developed that eliminates spurious diffusion across the boundary layer. The resulting first-order scheme is marginally stable and not monotone.

Coirier, William J.↗

Numerical flux formulas for the Euler and Navier-Stokes equations. II - Progress in flux-vector splitting

The accuracy of various numerical flux functions for the inviscid fluxes when used for Navier-Stokes computations is studied. The flux functions are benchmarked for solutions of the viscous, hypersonic flow past a 10 degree cone at zero angle of attack using first order, upwind spatial differencing. The Harten-Lax/Roe flux is found to give a good boundary layer representation, although its robustness is an issue. Some hybrid flux formulas, where the concepts of flux-vector and flux-difference splitting are combined, are shown to give unsatisfactory pressure distributions; there is still room for improvement. Investigations of low diffusion, pure flux-vector splittings indicate that a pure flux-vector splitting can be developed that eliminates spurious diffusion across the boundary layer. The resulting first-order scheme is marginally stable and not monotone.

Coirier, William J.↗

Experimental Observations and Numerical Prediction of Induction Heating in a Graphite Test Article

The induction heating coils used in the plutonium casting furnaces at the Los Alamos National Laboratory are studied here. A cylindrical graphite test article has been built, instrumented with thermocouples, and heated in the induction coil that is normally used to preheat the molds during casting operations. Preliminary results of experiments aimed at understanding the induction heating process in the mold portion of the furnaces are reported. The experiments have been modeled in COMSOL Multiphysics and the numerical and experimental results are compared to one another. These comparisons provide insight into the heating process and provide a benchmark for COMSOL calculations of induction heating in the mold portion of the plutonium casting furnaces.

42 ENGINEERING↗

CFD simulation of MSW combustion and SNCR in a commercial incinerator

Highlights: • Presented a CFD scheme for modeling MSW incinerator including SNCR process. • Performed a sensitivity analysis of SNCR operating conditions. • Non-uniform distributions of gas velocity, temperature and NO{sub x} in the incinerator. • The injection position of reagent was critical for a desirable performance of SNCR. • A NSR 1.5 was recommended as a compromise of NO{sub x} reduction rates and NH{sub 3} slip. - Abstract: A CFD scheme was presented for modeling municipal solid waste (MSW) combustion in a moving-grate incinerator, including the in-bed burning of solid wastes, the out-of-bed burnout of gaseous volatiles, and the selective non-catalytic reduction (SNCR) process between urea (CO(NH{sub 2}){sub 2}) and NO{sub x}. The in-bed calculations provided 2-D profiles of the gas–solid temperatures and the gas species concentrations along the bed length, which were then used as inlet conditions for the out-of-bed computations. The over-bed simulations provided the profiles of incident radiation heat flux on the top of bed. A 3-dimensional benchmark simulation was conducted with a 750 t/day commercial incinerator using the present coupling scheme incorporating with a reduced SNCR reduction mechanism. Numerical tests were performed to investigate the effects of operating parameters such as injection position, injection speed and the normalized stoichiometric ratio (NSR) on the SNCR performance. The simulation results showed that the distributions of gas velocity, temperature and NO{sub x} concentration were highly non-uniform, which made the injection position one of the most sensitive operating parameters influencing the SNCR performance of moving grate incinerators. The simulation results also showed that multi-layer injections were needed to meet the EU2000 standard, and a NSR 1.5 was suggested as a compromise of a satisfactory NO{sub x} reduction and reasonable NH{sub 3} slip rates. This work provided useful guides to the design and operation of SNCR process in moving-grate incinerators.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Full electromagnetic Vlasov code simulation of the Kelvin-Helmholtz instability

Recent advancement in numerical techniques for Vlasov simulations and their application to cross-scale coupling in the plasma universe are discussed. Magnetohydrodynamic (MHD) simulations are now widely used for numerical modeling of global and macroscopic phenomena. In the framework of the MHD approximation, however, diffusion coefficients such as resistivity and adiabatic index are given from empirical models. Thus there are recent attempts to understand first-principle kinetic processes in macroscopic phenomena, such as magnetic reconnection and the Kelvin-Helmholtz (KH) instability via full kinetic particle-in-cell and Vlasov codes. In the present study, a benchmark test for a new four-dimensional full electromagnetic Vlasov code is performed. First, the computational speed of the Vlasov code is measured and a linear performance scaling is obtained on a massively parallel supercomputer with more than 12 000 cores. Second, a first-principle Vlasov simulation of the KH instability is performed in order to evaluate current status of numerical techniques for Vlasov simulations. The KH instability is usually adopted as a benchmark test problem for guiding-center Vlasov codes, in which a cyclotron motion of charged particles is neglected. There is not any full electromagnetic Vlasov simulation of the KH instability; this is because it is difficult to follow E-vectorxB-vector drift motion accurately without approximations. The present first-principle Vlasov simulation has successfully represented the formation of KH vortices and its secondary instability. These results suggest that Vlasov code simulations would be a powerful approach for studies of cross-scale coupling on future Peta-scale supercomputers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

miniVite: A Graph Analytics Benchmarking Tool for Massively Parallel Systems

Benchmarking of high performance computing sys-tems can help provide critical insights for ef?cient design of computing systems and software applications. Although a large number of tools for benchmarking exist, there is a lack of rep-resentative benchmarks for the class of irregular computations as exempli?ed by graph analytics. In this paper, we propose miniVite as a representative graph analytics benchmark tool to test a variety of distributed-memory systems. Graph clustering, popularly known as community detection, is a prototypical graph operation used in numerous scienti?c computing and analytics applications. The goal of clustering is to partition a graph into clusters (or communities) such that each cluster consists of vertices that are densely connected within the cluster and sparsely connected to the rest of the graph. Modu-larity optimization is a popular technique for identifying clusters in a graph. Ef?cient parallelization of modularity optimization-based algorithms is challenging. One successful approach was conceived in Vite, a distributed-memory implementation of the Louvain algorithm that incorporates several heuristics. We introduce miniVite as a representative but simpli?ed variant of Vite, to serve as a prototypical graph analytics benchmarking tool. Unlike other graph-based methods such as breadth-?rst search and betweenness centrality, miniVite represents highly complex computational patterns stressing a variety of system features, which can provide crucial insight for co-design of future computing systems.

community detection, parallel, MPI↗

A second-order semi-implicit δf method for hybrid simulation

A second-order accurate semi-implicit Lorentz force ions, fluid electrons δf hybrid model has been developed using a “current closure” scheme. The model assumes quasi-neutrality and is fully electromagnetic. The implicit field solver improves numerical accuracy by separating the equilibrium terms in the presence of small perturbations. The equilibrium part of the generalized Ohm’s law is solved by direct matrix inversion along the direction of gradients for every Fourier mode in the other two directions, while the nonlinear part is solved iteratively. The simulation has been benchmarked on Alfvén waves, ion sound waves and whistler waves against analytical dispersion relation in a slab. In particular, the first-order and second-order schemes are compared by studying the numerical damping of whistler waves. The full evolution of the resistive tearing mode using the Harris sheet equilibrium is also investigated. The linear growth rate and mode structure are compared with the resistive MHD theory. Important tearing mode nonlinear phenomena such as the Rutherford regime and saturation are demonstrated. We also presented systematic study of Rutherford growth rates and saturation island width, which is consistent with previous MHD studies.

97 MATHEMATICS AND COMPUTING↗

FELIX-2.0: New version of the finite element solver for the time dependent generator coordinate method with the Gaussian overlap approximation

The time-dependent generator coordinate method (TDGCM) is a powerful method to study the largeamplitude collective motion of quantum many-body systems such as atomic nuclei. Under the GaussianOverlap Approximation (GOA), the TDGCM leads to a local, time-dependent Schrödinger equation in amulti-dimensional collective space. In this paper, we present the version 2.0 of the code FELIX that solvesthe collective Schrödinger equation in a finite element basis. This new version features: (i) the ability tosolve a generalized TDGCM+GOA equation with a metric term in the collective Hamiltonian, (ii) supportfor new kinds of finite elements and different types of quadrature to compute the discretized Hamiltonianand overlap matrices, (iii) the possibility to leverage the spectral element scheme, (iv) an explicit Krylovapproximation of the time propagator for time integration instead of the implicit Crank–Nicolson methodimplemented in the first version, (v) an entirely redesigned workflow. We benchmark this release on ananalytic problem as well as on realistic two-dimensional calculations of the low-energy fission of240Puand256Fm. Low to moderate numerical precision calculations are most efficiently performed with simplexelements with a degree 2 polynomial basis. Higher precision calculations should instead use the spectralelement method with a degree 4 polynomial basis. We emphasize that in a realistic calculation of fissionmass distributions of240Pu, FELIX-2.0 is about 20 times faster than its previous release (within a numericalprecision of a few percents).

Regnier, D.↗

Verification and benchmarking relativistic electron beam transport through a background gas

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

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

EC-Bench: A Benchmark for Enzyme Commission Number Prediction

Enzymes are proteins that catalyze specific biochemical reactions in cells. Enzyme Commission (EC) numbers are used to annotate enzymes in a four-level hierarchy that classifies enzymes based on the specific chemical reactions they catalyze. Accurate EC number prediction is essential for understanding enzyme functions. Despite the availability of numerous methods for predicting EC numbers from protein sequences, there is no unified framework for evaluating and studying such methods systematically. This gap limits the ability of the community to identify the most effective approaches for enzyme annotation. We introduce EC-Bench, a benchmark for EC number prediction, consisting of 1) an initial representative set of existing methods (including homology-based, deep learning, contrastive learning, and language model methods), 2) existing and novel accuracy and efficiency performance metrics, and 3) selected datasets to allow for comprehensive comparative study. EC-Bench is open-source and provides a framework for researchers to not only compare among existing methods objectively under uniform conditions, but also to introduce and effectively evaluate performance of new methods in a comparative framework. To demonstrate the utility of EC-Bench, we perform extensive experimentation to compare the existing EC number prediction methods and establish their advantages and disadvantages in a variety of prediction tasks, namely “exact EC number prediction”, “EC number completion” and (partial or additional) “EC number recommendation”. We find wide variation in the performance of different methods, but also subtle but potentially useful differences in the performance of different methods across tasks and for different parts of the EC hierarchy.

59 BASIC BIOLOGICAL SCIENCES↗

Benchmark solutions for the galactic ion transport equations: Energy and spatially dependent problems

Nontrivial benchmark solutions are developed for the galactic ion transport (GIT) equations in the straight-ahead approximation. These equations are used to predict potential radiation hazards in the upper atmosphere and in space. Two levels of difficulty are considered: (1) energy independent, and (2) spatially independent. The analysis emphasizes analytical methods never before applied to the GIT equations. Most of the representations derived have been numerically implemented and compared to more approximate calculations. Accurate ion fluxes are obtained (3 to 5 digits) for nontrivial sources. For monoenergetic beams, both accurate doses and fluxes are found. The benchmarks presented are useful in assessing the accuracy of transport algorithms designed to accommodate more complex radiation protection problems. In addition, these solutions can provide fast and accurate assessments of relatively simple shield configurations.

Ganapol, Barry D.↗

Parallel application-level behavioral attributes for performance and energy management of high-performance computing systems

Run time variability of parallel applications continues to present significant challenges to their performance and energy efficiency in high-performance computing (HPC) systems. When run times are extended and unpredictable, application developers perceive this as a degradation of system (or subsystem) performance. Extended run times directly contribute to proportionally higher energy consumption, potentially negating efforts by applications, or the HPC system, to optimize energy consumption using low-level control techniques, such as dynamic voltage and frequency scaling (DVFS). Therefore, successful systemic management of application run time performance can result in less wasted energy, or even energy savings. We have been studying run time variability in terms of communication time, from the perspective of the application, focusing on the interconnection network. More recently, our focus has shifted to developing a more complete understanding of the effects of HPC subsystem interactions on parallel applications. In this context, the set of executing applications on the HPC system is treated as a subsystem, along with more traditional subsystems like the communication subsystem, storage subsystem, etc. To gain insight into the run time variability problem, our earlier work developed a framework to emulate parallel applications (PACE) that stresses the communication subsystem. Evaluation of run time sensitivity to network performance of real applications is performed with a tool called PARSE, which uses PACE. In this paper, we propose a model defining application-level behavioral attributes, that collectively describes how applications behave in terms of their run time performance, as functions of their process distribution on the system (spacial locality), and subsystem interactions (communication subsystem degradation). These subsystem interactions are produced when multiple applications execute concurrently on the same HPC system. We also revisit our evaluation framework and tools to demonstrate the flexibility of our application characterization techniques, and the ease with which attributes can be quantified. The validity of the model is demonstrated using our tools with several parallel benchmarks and application fragments. Results suggest that it is possible to articulate application-level behavioral attributes as a tuple of numeric values that describe course-grained performance behavior.

Computer Science↗

Numerical schemes for dynamically orthogonal equations of stochastic fluid and ocean flows

The quantification of uncertainties is critical when systems are nonlinear and have uncertain terms in their governing equations or are constrained by limited knowledge of initial and boundary conditions. Such situations are common in multiscale, intermittent and non-homogeneous fluid and ocean flows. The dynamically orthogonal (DO) field equations provide an adaptive methodology to predict the probability density functions of such flows. The present work derives efficient computational schemes for the DO methodology applied to unsteady stochastic Navier-Stokes and Boussinesq equations, and illustrates and studies the numerical aspects of these schemes. Semi-implicit projection methods are developed for the mean and for the DO modes, and time-marching schemes of first to fourth order are used for the stochastic coefficients. Conservative second-order finite-volumes are employed in physical space with new advection schemes based on total variation diminishing methods. Other results include: (i) the definition of pseudo-stochastic pressures to obtain a number of pressure equations that is linear in the subspace size instead of quadratic; (ii) symmetric advection schemes for the stochastic velocities; (iii) the use of generalized inversion to deal with singular subspace covariances or deterministic modes; and (iv) schemes to maintain orthonormal modes at the numerical level. To verify our implementation and study the properties of our schemes and their variations, a set of stochastic flow benchmarks are defined including asymmetric Dirac and symmetric lock-exchange flows, lid-driven cavity flows, and flows past objects in a confined channel. Different Reynolds number and Grashof number regimes are employed to illustrate robustness. Optimal convergence under both time and space refinements is shown as well as the convergence of the probability density functions with the number of stochastic realizations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Quasi-Two-Dimensional Electrochemistry Modeling Tool for Planar Solid Oxide Fuel Cell Stacks

A two-dimensional numerical model is presented for the efficient computation of the steady-state current density, species concentration, and temperature distributions in planar solid oxide fuel cell stacks. The model reduction techniques, engineering approximations, and numerical procedures used to simulate the stack physics while maintaining adequate computational speed are discussed. The results of the model for benchmark cases with and without on-cell methane reformation are presented with comparisons to results from other research described in the literature. The capabilities, performance, and scalability of the model for the study of large multi-cell stacks are then demonstrated.

03 NATURAL GAS↗

Enabling topography-resolving structural dynamic contact simulation

Damping of structures and systems is often dominated by frictional dissipation in connections, the prediction of which remains a longstanding scientific challenge. Previous studies have shown that the actual topography of contact interfaces may have a strong effect, especially in the partial slip/liftoff regime. We recently proposed a multi-scale method, which couples finite element and boundary element modeling. The primary benefit of this approach is that it permits to analyze the effect of the actual contact topography on the dynamics of jointed structures. While this multi-scale modeling method was initially developed for quasi-static analysis, we demonstrate herein how it can be used for time step integration and Harmonic Balance analysis. We cross-verify those fully dynamic analysis methods against each other and quasi-static results, for the S4 Beam benchmark. We compare the multi-scale method against state-of-the-art full-FE analysis, in terms of numerical damping and computational performance. Some discrepancy is found to be of physical origin. Depending on the load history, it is shown that the system settles to a slightly different equilibrium. Finally, transient multi-scale simulations enable the prediction of this interesting phenomenon, for the first time, for a structure with bolted joints.

Frictional-unilateral contact↗

Kernel-based global sensitivity analysis obtained from a single data set

Results from global sensitivity analysis (GSA) often guide the understanding of complicated input–output systems. Kernel-based GSA methods have recently been proposed for their capability of treating a broad scope of complex systems. In this paper, we develop a new set of kernel GSA tools when only a single set of input–output data is available. Three key advances are made: (1) A new numerical estimator is proposed that demonstrates an empirical improvement over previous procedures. (2) A computational method for generating inner statistical functions from a single data set is presented. (3) A theoretical extension is made to define conditional sensitivity indices, which reveal the degree that the inputs carry shared information about the output when inherent input–input correlations are present. Utilizing these conditional sensitivity indices, a decomposition is derived for the output uncertainty based on what is called the optimal learning sequence of the input variables, which remains consistent when correlations exist between the input variables. Further, while these advances cover a range of GSA subjects, a common single data set numerical solution is provided by a technique known as the conditional mean embedding of distributions. The new methodology is implemented on benchmark systems to demonstrate the provided insights.

42 ENGINEERING↗

Assessing the potential of deep learning for protein–ligand docking

The effects of ligand binding on protein structures and their in vivo functions carry numerous implications for modern biomedical research and biotechnology development efforts such as drug discovery. Although several deep learning (DL) methods and benchmarks designed for protein–ligand docking have recently been introduced, so far no previous works have systematically studied the behaviour of the latest docking and structure prediction methods within the broadly applicable context of: (1) using predicted (apo) protein structures for docking (for example, for applicability to new proteins); (2) binding multiple (cofactor) ligands concurrently to a given target protein (for example, for enzyme design); and (3) having no previous knowledge of binding pockets (for example, for generalization to unknown pockets). To enable a deeper understanding of the real-world utility of docking methods, we introduce PoseBench, a comprehensive benchmark for broadly applicable protein–ligand docking. PoseBench enables researchers to rigorously and systematically evaluate DL methods for apo-to-holo protein–ligand docking and protein–ligand structure prediction using both primary ligand and multiligand benchmark datasets, the latter of which we introduce to the DL community. Empirically, using PoseBench, we find that: (1) DL cofolding methods generally outperform comparable conventional and DL docking baseline algorithms, but popular methods such as AlphaFold 3 are still challenged by prediction targets with new protein–ligand binding poses; (2) certain DL cofolding methods are highly sensitive to their input multiple sequence alignments, whereas others are not; and (3) DL methods struggle to strike a balance between structural accuracy and chemical specificity when predicting new or multiligand protein targets.

Morehead, Alex [Lawrence Berkeley National Laborat↗

Communication: Four-component density matrix renormalization group

We present the first implementation of the relativistic quantum chemical two- and four-component density matrix renormalization group algorithm that includes a variational description of scalar-relativistic effects and spin–orbit coupling. Numerical results based on the four-component Dirac–Coulomb Hamiltonian are presented for the standard reference molecule for correlated relativistic benchmarks: thallium hydride.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗