Search NASA⌕ Search

SEARCH · Search NASA

Results for “Diffusion problems”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Accelerating network layouts using graph neural networks

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A higher-order finite element reactive transport model for unstructured and fractured grids

Abstract This work presents a new reactive transport framework that combines a powerful geochemistry engine with advanced numerical methods for flow and transport in subsurface fractured porous media. Specifically, the PhreeqcRM interface (developed by the USGS) is used to take advantage of a large library of equilibrium and kinetic aqueous and fluid-rock reactions, which has been validated by numerous experiments and benchmark studies. Fluid flow is modeled by the Mixed Hybrid Finite Element (FE) method, which provides smooth velocity fields even in highly heterogenous formations with discrete fractures. A multilinear Discontinuous Galerkin FE method is used to solve the multicomponent transport problem. This method is locally mass conserving and its second order convergence significantly reduces numerical dispersion. In terms of thermodynamics, the aqueous phase is considered as a compressible fluid and its properties are derived from a Cubic Plus Association (CPA) equation of state. The new simulator is validated against several benchmark problems (involving, e.g., Fickian and Nernst-Planck diffusion, isotope fractionation, advection-dispersion transport, and rock-fluid reactions) before demonstrating the expanded capabilities offered by the underlying FE foundation, such as high computational efficiency, parallelizability, low numerical dispersion, unstructured 3D gridding, and discrete fraction modeling.

58 GEOSCIENCES↗
DOE OSTI2024

Bragg Spot Finder (BSF): a new machine-learning-aided approach to deal with spot finding for rapidly filtering diffraction pattern images

Macromolecular crystallography contributes significantly to understanding diseases and, more importantly, how to treat them by providing atomic resolution 3D structures of proteins. This is achieved by collecting X-ray diffraction images of protein crystals from important biological pathways. Spotfinders are used to detect the presence of crystals with usable data, and the spots from such crystals are the primary data used to solve the relevant structures. Having fast and accurate spot finding is essential, but recent advances in synchrotron beamlines used to generate X-ray diffraction images have brought us to the limits of what the best existing spotfinders can do. This bottleneck must be removed so spotfinder software can keep pace with the X-ray beamline hardware improvements and be able to see the weak or diffuse spots required to solve the most challenging problems encountered when working with diffraction images. In this paper, we first present Bragg Spot Detection (BSD), a large benchmark Bragg spot image dataset that contains 304 images with more than 66 000 spots. We then discuss the open source extensible U-Net-based spotfinder Bragg Spot Finder (BSF), with image pre-processing, a U-Net segmentation backbone, and post-processing that includes artifact removal and watershed segmentation. Finally, we perform experiments on the BSD benchmark and obtain results that are (in terms of accuracy) comparable to or better than those obtained with two popular spotfinder software packages ( Dozor and DIALS ), demonstrating that this is an appropriate framework to support future extensions and improvements.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Distributed Multi-GPU Community Detection on Exascale Computing Platforms

Community detection is a fundamental operation in graph mining, and by uncovering hidden structures and patterns within complex systems it helps solve fundamental problems pertaining to social networks, such as information diffusion, epidemics, and recommender systems. Scaling graph algorithms for massive networks becomes challenging on modern distributed-memory multi-GPU (Graphics Processing Unit) systems due to limitations such as irregular memory access patterns, load imbalances, higher communication-computation ratios, and cross-platform support. We present a novel algorithm HiPDPL-GPU (distributed parallel Louvain) to address these challenges. We conduct experiments involving different partitioning techniques to achieve optimized performance of HiPDPL-GPU on the two largest supercomputers: Frontier and Summit. Remarkably, HiPDPL-GPU processes a graph with 4.2 billion edges in less than 3 minutes using 1024 GPUs. Qualitatively performance of HiPDPL-GPU is similar or better compared to other state-of-the-art CPU- and GPU-based implementations. While prior GPU implementations have predominantly employed CUDA, our first-of-its-kind implementation for community detection is cross-platform, accommodating both AMD and NVIDIA GPUs.

graph algorithms, high performance comptuing↗
DOE OSTI2020

Multilevel Techniques for Compression and Reduction of Scientific Data---The Unstructured Case

