Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graphical”

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 379 records · Page 21

Hardware acceleration for HPS algorithms in two and three dimensions

We provide a flexible, open-source framework for hardware acceleration, namely massively-parallel execution on general-purpose graphics processing units (GPUs), applied to the hierarchical Poincaré–Steklov (HPS) family of algorithms for building fast direct solvers for linear elliptic partial differential equations. To take full advantage of the power of hardware acceleration, we propose two variants of HPS algorithms to improve performance on two- and three-dimensional problems. In the two-dimensional setting, we introduce a novel recomputation strategy that minimizes costly data transfers to and from the GPU; in three dimensions, we modify and extend the adaptive discretization technique of Geldermans and Gillman [1] to greatly reduce peak memory usage. We provide an open-source implementation of these methods written in JAX, a high-level accelerated linear algebra package, which allows for the first integration of a high-order fast direct solver with automatic differentiation tools. We conclude with extensive numerical examples showing our methods are fast and accurate on two- and three-dimensional problems.

Fast direct solvers↗

Kernel fusion in atomistic spin dynamics simulations on Nvidia GPUs using tensor core

In atomistic spin dynamics simulations, the time cost of constructing the space- and time-displaced pair correlation function in real space increases quadratically as the number of spins N, leading to significant computational effort. The GEMM subroutine can be adopted to accelerate the calculation of the dynamical spin-spin correlation function, but the computational cost of simulating large spin systems (>40000 spins) on CPUs remains expensive. In this work, we perform the simulation on the graphics processing unit (GPU), a hardware solution widely used as an accelerator for scientific computing and deep learning. Here we show that GPUs can accelerate the simulation up to 25-fold compared to multi-core CPUs when using the GEMM subroutine on both. To hide memory latency, we fuse the element-wise operation into the GEMM kernel using CUTLASS that can improve the performance by 26% ~ 33% compared to implementation based on cuBLAS. Furthermore, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which makes the large-scale atomistic spin dynamics simulation feasible and affordable.

97 MATHEMATICS AND COMPUTING↗

Influence of heterocyclic N-donors on the structural topologies and vibrational spectra of uranyl selenate phases

Uranyl (U(VI)O 2 2+ ) selenate compounds represent a well-studied family of structures with diverse structural arrays. Differences in the overall topology and bonding with the uranyl cation combined with additional intermolecular interactions can lead to variation in the resulting spectroscopic signals. Here, in the current study, we evaluated the structural chemistry and vibrational spectroscopy for uranyl selenates crystallized with heterocyclic N-donors. Five compounds ((C 4 H 12 N 2 )[(UO 2 )(SeO 4 ) 2 (H 2 O)]·H 2 O (USe_pip), (C 4 H 5 N 2 ) 2 [(UO 2 )(SeO 4 ) 2 (H 2 O)] (USe_pyrdz), (C 5 H 5 N) 2 [(UO 2 ) 2 (SeO 4 ) 3 (H 2 O)] ∙ 3H 2 O (USe_pyrmd), (H 3 O) 2 (C 4 H 5 N 2 ) 2 [(UO 2 ) 3 (SeO 4 ) 5 (H 2 O)]·H 2 O (USe_pyrz), and (C 5 H 6 N) 2 [(UO 2 ) 2 (SeO 4 ) 3 (H 2 O)] ∙ 3H 2 O (USe_pyr)) were characterized using X-ray diffraction (single-crystal and powder) and vibrational (Raman and IR) spectroscopy. Two one-dimensional (1-D) chain and three two-dimensional sheet (2-D) topologies were identified and classified based upon previous graphical representations. Overall, the arrangement of the heteroatoms could be linked to the hydrogen bonding network associated with the heterocycles and selenate anions. Vibrational spectra of the solid-state compounds were complex, with multiple bands associated with the uranyl cation, selenate anion, and heteroatoms. The ν 1 symmetric stretching band of the uranyl was relatively consistent across all compounds, whereas differences were observed for the ν 3 asymmetric band between the 1-D and 2-D structural topologies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hydrogen bond network and bond valence analysis on uranyl sulfate compounds with organic-based interstitial cations

