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,783 records · Page 99

Fast and robust all-electron density functional theory calculations in solids using orthogonalized enriched finite elements

Here, we present a computationally efficient approach to perform systematically convergent real-space all-electron Kohn-Sham density functional theory calculations for solids using an enriched finite element (FE) basis. The enriched FE basis is constructed by augmenting the classical FE basis with atom-centered numerical basis functions, comprising of atomic solutions to the Kohn-Sham problem. Notably, to improve the conditioning, we orthogonalize the enrichment functions with respect to the classical FE basis, without sacrificing the locality of the resultant basis. In addition to improved conditioning, this orthogonalization procedure also renders the overlap matrix block diagonal, greatly simplifying its inversion. Subsequently, we use a Chebyshev polynomial based filtering technique to efficiently compute the occupied eigenspace in each self-consistent field iteration. We demonstrate the accuracy and efficiency of the proposed approach on periodic unit cells and supercells. The benchmark studies show a staggering 130× speedup of the orthogonalized enriched FE basis over the classical FE basis. We also present a comparison of the orthogonalized enriched FE basis with the linearized augmented plane-wave + local orbitals basis, both in terms of accuracy and efficiency. Notably, we demonstrate that the orthogonalized enriched FE basis can handle large system sizes of ~10 000 electrons. Finally, we observe good parallel scalability of our implementation with 92% efficiency at 22× speedup for a system with 620 electrons

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Numerical Analysis of Base Flowfield for a Four-Engine Clustered Nozzle Configuration

Excessive base heating has been a problem for many launch vehicles. For certain designs such as the direct dump of turbine exhaust inside and at the lip of the nozzle, the potential burning of the turbine exhaust in the base region can be of great concern. Accurate prediction of the base environment at altitudes is therefore very important during the vehicle design phase. Otherwise, undesirable consequences may occur. In this study, the turbulent base flowfield of a cold flow experimental investigation for a four-engine clustered nozzle was numerically benchmarked using a pressure-based computational fluid dynamics (CFD) method. This is a necessary step before the benchmarking of hot flow and combustion flow tests can be considered. Since the medium was unheated air, reasonable prediction of the base pressure distribution at high altitude was the main goal. Several physical phenomena pertaining to the multiengine clustered nozzle base flow physics were deduced from the analysis.

Wang, Ten-See↗

Fully implicit Particle-in-cell algorithms for multiscale plasma simulation

The outline of the paper is as follows: Particle-in-cell (PIC) methods for fully ionized collisionless plasmas, explicit vs. implicit PIC, 1D ES implicit PIC (charge and energy conservation, moment-based acceleration), and generalization to Multi-D EM PIC: Vlasov-Darwin model (review and motivation for Darwin model, conservation properties (energy, charge, and canonical momenta), and numerical benchmarks). The author demonstrates a fully implicit, fully nonlinear, multidimensional PIC formulation that features exact local charge conservation (via a novel particle mover strategy), exact global energy conservation (no particle self-heating or self-cooling), adaptive particle orbit integrator to control errors in momentum conservation, and canonical momenta (EM-PIC only, reduced dimensionality). The approach is free of numerical instabilities: ω pe Δt >> 1, and Δx >> λ D . It requires many fewer dofs (vs. explicit PIC) for comparable accuracy in challenging problems. Significant CPU gains (vs explicit PIC) have been demonstrated. The method has much potential for efficiency gains vs. explicit in long-time-scale applications. Moment-based acceleration is effective in minimizing N FE , leading to an optimal algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Toward the Holy Grail of Perfect Information: Lessons Learned Implementing an Energy Information System in a Commercial Building

Energy information systems (real-time acquisition, analysis, and presentation of information from energy end-uses) in commercial buildings have demonstrated value as tools for improving energy efficiency and thermal comfort. These improvements include characterization through benchmarking, identification of retrofit opportunities, anomaly detection to inform retro-commissioning, and feedback to occupants to encourage shifts in behavior. Energy information systems can play a vital role in achieving a variety of ambitious sustainability goals for the existing stock of commercial buildings, but their implementation is often fraught with pitfalls. In this paper, we present a case study of an EIS and sub-metering project executed in a representative commercial office building. We describe the building, highlight a few of its problems, and detail the hardware and software technologies we employed to address them. We summarize the difficulties encountered and lessons learned, and suggest general guidelines for future EIS projects to improve performance and save energy in the commercial building fleet. These guidelines include measurement criteria, monitoring strategies, and analysis methods. In particular, we propose processes for: - Defining project goals, - Selecting end-use targets and depth of metering, - Selecting contractors and software vendors, - Installing and networking measurement devices, - Commissioning and using the energy information system.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Advancing the Frontiers of Deep Learning for Low-Dose 3D Cone-Beam CT Reconstruction