Previous work on multilevel techniques for compression and reduction of scientific data is extended to the case of data given on unstructured meshes in two and three dimensions. The centerpiece of the work is a decomposition algorithm which is shown to be optimal, in terms of both storage and operational complexity, applicable to unstructured grids in both two and three dimensions, and which implicitly gives a Riesz basis that can be exploited to reduce the data while maintaining rigorous bounds on the loss incurred. The flexibility of the approach is illustrated by applications to potential flow around an airfoil and the effect of compression on quantities of interest relevant to airfoil design; compression of computational simulation of a nonlinear reaction-diffusion system with special attention given to the problem of time series reduction; and, data from a simulation of magnetically confined plasma in a fusion reactor reduced so as to preserve the electric field computed from the data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

The AEOLUS Center is dedicated to developing a unified optimization-under-uncertainty framework for (1) learning predictive models from data and (2) optimizing experiments, processes, and designs governed by these models, all driven by complex, uncertain energy systems. AEOLUS addressed the critical need for principled, rigorous, scalable, and structure-exploiting capabilities for exploring parameter and decision spaces of complex forward simulation models---the so-called outer loop. This report summarizes the work done under DE-SC0021077 on (1) nonlocal models for solidification problems, (2) a multifidelity method for a nonlocal diffusion model, and (3) multifidelity Monte Carlo methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Neural Network Enhanced RKPM for Electrochemical-Mechanical Coupled Damage Modeling of Energy Storage Materials

Energy storage materials undergo significant charge cycling, which makes understanding their reliability and durability fundamental in predicting performance and service life. Strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking, largely along material interfaces and grain boundaries. For Li-ion batteries, for example, lithium moving between electrodes during charging and discharging process causes expansion and contraction of grains, and the strongly anisotropic and nonlinearly [Li]-dependent grain material properties can cause grains to expand into and contract away from each other, leading to chemo-mechanical cracking. In the first part of this work, a RKPM based computational framework for solving the coupled solid-phase lithium conservation with Fickian diffusion and the lithium concentration dependent anisotropic mechanical problem subjected to a highly nonlinear Butler-Volmer boundary condition is introduced. The choice of RKPM completeness conditions for lithium concentration and mechanical deformation fields, and the variational consistency condition for the domain integration of the coupled problem is first determined. In the second part of this work, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1] is leveraged to accurately capture damage and crack propagation throughout the material, by learning the location, orientation, and sharpness of discontinuity while allowing for a coarser nodal distribution than that is necessary for capturing sharp solution transitions using traditional mesh-based methods. NN-RKPM is used to inform how crack opening and closure in turn affect the coupled chemical equations and material microstructure.

damage modeling↗
DOE OSTI2024

Distributed Multi-GPU Community Detection on Exascale Computing Platforms

Community detection is a fundamental operation in graph mining, and by uncovering hidden structures and patterns within complex systems it helps solve fundamental problems pertaining to social networks, such as information diffusion, epidemics, and recommender systems. Scaling graph algorithms for massive networks becomes challenging on modern distributed-memory multi-GPU (Graphics Processing Unit) systems due to limitations such as irregular memory access patterns, load imbalances, higher communication-computation ratios, and cross-platform support. We present a novel algorithm HiPDPL-GPU (Distributed Parallel Louvain) to address these challenges. We conduct experiments involving different partitioning techniques to achieve an optimized performance of HiPDPL-GPU on the two largest supercomputers: Frontier and Summit. Remarkably, HiPDPL-GPU processes a graph with 4.2 billion edges in less than 3 minutes using 1024 GPUs. Qualitatively, the performance of HiPDPL-GPU is similar or better compared to other state-of-the-art CPU- and GPU-based implementations. While prior GPU implementations have predominantly employed CUDA, our first-of-its-kind implementation for community detection is cross-platform, accommodating both AMD and NVIDIA GPUs.

Sattar, Naw Safrin↗
DOE OSTI2024

Hierarchical Conditioning of Diffusion Models Using Tree-of-Life for Studying Species Evolution