Seven new uranyl sulfate compounds with organic charge-balancing cations have been synthesized and structurally characterized. The structural unit topologies of the two chains and five sheets have been previously reported in uranyl sulfate crystal chemistry, although they were synthesized using different organic molecules. With the inclusion of six of these structures to the 48 previously published uranyl sulfate compounds, a total of 54 known uranyl sulfate compounds with organic charge-balancing cations were compiled and analyzed. A graphical approach was used to compare the structural unit topologies, and a bond valence approach was used to quantify the hydrogen bond networks that exist between the interstitial cationic and solvent species to the uranyl sulfate anionic structural units. Finally, this analysis helped elucidate which oxygen atoms in the structural unit receive hydrogen bonds and how the organic cations stabilize the overall crystal structures in this subclass of U(VI) materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A new efficient grain growth model using a random Gaussian-sampled mode filter

This paper presents the use of a Gaussian neighborhood mode filter for predicting grain growth in a manner similar to the solutions obtained by a Monte Carlo Potts model. This flexible grain growth model can quickly utilize modern, computationally optimized data science strategies on graphics processing units to simulate grain growth up to 100 times faster than the state-of-the-art, publicly available Monte Carlo Potts model. We show that, given the correct neighborhood, the mode filter can replicate normal grain growth in two or three dimensions. In addition, the paper briefly demonstrates the ability to model limited anisotropic in grain boundary energy and mobility. Anisotropic grain boundary energy is modeled by defining a weighted mode filter operation. Anisotropic grain boundary mobility is modeled by scaling and orienting the Gaussian neighborhood in a particular direction.

Anisotropy↗

CryoFold: Determining protein structures and data-guided ensembles from cryo-EM density maps

Cryoelectron microscopy requires molecular modeling for refinement of structures. Ensemble models arrive at low free-energy molecular structures, but are computationally expensive and limited to resolving only small proteins. Here, we introduce CryoFold, a pipeline of molecular dynamics simulations that determines ensembles of protein structures by integrating density data of varying sparsity at 3–5 Å resolution with sequence information and coarse-grained topological knowledge of the protein folds. We present six examples, folding proteins between 72 and 2,000 residues, including large membrane and multi-domain systems, and results from two Electron Microscopy Data Bank (EMDB) competitions. Driven by data from a single state, CryoFold discovers ensembles of common low-energy models together with rare low-probability structures that capture the equilibrium distribution of proteins constrained by the density maps. Many of these conformations are experimentally validated and functionally relevant. We arrive at a set of best practices for data-guided protein folding that are controlled using a Python graphical user interface (GUI).

59 BASIC BIOLOGICAL SCIENCES↗

Detect and correct bias in multi-site neuroimaging datasets

The desire to train complex machine learning algorithms and to increase the statistical power in association studies drives neuroimaging research to use ever-larger datasets. The most obvious way to increase sample size is by pooling scans from independent studies. However, simple pooling is often ill-advised as selection, measurement, and confounding biases may creep in and yield spurious correlations. In this work, we combine 35,320 magnetic resonance images of the brain from 17 studies to examine bias in neuroimaging. In the first experiment, Name That Dataset, we provide empirical evidence for the presence of bias by showing that scans can be correctly assigned to their respective dataset with 71.5% accuracy. Given such evidence, we take a closer look at confounding bias, which is often viewed as the main shortcoming in observational studies. In practice, we neither know all potential confounders nor do we have data on them. Hence, we model confounders as unknown, latent variables. Kolmogorov complexity is then used to decide whether the confounded or the causal model provides the simplest factorization of the graphical model. Finally, we present methods for dataset harmonization and study their ability to remove bias in imaging features. In particular, we propose an extension of the recently introduced ComBat algorithm to control for global variation across image features, inspired by adjusting for unknown population stratification in genetics. Overall, our results demonstrate that harmonization can reduce dataset-specific information in image features. Further, confounding bias can be reduced and even turned into a causal relationship. However, harmonization also requires caution as it can easily remove relevant subject-specific information. Code is available at https://github.com/ai-med/Dataset-Bias.