X-ray computed tomography (CT) is an important noninvasive medical imaging modality for studying the structural details of internal organs. Image reconstruction in CT is an inverse problem of recovering an object's internal structure from the absorption profile of X-ray beams (sinogram) measured using a detector. The classical variational approach for CT reconstruction minimizes an energy functional using an appropriate iterative algorithm. Motivated by the success of deep learning (DL), researchers have begun to leverage training data and enhanced computing capabilities in recent years to produce high-fidelity reconstructed images. Nonetheless, much of the academic research in DL algorithms for CT has focused primarily on the two-dimensional setting (with simplified forward operators and noise model) for proofs-of-concept, and a comprehensive benchmarking of various classical and data-driven CT reconstruction approaches has not beenundertaken. The key objective of our CT reconstruction grand challenge was to promote methodological advancements for both classical and DL-based approaches for clinical CT with a reasonably accurately simulated 3D CT forward operator and noise model. We have utilized the publicly available LIDC-IDRI dataset and simulated sinograms and FDK images corresponding to two dose levels (clinical- and low-dose, constituting two tracks of the challenge) starting from the normal-dose images as the ground truth. In this paper, we summarize the motivation, context, and results of our challenge, and highlight the future research directions in DL for clinical CT.

X-ray tomography↗

Quantum many-body calculations using body-centered cubic lattices

It is often computationally advantageous to model space as a discrete set of points forming a lattice grid. This technique is particularly useful for computationally difficult problems such as quantum many-body systems. For reasons of simplicity and familiarity, nearly all quantum many-body calculations have been performed on simple cubic lattices. Since the removal of lattice artifacts is often an important concern, it would be useful to perform calculations using more than one lattice geometry. In this paper we show how to perform quantum many-body calculations using auxiliary-field Monte Carlo simulations on a three-dimensional body-centered cubic (BCC) lattice. As a benchmark test we compute the ground state energy of 33 spin-up and 33 spin-down neutrons in the unitary limit, which is an idealized limit where the interaction range is zero and scattering length is infinite. As a fraction of the free Fermi gas energy E FG , we find that the ground state energy is E 0 /E FG =0.369(2),0.371(2), using two different definitions of the finite-system energy ratio. This is in excellent agreement with recent results obtained on a cubic lattice [He et al., Phys. Rev. A 101, 063615 (2020)]. We find that the computational effort and performance on a BCC lattice is approximately the same as that for a cubic lattice with the same number of lattice points. We discuss how the lattice simulations with different geometries can be used to constrain the size of lattice artifacts in simulations of continuum quantum many-body systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Real-Time Identifiability of Power Distribution Network Topologies With Limited Monitoring

Recovering the distribution grid topology in real time is essential to perform several distribution system operator (DSO) functions. DSOs often do not have any direct monitoring of switch statuses to track reconfiguration. At the same time, installing real-time meters at a large number of buses is challenging due to the cost of endowing every metered bus with a real-time communication channel. The goal of this letter is to develop a meter placement strategy allowing DSOs to deploy only few real-time meters. After casting the topology recovery task as an optimization problem, a meter placement strategy ensuring unique recovery of the true topology is devised. A graph-theoretical approach is pursued to partition the grid into connected portions called observable islands . The proposed strategy then simply requires installing a meter in the path between every pair of boundary nodes , i.e., ends of edges connecting two different islands. Under some ideal assumptions, this placement strategy ensures unique recovery of the topology. The approach is also validated through numerical simulations under realistic scenarios using a standard IEEE benchmark feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

GEOSH: Ideal Gas Chemical Equation of State

We present the framework and methodology for the new Los Alamos National Laboratory (LANL) G as chemical E quation O f S tate at H igher temperatures code (GEOSH) which aims to accurately model the behavior of chemically complex gaseous mixtures in equilibrium. Assuming the ideal gas approximation, GEOSH leverages the recursive nature of the Saha ionization and molecular equations in order to eliminate the molecular and ionic degrees of freedom, thereby reducing the problem size to the number of atomic species plus one for the free electrons if ions are included. This approach allows the chemical species, both molecular and ionic, of the mixture to be expressed in terms of the abundances of the elemental species. As a result, the GEOSH framework achieves a reduction in computational expense, increased processing speed, and the capability to efficiently model large-scale chemical networks. This report provides the necessary physical background and theoretical foundations for the GEOSH code, accompanied by benchmarking studies.