A central problem in biology is to understand how organisms evolve and adapt to their environment by acquiring variations in the observable characteristics or traits of species across the tree of life. With the growing availability of large-scale image repositories in biology and recent advances in generative modeling, there is an opportunity to accelerate the discovery of evolutionary traits automatically from images. Toward this goal, we introduce Phylo-Diffusion, a novel framework for conditioning diffusion models with phylogenetic knowledge represented in the form of HIERarchical Embeddings (HIER-Embeds). We also propose two new experiments for perturbing the embedding space of Phylo-Diffusion: trait masking and trait swapping, inspired by counterpart experiments of gene knockout and gene editing/swapping. Our work represents a novel methodological advance in generative modeling to structure the embedding space of diffusion models using tree-based knowledge. Our work also opens a new chapter of research in evolutionary biology by using generative models to visualize evolutionary changes directly from images. We empirically demonstrate the usefulness of Phylo-Diffusion in capturing meaningful trait variations for fishes and birds, revealing novel insights about the biological mechanisms of their evolution. (Model and code can be found at imageomics.github.io/phylo-diffusion)

Khurana, Mridul↗
DOE OSTI2026

Cross-Modal Guidance for Fast Diffusion-Based Computed Tomography

Diffusion models have emerged as powerful priors for solving inverse problems in computed tomography (CT). In certain applications, such as neutron CT, it can be expensive to collect large amounts of measurements even for a single scan leading to sparse data sets from which it is challenging to obtain high quality reconstructions even with diffusion models. One strategy to mitigate this challenge is to leverage a complementary, easily available imaging modality; however, such approaches typically require retraining the diffusion model with large datasets. In this work, we propose incorporating an additional modality without retraining the diffusion prior, enabling accelerated imaging of costly modalities. We further examine the impact of imperfect side modalities on cross-modal guidance. Our method is evaluated on sparse-view neutron computed tomography, where reconstruction quality is substantially improved by incorporating X-ray computed tomography of the same samples.

Efimov, Timofey [ORNL] (ORCID:000900090098471X)↗
DOE OSTI2023

Simulation study of the effects of polymer network dynamics and mesh confinement on the diffusion and structural relaxation of penetrants

The diffusion of small molecular penetrants through polymeric materials represents an important fundamental problem, relevant to the design of materials for applications such as coatings and membranes. Polymer networks hold promise in these applications because dramatic differences in molecular diffusion can result from subtle changes in the network structure. In this paper, we use molecular simulation to understand the role that cross-linked network polymers have in governing the molecular motion of penetrants. By considering the local, activated alpha relaxation time of the penetrant and its long-time diffusive dynamics, we can determine the relative importance of activated glassy dynamics on penetrants at the segmental scale vs entropic mesh confinement on penetrant diffusion. We vary several parameters, such as the cross-linking density, temperature, and penetrant size, to show that cross-links primarily affect molecular diffusion through the modification of the matrix glass transition, with local penetrant hopping at least partially coupled to the segmental relaxation of the polymer network. This coupling is very sensitive to the local activated segmental dynamics of the surrounding matrix, and we also show that penetrant transport is affected by dynamic heterogeneity at low temperatures. To contrast, only at high temperatures and for large penetrants or when the dynamic heterogeneity effect is weak, does the effect of mesh confinement become significant, even though penetrant diffusion more broadly empirically follows similar trends as established models of mesh confinement-based transport.

Chemistry↗
DOE OSTI2021

NRC Multiphysics Analysis Capability Deployment FY21: Part 3