42 ENGINEERING↗

Constellation: The autonomous control and data acquisition system for dynamic experimental setups

The operation of instruments and detectors in laboratory or beamline environments presents a complex challenge, requiring stable operation of multiple concurrent devices, often controlled by separate hardware and software solutions. These environments frequently undergo modifications, such as the inclusion of different auxiliary devices depending on the experiment or facility, adding further complexity. The successful management of such dynamic configurations demands a flexible and robust system capable of controlling data acquisition, monitoring experimental setups, enabling seamless reconfiguration, and integrating new devices with limited effort. This paper presents Constellation, a flexible and network-distributed control and data acquisition software framework tailored to laboratory and beamline environments, that addresses the limitations of existing solutions. The framework is designed with a focus on extensibility, providing a streamlined interface for instrument integration. It supports efficient system setup via network discovery mechanisms, promotes stability through autonomous operational features, and provides comprehensive documentation and supporting tools for operators and application developers such as controllers and logging interfaces. At the core of the architectural design is the autonomy of the individual components, called satellites, which can make independent decisions about their operation and communicate these decisions to other components. This paper introduces the design principles and framework architecture of Constellation, presents the available graphical user interfaces, shares insights from initial successful deployments, and provides an outlook on future developments and applications.

Autonomy↗

A parallel strategy for density functional theory computations on accelerated nodes

Using the Löwdin orthonormalization of tall-skinny matrices as a proxy-app for wavefunction-based Density Functional Theory solvers, we investigate a distributed memory parallel strategy focusing on Graphics Processing Unit (GPU)-accelerated nodes as available on some of the top ranked supercomputers at the present time. Here we present numerical results in the strong limit regime, as it is particularly relevant for First-Principles Molecular Dynamics. We also examine how matrix product-based iterative solvers provide a competitive alternative to dense eigensolvers on GPUs, allowing to push the strong scaling limit of these computations to a larger number of distributed tasks. Our strategy, which relies on replicated Gram matrices and efficient collective communications using the NCCL library, leads to a time-to-solution under 0.5 s for the Löwdin orthonormalization of a tall-skinny matrix of 3000 columns on Summit at Oak Ridge Leadership Facility (OLCF). Given the similarity in computational operations between one iteration of a DFT solver and this proxy-app, this shows the possibility of solving accurately the DFT equations well under a minute for 3000 electronic wave functions, and thus perform First-Principles molecular dynamics of physical systems much larger than traditionally solved on CPU systems.

97 MATHEMATICS AND COMPUTING↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

Injection data analysis using material balance time for CO 2 storage capacity estimation in deep closed saline aquifers

Estimating the ultimate storage capacity of deep saline aquifers is important to address the formation potential to store the envisioned large volumes of CO 2 . Injection data (i.e. injection rate, bottomhole pressure, and cumulative injected volume of CO 2 ) are routinely recorded during storage operations. These data contain valuable information on the subsurface (e.g. the reservoir pore volume and the formation storage capacity) that can be extracted. In this paper, we present a two-step graphical technique to infer the pore volume and the ultimate storage capacity of closed saline aquifers by analyzing the available injection data. First, the pore volume is inferred through adapting the concept of the material balance time. Material balance time is an approximate superposition time function developed to interpret production data from oil and gas wells operating at variable pressure/rate conditions during the boundary-dominated flow period. Using material balance techniques, the ultimate storage capacity is then estimated through linear extrapolation of the average pressure trend to the maximum allowable pressure the formation can withstand. The average pressure is not available in practice, but is can be obtained from the injection data. Two approaches are presented in this study to calculate the average pressure; namely the rigorous and the approximate approaches. Unlike the rigorous approach, the approximate approach does not require a prior knowledge of some reservoir properties (e.g. relative permeability, absolute permeability, formation porosity and thickness) to calculate the average pressure. To investigate its potential and reliability in analyzing CO 2 injection data, the proposed technique is applied to four synthetic cases representing different well operating conditions. Results indicate that the approximate approach consistently overestimates the actual (simulated) storage capacity as compared to the rigorous approach. The agreement - between the inferred and the simulated reservoir pore volume, and between the analytical and numerical estimates of storage capacity - validates the potential application of the technique to CO 2 storage in closed saline aquifers. The technique is further substantiated through application to a field data set utilized from a commercial-scale geological storage (CGS) project. Finally, field data interpretation shows that the proposed technique can be utilized to identify the degree of hydraulic continuity and reservoir compartmentalization within a target formation by interpreting the corresponding pressure and rate responses.