74 ATOMIC AND MOLECULAR PHYSICS↗

Enhanced relaxed physical factorization preconditioner for coupled poromechanics

The relaxed physical factorization (RPF) preconditioner is a recent algorithm allowing for the efficient and robust solution to the block linear systems arising from the three-field displacement-velocity-pressure formulation of coupled poromechanics. For its application, however, it is necessary to invert blocks with the algebraic form C^ = (C + βFF T ), where C is a symmetric positive definite matrix, FF T a rank-deficient term, and β a real non-negative coefficient. The inversion of C^, performed in an inexact way, can become unstable for large values of β, as it usually occurs at some stages of a full poromechanical simulation. In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C^. This strategy can prove useful in other problems as well where such an issue might arise, such as augmented Lagrangian preconditioning techniques for Navier-Stokes or incompressible elasticity. First, we introduce an iterative scheme obtained by a natural splitting of matrix C^. Second, we develop a technique based on the use of a proper projection operator annihilating the near-kernel modes of C^. Both approaches give rise to a novel class of preconditioners denoted as Enhanced RPF (ERPF). Furthermore, effectiveness and robustness of the proposed algorithms are demonstrated in both theoretical benchmarks and real-world large-size applications, outperforming the native RPF preconditioner.

97 MATHEMATICS AND COMPUTING↗

The accuracies of effective interactions in downfolding coupled-cluster approaches for small-dimensionality active spaces

Here, this paper evaluates the accuracy of the Hermitian form of the downfolding procedure using the double unitary coupled cluster (DUCC) ansatz on the benchmark systems of linear chains of hydrogen atoms, H6 and H8. The computational infrastructure employs the occupation-number-representation codes to construct the matrix representation of arbitrary second-quantized operators, allowing for the exact representation of exponentials of various operators. The tests demonstrate that external amplitudes from standard single-reference coupled cluster methods that sufficiently describe external (out-of-active-space) correlations reliably parameterize the Hermitian downfolded effective Hamiltonians in the DUCC formalism. The results show that this approach can overcome the problems associated with losing the variational character of corresponding energies in the corresponding SR-CC theories.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

One pion production in neutrino reactions: Including nonresonant background

We investigate neutrino-induced one pion production on nucleons. The elementary neutrino-nucleon cross section is calculated as the sum of the leading Delta pole diagram and several background diagrams obtained within the nonlinear sigma model. This approach does not introduce any new adjustable parameters, which allows unambiguous predictions for the observables. Considering electroproduction experiments as benchmark, the model is shown to be applicable up to pion-nucleon invariant mass W<1.4 GeV and provides a good accuracy. With respect to the total one pion cross section, the model predicts the background at the level of 10% for the p{pi}{sup +}, 30% for p{pi}{sup 0}, and 50% for n{pi}{sup +} final states. The results are compared with experimental data for various differential cross sections. Distributions with respect to muon-nucleon and muon-pion invariant masses are presented for the first time. The model describes the data quite well, with the discrepancies being of the same order as those between different data sets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Development of a CFD code for internal flows in liquid fueled engines

To support the design efforts of engines in which liquid propellants are used, one is often required to analyze incompressible, two-dimensional or axisymmetric flows within ducts and cavities with rotating walls and complicated geometries. The steady-state solution is of interest in most cases. This code is intended to provide a tool for efficient computational fluid dynamics (CFD) analysis of such flow problems, taking advantage of the artificial compressibility concept and the Beam-Warming numerical scheme modified for second order accurate, implicit boundary conditions. These concepts ensure a stable, robust, and accurate algorithm due to the reduced speed of sound and the accuracy of the boundary conditions. The code is dedicated only to two-dimensional or axisymmetric flows with or without swirl. Three-dimensional computation is excluded to increase efficiency and speed. This paper briefly presents the theory of the code, as well as several benchmark applications with comparison to well known analytical solutions. In all these test cases, the code produced accurate results.

Dakhoul, Youssef↗

Neutron noise calculations in a hexagonal geometry and comparison with analytical solutions

This paper presents the development of a neutronic and kinetic solver for hexagonal geometries. The tool is developed based on the diffusion theory with multi-energy groups and multi-groups of delayed neutron precursors allowing the solutions of forward and adjoint problems of static and dynamic states, and is applicable to both thermal and fast systems with hexagonal geometries. In the dynamic problems, the small stationary fluctuations of macroscopic cross sections are considered as noise sources, and then the induced first order noise is calculated fully in the frequency domain. Numerical algorithms for solving the static and noise equations are implemented with a spatial discretization based on finite differences and a power iterative solution. A coarse mesh finite difference method has been adopted for speeding up the convergence. Since no other numerical tool could calculate frequency-dependent noise in hexagonal geometry, validation calculations have been performed and benchmarked to analytical solutions based on a 2-D homogeneous system with two-energy groups and one-group of delayed neutron precursor, in which point-like perturbations of thermal absorption cross section at central and non-central positions are considered as noise sources. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Hotspot Coevolution Is a Key Identifier of Near-Native Protein Complexes