This report details the progress and activities of Idaho National Laboratory (INL) on the Nuclear Regulatory Commission (NRC) project “Development and Modeling Support for Advanced Non-Light Water Reactors.” The deliverables completed for this report are: Deliverable 1c: the capability to model gas mixtures was added to Pronghorn. A test problem mimicking the conditions achieved in a depressurized loss of forced cooling (DLOFC) event was solved with both RELAP-5 and Pronghorn. Pronghorn employed a finite vol ume method with the Kurganov-Tadmor discretization. The comparison between the mass fraction spatial profiles computed with RELAP-5 and Pronghorn clearly shows the presence of numerical artifacts (i.e., overly diffusive behavior at low Mach numbers). We confirmed that the problem disappears at higher Mach numbers. We recommend future work on the implementation of a low Mach finite volume formulation to better treat low Mach number problems. Deliverable 2a: we demonstrated two approaches to model the radiation/conduction/natural convection heat transfer across a stagnant gas for the PBMR-400 design using Pronghorn. The first approach is based on the net radiation method, which relies on the computation of view factors with the Multiphysics Object-Oriented Simulation Environment (MOOSE) ray tracing capability. The second method is a traditional thermal resistance approach. The test problems include both 2D and 3D geometries. In all cases, the results show very good agreement during a DLOFC transient. This confirms that the faster thermal resistance method produces solutions that are equivalent to the net radiation method for this geometry. Deliverable 3d: we demonstrated the use of the advection kernel for the delayed neutron precursor equation in Griffin with a 2D MSFR model. The results appear physical but further verification is recommended. We also recommend the addition of conjugate heat transfer to compute the temperatures and model the thermomechanic behavior of the reflectors and other structures. Significant memory and performance issues were encountered in the 3D axisymmetric model. Future work is recommended in this area. Task 8g: this task allows multidimensional MOOSE applications to be coupled to system codes (RELAP-7 and SAM). We implemented a faster multiphysics iteration coupling algorithm, which provides an overall 6× acceleration of the 3D-1D coupling of the core multidi- mensional fluid flow solver and the 1D primary and secondary loop model.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Preserving Tracer Correlations in Moment-Based Atmospheric Transport Models

A linear non-diffusive algorithm for advective transport is developed that greatly improves the detail at which aerosols and clouds can be represented in atmospheric models. Linear advection schemes preserve tracer correlations but the most basic linear scheme is rarely used by atmospheric modelers on account of its excessive numerical diffusion. Higher-order schemes are in widespread use, but these present new problems as nonlinear adjustments are required to avoid occurrences of negative concentrations, spurious oscillations, and other non-physical effects. Generally successful at reducing numerical diffusion during the advection of individual tracers, for example, particle number or mass, the higher-order schemes fail to preserve even the simplest of correlations between interrelated tracers. As a result, important attributes of aerosol and cloud populations including radial moments of particle size distributions, molecular precursors related through chemical equilibria, aerosol mixing state, and distribution of cloud phase are poorly represented. We introduce a new transport scheme, minVAR, that is both non-diffusive and preservative of tracer correlations, thereby combining the best features of the basic and higher-order schemes while enabling new features such as the tracking of sub-grid information at arbitrarily fine scales with high computational efficiency.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

High-Level Synthesis of Irregular Applications: A Case Study on Influence Maximization

The Influence Maximization problem is the problem of identifying a small cohort of actors from a broader population that, when initially activated in a diffusion process, are expected to result in a large number of activations in the population. While the problem is known to be NP-hard, several approximation algorithms have been devised by leveraging its submodular structure. While these algorithms are theoretically efficient, they are computationally very expensive in practice. This work advances the current state-of-the-art parallelization scheme for the IMM algorithm by devising the adoption of custom hardware accelerators implemented on FPGAs by leveraging High Level Synthesis from OpenCL. We study the performance of our proposed approach by exploring optimizations tailored at improving the parallel efficiency of the accelerators and highlight their effects and limitations in accelerating complex graph analytic applications. Our experimental evaluation shows that FPGA acceleration can improve the performance of the LT diffusion model up to 1.72x for the entire application and up to 2.90x for its most important kernel with respect to a CPU only parallel execution. The FPGA acceleration of the LT model shows also a 1.54x reduction in energy consumption when compared to a parallel CPU only run.

Neff, Reece W.↗
DOE OSTI2020

Solid 3D Li–S Battery Design via Stacking 2D Conductive Microporous Coordination Polymers and Amorphous Li–S Layers