02 PETROLEUM↗

SPH modeling of biomass granular flow: Theoretical implementation and experimental validation

The commercialization of biomass-derived energy is impeded by flowability challenges arising from the feeding and handling of granular biomass materials in full-scale biorefineries. To overcome these obstacles, a robust and accurate model to simulate the flow of granular biomass is indispensable. However, conventional mesh-based numerical codes are limited by inherent mesh distortion in simulating large deformation that commonly occurs in granular biomass handling. Here, in this study, we propose a graphics processing unit (GPU)-accelerated meshless Smoothed Particle Hydrodynamics (SPH) code to model the flow of granular biomass materials. A modified void ratio-based mass conversation, a hybrid particle-to-particle/surface frictional boundary treatment, and a hypoplastic constitutive model are implemented. Four numerical examples, an elastic block sliding on inclined planes, sand column collapse, Angle of Repose, and axial compression tests for pine chips, were simulated using the developed SPH code. The results demonstrate good agreement between numerical predictions and analytical and experimental data for all four examples, validating the SPH code and increasing confidence that it can be applied to simulate more complex granular biomass handling processes, such as hopper feeding or auger conveyance.

09 BIOMASS FUELS↗

A High-Performance Discrete-Element Framework for Simulating Flow and Jamming of Moisture Bearing Biomass Feedstocks

We developed and verified a high-performance open-source discrete element method (DEM) solver with simultaneously-supported feedstock-specific interaction models, including bonded-sphere, liquid bridge, cohesion, and non-linear contact models. Our solver uses parallel data structures on hybrid central and graphics processing unit (CPU/GPU) architectures, with favorable strong scaling performance observed for large problem sizes comprised of (100 M particles), and 4X single-node GPU speedup. The particles for corn stover feedstock were conceptualized and calibrated based on experimental measurements and results. Sensitivity analyses demonstrate that the mass flow rate from a wedge hopper is governed primarily by moisture content, friction coefficient, and cohesion energy density. The model is used to reproduce experimentally observed hopper jamming results, highlighting that the experimental no-flow trends can only be achieved by using non-spherical particles, liquid bridge and cohesion models, highlighting the importance of using concurrent feedstock specialized models for the effective representation of biomass material handling problems.

bioenergy↗

A Review of the Lawrence Livermore Nuclear Accident Dosimeter 1980s-present