Protein–protein interactions play a key role in mediating numerous biological functions, with more than half the proteins in living organisms existing as either homo- or hetero-oligomeric assemblies. Protein subunits that form oligomers minimize the free energy of the complex, but exhaustive computational search-based docking methods have not comprehensively addressed the challenge of distinguishing a natively bound complex from non-native forms. Current protein docking approaches address this problem by sampling multiple binding modes in proteins and scoring each mode, with the lowest-energy (or highest scoring) binding mode being regarded as a near-native complex. However, high-scoring modes often match poorly with the true bound form, suggesting a need for improvement of the scoring function. Here in this study, we propose a scoring function, KFC-E, that accounts for both conservation and coevolution of putative binding hotspot residues at protein–protein interfaces. We tested KFC-E on four benchmark sets of unbound examples and two benchmark sets of bound examples, with the results demonstrating a clear improvement over scores that examine conservation and coevolution across the entire interface.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An MLIR-based Compiler Flow for System-Level Design and Hardware Acceleration

The generation of custom hardware accelerators for applications implemented within high-level productive programming frameworks requires considerable manual effort. To automate this process, we introduce \sodaopt, a compiler tool that extends the MLIR infrastructure. \sodaopt automatically searches, outlines, tiles, and pre-optimizes relevant code regions to generate high-quality accelerators through high-level synthesis. \sodaopt can support any high-level programming framework and domain-specific language that interface with the MLIR infrastructure. By leveraging MLIR, \sodaopt solves compiler optimization problems with specialized abstractions. Backend synthesis tools connect to \sodaopt through progressive intermediate representation lowerings. \sodaopt interfaces to a design space exploration engine to identify the combination of compiler optimization passes and options that provides high-performance generated designs for different backends and targets. We demonstrate the practical applicability of the compilation flow by exploring the automatic generation of accelerators for deep neural networks operators outlined at arbitrary granularity and by combining outlining with tiling on large convolution layers. Experimental results with kernels from the PolyBench benchmark show that \sodaopt high-level optimizations improve execution delays of synthesized accelerators up to 60x. We also show that for the selected kernels, our solution outperforms the current of state-of-the art in more than 70% of the benchmarks and provides better average speedup in 55% of them.

Bohm Agostini, Nicolas↗

Multi-Area Distribution System State Estimation Using Decentralized Physics-Aware Neural Networks

The development of active distribution grids requires more accurate and lower computational cost state estimation. In this paper, the authors investigate a decentralized learning-based distribution system state estimation (DSSE) approach for large distribution grids. The proposed approach decomposes the feeder-level DSSE into subarea-level estimation problems that can be solved independently. The proposed method is decentralized pruned physics-aware neural network (D-P2N2). The physical grid topology is used to parsimoniously design the connections between different hidden layers of the D-P2N2. Monte Carlo simulations based on one-year of load consumption data collected from smart meters for a three-phase distribution system power flow are developed to generate the measurement and voltage state data. The IEEE 123-node system is selected as the test network to benchmark the proposed algorithm against the classic weighted least squares and state-of-the-art learning-based DSSE approaches. Numerical results show that the D-P2N2 outperforms the state-of-the-art methods in terms of estimation accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗

New NAS Parallel Benchmarks Results

NPB2 (NAS (NASA Advanced Supercomputing) Parallel Benchmarks 2) is an implementation, based on Fortran and the MPI (message passing interface) message passing standard, of the original NAS Parallel Benchmark specifications. NPB2 programs are run with little or no tuning, in contrast to NPB vendor implementations, which are highly optimized for specific architectures. NPB2 results complement, rather than replace, NPB results. Because they have not been optimized by vendors, NPB2 implementations approximate the performance a typical user can expect for a portable parallel program on distributed memory parallel computers. Together these results provide an insightful comparison of the real-world performance of high-performance computers. New NPB2 features: New implementation (CG), new workstation class problem sizes, new serial sample versions, more performance statistics.

Yarrow, Maurice↗

Distributed out-of-memory NMF on CPU/GPU architectures

We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density 10 -6 .

97 MATHEMATICS AND COMPUTING↗