To make a lithium-sulfur (Li-S) battery practical, not only high gravimetric energy capacity is important, but also high volumetric energy capacity will be required. The currently explored Li-S cathode designs often deploy systems with liquid electrolyte infiltration, hence with relatively low volumetric capacity. In the current study, we theoretically test a compact solid three-dimensional (3D) design (more like a Li-ion battery cathode than a conventional Li-S cathode) consisted of a sandwich structure alternating between the two-dimensional (2D) Mn-hexaaminobenzene-based coordination polymer (2D Mn-HAB-CP) layer and the amorphous Li-S layer. We study the theoretical limits for both its gravimetric and volumetric energy capacity, as well as its structural stability and Li diffusion within the cathode system. To study the Li diffusion within an amorphous system, we also develop a pull-atom molecular dynamics (PA-MD) to calculate the barrier heights of such disordered systems. We reveal the mechanism that determines the Li diffusion in the amorphous layer of the system. Overall, we find such a 3D solid Li-S cathode can be practical, with sufficient large gravimetric and volumetric energy capacity, as well as the Li diffusion constant. It also solves many other common Li-S cathode problems, from Li polysulfide dissolution to electrical insulating, and structure instabilities.

25 ENERGY STORAGE↗
DOE OSTI2023

Reinforcement Learning-Guided Long-Timescale Simulation of Hydrogen Transport in Metals

Diffusion in alloys is an important class of atomic processes. However, atomistic simulations of diffusion in chemically complex solids are confronted with the timescale problem: the accessible simulation time is usually far shorter than that of experimental interest. In this work, long-timescale simulation methods are developed using reinforcement learning (RL) that extends simulation capability to match the duration of experimental interest. Two special limits, RL transition kinetics simulator (TKS) and RL low-energy states sampler (LSS), are implemented and explained in detail, while the meaning of general RL are also discussed. As a testbed, hydrogen diffusivity is computed using RL TKS in pure metals and a medium entropy alloy, CrCoNi, and compared with experiments. The algorithm can produce counter-intuitive hydrogen-vacancy cooperative motion. We also demonstrate that RL LSS can accelerate the sampling of low-energy configurations compared to the Metropolis–Hastings algorithm, using hydrogen migration to copper (111) surface as an example.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Ensemble flow reconstruction in the atmospheric boundary layer from spatially limited measurements through latent diffusion models

Due to costs and practical constraints, field campaigns in the atmospheric boundary layer typically only measure a fraction of the atmospheric volume of interest. Machine learning techniques have previously successfully reconstructed unobserved regions of flow in canonical fluid mechanics problems and two-dimensional geophysical flows, but these techniques have not yet been demonstrated in the three-dimensional atmospheric boundary layer. Here, we conduct a numerical analogue of a field campaign with spatially limited measurements using large-eddy simulation. We pose flow reconstruction as an inpainting problem, and reconstruct realistic samples of turbulent, three-dimensional flow with the use of a latent diffusion model. The diffusion model generates physically plausible turbulent structures on larger spatial scales, even when input observations cover less than 1% of the volume. Through a combination of qualitative visualization and quantitative assessment, we demonstrate that the diffusion model generates meaningfully diverse samples when conditioned on just one observation. These samples successfully serve as initial conditions for a large-eddy simulation code. We find that diffusion models show promise and potential for other applications for other turbulent flow reconstruction problems.

17 WIND ENERGY↗
DOE OSTI2023

Bayesian sequential optimal experimental design for nonlinear models using policy gradient reinforcement learning

We present a mathematical framework and computational methods for optimally designing a finite sequence of experiments. This sequential optimal experimental design (sOED) problem is formulated as a finite-horizon partially observable Markov decision process (POMDP) under a Bayesian setting and with information-theoretic utilities. The formulation is general and may accommodate continuous random variables, non-Gaussian posteriors, and nonlinear forward models. The sOED design policy incorporates elements of feedback and lookahead simultaneously, and we show it to generalize the commonly-used batch and greedy design strategies. We solve for the sOED policy using the policy gradient (PG) method from reinforcement learning, and provide a derivation for the PG expression in the sOED context. Adopting an actor-critic approach, the policy and value functions are parameterized using deep neural networks and improved via PG estimates produced from simulated episodes of designs and observations. The new PG-sOED algorithm is first validated on a linear-Gaussian benchmark, and then compared against other design baselines on a sensor movement problem for contaminant source inversion in a convection-diffusion field. As a result, we provide explanation for the policy behaviors using knowledge of the underlying physical process.

97 MATHEMATICS AND COMPUTING↗