A Nuclear Accident Dosimetry program is a federal requirement for all facilities that have the potential to have a criticality accident. Personnel Nuclear Accident Dosimeter (PNAD) theory and analytical procedures are driven by various scientific needs and interacting regulations. A brief history of the status of USA Department of Energy (DOE) nuclear accident dosimetry regulations, recommendations, and performance testing criteria are given. Then, the history of the Lawrence Livermore National Laboratory (LLNL) PNAD is explored, including changes in the physical dosimeter and adjustments of the analysis method through the last four decades. Finally, the performance of LLNL’s PNAD at criticality accident intercomparison training exercises since 2009 is explored. In general, reported neutron doses have been within or close to DOE-STD-1098 performance criteria while reported gamma doses have been outside of DOE-STD-1098 performance criteria. Reported total absorbed doses have varied in meeting ANSI/HPS N13.3 and ANSI/HPS N13.3 (R2019) performance criteria. Dosimetry staff retirement and turnover have left historical knowledge gaps, yet provided opportunities within the NAD program at LLNL. This review paper serves as an overview of the history and status of the NAD program. Brief technical, procedural and programmatic recommendations to improve LLNL’s NAD program are given. Technical recommendations include investigating orientation factors through modeling or empirical experimentation, investigating gamma dosimetry methods for high-dose scenarios, and exploring other dosimetric methods for simpler, quicker NAD analysis. Procedural recommendations include better documentation of conversion factor (activity-to-fluence and fluence-to-dose) derivations and spectrum uses, and updated analysis spreadsheets or simple Graphic User Interfaces for dose calculations. In conclusion, programmatic recommendations include formalized training for NAD analysts, and having multiple SMEs trained on the NAD program.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Uncertainty quantification for Multiphase-CFD simulations of bubbly flows: a machine learning-based Bayesian approach supported by high-resolution experiments

In this paper, we developed a machine learning-based Bayesian approach to inversely quantify and reduce the uncertainties of multiphase computational fluid dynamics (MCFD) simulations for bubbly flows. The proposed approach is supported by high-resolution two-phase flow measurements, including those by double-sensor conductivity probes, high-speed imaging, and particle image velocimetry. Local distributions of key physical quantities of interest (QoIs), including the void fraction and phasic velocities, are obtained to support the Bayesian inference. In the process, the epistemic uncertainties of the closure relations are inversely quantified while the aleatory uncertainties from stochastic fluctuations of the system are evaluated based on experimental uncertainty analysis. The combined uncertainties are then propagated through the MCFD solver to obtain uncertainties of the QoIs, based on which probability-boxes are constructed for validation. The proposed approach relies on three machine learning methods: feedforward neural networks and principal component analysis for surrogate modeling, and Gaussian processes for model form uncertainty modeling. The whole process is implemented within the framework of an open-source deep learning library PyTorch with graphics processing unit (GPU) acceleration, thus ensuring the efficiency of the computation. The results demonstrate that with the support of high-resolution data, the uncertainties of MCFD simulations can be significantly reduced. The proposed approach has the potential for other applications that involve numerical models with empirical parameters.

42 ENGINEERING↗

Interpretable artificial intelligence and exascale molecular dynamics simulations to reveal kinetics: Applications to Alzheimer's disease

The rapid increase in computing power, especially with the integration of graphics processing units, has dramatically increased the capabilities of molecular dynamics simulations. To date, these capabilities extend from running very long simulations (tens to hundreds of microseconds) to thousands of short simulations. However, the expansive data generated in these simulations must be made interpretable not only by the investigator who performs them but also by others as well. Here, we demonstrate how integrating learning techniques, such as artificial intelligence, machine learning, and neural networks, into analysis pipelines can reveal the kinetics of Alzheimer's disease (AD) protein aggregation. Finally, we review select AD targets, describe current simulation methods, and introduce learning concepts and their application in AD, highlighting limitations and potential solutions.

59 BASIC BIOLOGICAL SCIENCES↗

CDB-AP: An application for coincidence Doppler broadening spectroscopy analysis

Coincidence Doppler Broadening (CDB) Positron Annihilation Spectroscopy (PAS) is a material analysis technique that can be used to non-destructively measure characteristics of structural defects in samples. Analyzing and comparing large datasets obtained using this technique, however, can be complicated and time intensive. The Coincidence Doppler Broadening Analysis Program (CDB-AP) is a graphical user interface that facilitates rapid analysis of many data files while using transparent processes. It is already used in three laboratories at Idaho National Laboratory and can be used in laboratories worldwide.

36 MATERIALS SCIENCE↗